On parameter free induction schemas

DOI10.2307/2274606zbMath0678.03025OpenAlexW4240153990MaRDI QIDQ3834043

Jeffrey Bruce Paris, Rick Kaye, Constantine Dimitracopoulos

Publication date: 1988

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274606

zbMATH Keywords

conservationaxiomatizabilityfragments of arithmeticcollection schemeleast number principleinduction schemecomplexity of axiomatizations

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Related Items

1998 European Summer Meeting of the Association for Symbolic Logic, A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, Restricted polynomial induction versus parameter free ordinary induction, CONSERVATION THEOREMS ON SEMI-CLASSICAL ARITHMETIC, End extensions of models of fragments of \(\mathrm{PA}\), Local reflection, definable elements and 1-provability, Parameter free induction and provably total computable functions, On axiom schemes for \(T\)-provably \(\Delta_1\) formulas, Local induction and provably total computable functions, On two problems concerning end extensions, Proof Theoretic Analysis by Iterated Reflection, Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories, Bounded arithmetic for NC, ALogTIME, L and NL, Fragments of Arithmetic and true sentences, Diophantine induction, AXIOMATIZATION OF PROVABLE n-PROVABILITY, Induction rules in bounded arithmetic, A note on parameter free Π₁ -induction and restricted exponentiation, On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories, Unprovability results for clause set cycles, Induction and Skolemization in saturation theorem proving, The arithmetics of a theory