scientific article; zbMATH DE number 1215494

zbMath0911.03029MaRDI QIDQ4215631

Samuel R. Buss

Publication date: 4 May 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

incompletenesscut-eliminationfirst-order arithmeticbootstrappingfragmentsprovably total functionsrelative strengthproof-theoretic foundations

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30)

Related Items

J-Calc: a typed lambda calculus for intuitionistic justification logic ⋮ Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) ⋮ Preservation theorems for bounded formulas ⋮ Typical forcings, NP search problems and an extension of a theorem of Riis ⋮ Collapsing modular counting in bounded arithmetic and constant depth propositional proofs ⋮ Primitive recursive reverse mathematics ⋮ Parity Games and Propositional Proofs ⋮ Integer factoring and modular square roots ⋮ Mining the surface: witnessing the low complexity theorems of arithmetic ⋮ Strict finitism and the happy sorites ⋮ Unnamed Item ⋮ Build your own clarithmetic I: Setup and completeness ⋮ Theories with self-application and computational complexity. ⋮ A note on the Σ₁collection scheme and fragments of bounded arithmetic ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Harrington's conservation theorem redone ⋮ The scope of Gödel's first incompleteness theorem ⋮ Partially definable forcing and bounded arithmetic ⋮ Feasibly constructive proofs of succinct weak circuit lower bounds ⋮ 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 ⋮ Abstract deduction and inferential models for type theory ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ On the correspondence between arithmetic theories and propositional proof systems – a survey ⋮ The implicit commitment of arithmetical theories and its semantic core ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ Truth, disjunction, and induction ⋮ The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) ⋮ The strength of sharply bounded induction ⋮ Saturated models of universal theories