Three papers on proof theory by W. Buchholz and by S. Tupailo

Bulletin of Symbolic Logic 8 (3):437-438 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Three papers on proof theory.W. Buchholz, S. Tupailo & Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-438.
Review: Wilfried Buchholz, Notation Systems for Infinitary Derivations ; Wilfried Buchholz, Explaining Gentzen's Consistency Proof within Infinitary Proof Theory ; Sergei Tupailo, Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
Epsilon substitution method for theories of jump hierarchies.Toshiyasu Arai - 2002 - Archive for Mathematical Logic 41 (2):123-153.
A Buchholz Rule for Modal Fixed Point Logics.Gerhard Jäger & Thomas Studer - 2011 - Logica Universalis 5 (1):1-19.
A direct independence proof of Buchholz's Hydra Game on finite labeled trees.Masahiro Hamano & Mitsuhiro Okada - 1998 - Archive for Mathematical Logic 37 (2):67-89.
Epsilon substitution method for elementary analysis.Grigori Mints, Sergei Tupailo & Wilfried Buchholz - 1996 - Archive for Mathematical Logic 35 (2):103-130.
Proof theory: a selection of papers from the Leeds Proof Theory Programme, 1990.Peter Aczel, Harold Simmons & Stanley S. Wainer (eds.) - 1992 - New York: Cambridge University Press.
A slow growing analogue to buchholz' proof.Toshiyasu Arai - 1991 - Annals of Pure and Applied Logic 54 (2):101-120.
Proof theory of iterated inductive definitions revisited.W. Buchholz - forthcoming - Archive for Mathematical Logic.
Review: Wilfrid Buchholz, Kurt Schutte, Proof Theory of Impredicative Subsystems of Analysis. [REVIEW]Gerhard Jager - 1991 - Journal of Symbolic Logic 56 (1):332-333.
Provable computable selection functions on abstract structures.J. Tucker & J. Zucker - 1992 - In Peter Aczel, Harold Simmons & S. S. Wainer (eds.), Proof Theory: A Selection of Papers From the Leeds Proof Theory Programme, 1990. Cambridge University Press. pp. 275.
Finitary Treatment of Operator Controlled Derivations.Wilfried Buchholz - 2001 - Mathematical Logic Quarterly 47 (3):363-396.

Analytics

Added to PP
2014-03-24

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references