Interpretability in PRA

DOI10.1016/j.apal.2009.05.012zbMath1184.03011arXiv2006.10508OpenAlexW2039202381WikidataQ120514404 ScholiaQ120514404MaRDI QIDQ1035648

Marta Bílková, Joost J. Joosten, Dick H. J. de Jongh

Publication date: 4 November 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.10508

zbMATH Keywords

interpretability logicprimitive recursive arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

Theory and application of labelling techniques for interpretability logics ⋮ Provability and interpretability logics with restricted realizations

Cites Work

• The logic of \(\Pi_ 1\)-conservativity
• Induction rules, reflection principles, and provably recursive functions
• Proof-theoretic analysis by iterated reflection
• Undecidable theories
• A new principle in the interpretability logic of all reasonable arithmetical theories
• Modal Matters for Interpretability Logics
• The interpretability logic of Peano arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item