Tiered Arithmetics

DOI10.1007/978-3-319-63334-3_6zbMath1429.03150OpenAlexW4238032713MaRDI QIDQ5214784

Helmut Schwichtenberg, Stanley S. Wainer

Publication date: 5 February 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63334-3_6

zbMATH Keywords

polynomial timeprogram extractionfast and slow-growing hierarchieslinear two-sorted arithmeticpointwise transfinite inductiontiered arithmetic

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• An independence result for \((\Pi^ 1_ 1-CA)+BI\)
• The realm of primitive recursion
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• A new recursion-theoretic characterization of the polytime functions
• Finite investigations of transfinite derivations
• Polytime, combinatory logic and positive safe induction
• Zur Deutung der intuitionistischen Logik
• Proofs and Computations
• Pointwise Transfinite Induction and a Miniaturized Predicativity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tiered Arithmetics