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

DOI<517::AID-MALQ517>3.0.CO;2-A 10.1002/1521-3870(200010)46:4<517::AID-MALQ517>3.0.CO;2-AzbMath0964.03058OpenAlexW2102009936MaRDI QIDQ4521126

Arnold Beckmann, Andreas Weiermann

Publication date: 16 July 2001

Full work available at URL: https://doi.org/10.1002/1521-3870(200010)46:4<517::aid-malq517>3.0.co;2-a

zbMATH Keywords

derivation lengthsGödel's system \(T\)Buchholz' \(\Omega\)-ruleexpanded head reduction trees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Functionals in proof theory (03F10)

Related Items (4)

How to assign ordinal numbers to combinatory terms with polymorphic types ⋮ Continuous normalization for the lambda-calculus and Gödel's T ⋮ Complexity of Gödel’s T in λ-Formulation ⋮ Exact bounds for acyclic higher-order recursion schemes

This page was built for publication: Analyzing Gödel's T Via Expanded Head Reduction Trees