Complexity of Gödel’s T in λ-Formulation
From MaRDI portal
Publication:3637208
DOI10.1007/978-3-642-02273-9_28zbMath1238.03024OpenAlexW99998675MaRDI QIDQ3637208
Gunnar Wilken, Andreas Weiermann
Publication date: 7 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_28
Cites Work
- Unnamed Item
- Unnamed Item
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
- A Uniform Approach to Fundamental Sequences and Hierarchies
- Analyzing Gödel's T Via Expanded Head Reduction Trees
- On n-quantifier induction
This page was built for publication: Complexity of Gödel’s T in λ-Formulation