A proof-theoretic analysis of collection
From MaRDI portal
Publication:1267837
DOI10.1007/s001530050099zbMath0916.03038OpenAlexW2091112568MaRDI QIDQ1267837
Publication date: 15 July 1999
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050099
Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20) Relative consistency and interpretations (03F25)
Related Items (14)
Provability algebras and proof-theoretic ordinals. I ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS ⋮ Semi-honest subrecursive degrees and the collection rule in arithmetic ⋮ Local reflection, definable elements and 1-provability ⋮ END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ Local induction and provably total computable functions ⋮ Proof Theoretic Analysis by Iterated Reflection ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ On a strengthening of the non-isomorphism theorem for provability algebras ⋮ On the induction schema for decidable predicates ⋮ On the query complexity of finding a local maximum point. ⋮ Saturated models of universal theories
This page was built for publication: A proof-theoretic analysis of collection
