The optimality of induction as an axiomatization of arithmetic

DOI10.2307/2273332zbMath0515.03018OpenAlexW2016916627MaRDI QIDQ3661556

Daniel Leivant

Publication date: 1983

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

Full work available at URL: https://hdl.handle.net/1813/6290

zbMATH Keywords

primitive recursive arithmeticfirst order logicinduction scheme

Mathematics Subject Classification ID

Classical first-order logic (03B10) Models of arithmetic and set theory (03C62)

Related Items

Reflection algebras and conservation results for theories of iterated truth, A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, Hyperarithmetical worm battles, Induction rules, reflection principles, and provably recursive functions, PREDICATIVITY THROUGH TRANSFINITE REFLECTION, Set-theoretic reflection is equivalent to induction over well-founded classes, Local reflection, definable elements and 1-provability, Unprovability of theorems of complexity theory in weak number theories, Parameter free induction and provably total computable functions, Proof Theoretic Analysis by Iterated Reflection, Uniform density in Lindenbaum algebras, Fragments of Arithmetic and true sentences, AXIOMATIZATION OF PROVABLE n-PROVABILITY, Fragments of arithmetic, The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)

Cites Work

• On n-quantifier induction
• Unnamed Item