The optimality of induction as an axiomatization of arithmetic

DOI10.2307/2273332MaRDI QIDQ3661556zbMATHOpenAlexFDO

Authors Daniel M. 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

first order logicprimitive recursive arithmeticinduction scheme

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3207266 (Why is no real title available?)
• On n-quantifier induction

Cited in

(15)

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

This page was built for publication: The optimality of induction as an axiomatization of arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661556)