Analyzing Gödel's T Via Expanded Head Reduction Trees

@article{Beckmann2000AnalyzingGT,
  title={Analyzing G{\"o}del's T Via Expanded Head Reduction Trees},
  author={Arnold Beckmann and Andreas Weiermann},
  journal={Math. Log. Q.},
  year={2000},
  volume={46},
  pages={517-536}
}
Inspired from Buchholz’ ordinal analysis of ID1 and Beckmann’s analysis of the simple typed λ-calculus we classify the derivation lengths for Gödel’s system T in the λ-formulation (where the η-rule is included). Mathematics Subject Classification: 03F10, 03F30, 03D15, 03D20. 
BETA

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Sharp upper bounds for the depths of reduction trees of typed λ-calculus with recursors

  • G. Wilken, A. Weiermann
  • (Received: March
  • 1998
1 Excerpt

A uniform approach to fundamental sequences and hierarchies

  • W. Buchholz, E. A. Cichon, A. Weiermann
  • Math. Logic Quarterly
  • 1994
2 Excerpts

Complexity of normalization in the pure typed lambda-calculus

  • H. Schwichtenberg
  • North-Holland Publ. Comp.,
  • 1982

Three contributions to the conference on recent advances in proof theory

  • W. Buchholz
  • Mimeographed
  • 1980

Similar Papers

Loading similar papers…