The closed fragment of the interpretability logic of PRA with a constant for I^1

DOI10.1305/NDJFL/1117755145zbMATH Open1077.03034OpenAlexW1603464552WikidataQ119846420 ScholiaQ119846420MaRDI QIDQ2565986FDOQ2565986

Joost J. Joosten

Publication date: 28 September 2005

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1117755145

zbMATH Keywords

Kripke semanticsprovability logicinterpretability logicclosed fragment

Mathematics Subject Classification ID

Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The formalization of interpretability
• Arithmetization of metamathematics in a general setting
• The interpretability logic of Peano arithmetic
• Self-reference and modal logic
• The interpretability logic of all reasonable arithmetical theories. The new conjecture
• Bimodal logics for extensions of arithmetical theories
• On n-quantifier induction
• A note on the normal form of closed formulas of interpretability logic
• An inside view of EXP; or, The closed fragment of the provability logic of IΔ₀ + Ω₁ with a prepositional constant for EXP
• Induction rules, reflection principles, and provably recursive functions
• Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
• The optimality of induction as an axiomatization of arithmetic
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis and A. S. Troelstra. Reprint
• On the Equivalence Between Logic-Free and Logic-Bearing Systems of Primitive Recursive Arithmetic
• A Free-Variable Theory of Primitive Recursive Arithmetic

Cited In (6)

• An inside view of EXP; or, The closed fragment of the provability logic of IΔ₀ + Ω₁ with a prepositional constant for EXP
• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
• Provability and interpretability logics with restricted realizations
• Interpretability in PRA
• An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics
• Turing-Taylor expansions for arithmetic theories

This page was built for publication: The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)

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