The optimality of induction as an axiomatization of arithmetic

DOI10.2307/2273332zbMATH Open0515.03018OpenAlexW2016916627MaRDI QIDQ3661556FDOQ3661556

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

• Title not available (Why is that?)
• On n-quantifier induction

Cited In (15)

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

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)