Publication:4215631
From MaRDI portal
zbMath0911.03029MaRDI QIDQ4215631
Publication date: 4 May 1999
incompleteness; cut-elimination; first-order arithmetic; bootstrapping; fragments; provably total functions; relative strength; proof-theoretic foundations
Related Items
Parity Games and Propositional Proofs, J-Calc: a typed lambda calculus for intuitionistic justification logic, Strict finitism and the happy sorites, A simple proof of Parsons' theorem, Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA, Independence results for variants of sharply bounded induction, Preservation theorems for bounded formulas, Integer factoring and modular square roots, Primitive recursive selection functions for existential assertions over abstract algebras, Harrington's conservation theorem redone, Abstract deduction and inferential models for type theory, Theories with self-application and computational complexity., Saturated models of universal theories, The scope of Gödel's first incompleteness theorem, Partially definable forcing and bounded arithmetic, Truth, disjunction, and induction, Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\), The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\), Collapsing modular counting in bounded arithmetic and constant depth propositional proofs, Build your own clarithmetic I: Setup and completeness, The strength of sharply bounded induction, A note on the Σ1collection scheme and fragments of bounded arithmetic, On the correspondence between arithmetic theories and propositional proof systems – a survey
