On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
DOI10.1016/j.apal.2005.05.005zbMath1087.03037OpenAlexW2130354981MaRDI QIDQ2566065
Albert Visser, Lev D. Beklemishev
Publication date: 22 September 2005
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.05.005
inference ruleelementary arithmeticinterpretability logicordinal analysisreflection principlesconservativityparameter-free induction
First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The logic of \(\Pi_ 1\)-conservativity
- The logic of \(\Pi_ 1\)-conservativity continued
- Proof-theoretic analysis by iterated reflection
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
- Iterated local reflection versus iterated consistency
- Parameter free induction and provably total computable functions
- On parameter free induction schemas
- The interpretability logic of Peano arithmetic
- Transfinite recursive progressions of axiomatic theories
- Systems of Logic Based on Ordinals†
This page was built for publication: On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories