Tiered arithmetics
DOI10.1007/978-3-319-63334-3_6zbMATH Open1429.03150OpenAlexW4238032713MaRDI QIDQ5214784FDOQ5214784
Authors: 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
Recommendations
polynomial timeprogram extractionfast and slow-growing hierarchieslinear two-sorted arithmeticpointwise transfinite inductiontiered arithmetic
Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Proofs and computations
- The realm of primitive recursion
- A new recursion-theoretic characterization of the polytime functions
- Title not available (Why is that?)
- Zur Deutung der intuitionistischen Logik
- Title not available (Why is that?)
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- Title not available (Why is that?)
- Finite investigations of transfinite derivations
- Polytime, combinatory logic and positive safe induction
- The proof theory of classical and constructive inductive definitions. A forty year saga, 1968--2008
- Title not available (Why is that?)
- Pointwise transfinite induction and a miniaturized predicativity
Cited In (1)
This page was built for publication: Tiered arithmetics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214784)
