How to Derive Principles of Interpretability Logic A Toolkit
نویسندگان
چکیده
In this paper, we develop a toolkit to derive principles for the interpetability logic of all reasonable theories by fine-tuning ILM and ILP proofs.
منابع مشابه
Unary Interpretability Logic
Let T be an arithmetical theory. We introduce a unary modal operator T to be interpreted arithmetically as the unary interpretability predicate over T. We present complete axiomatizations of the (unary) interpretability principles underlying two important classes of theories. We also prove some basic modal results about these new axiomatizations.
متن کاملInterpretability in PRA
In this paper we study IL(PRA), the interpretability logic of PRA. As PRA is neither an essentially reflexive theory nor finitely axiomatizable, the two known arithmetical completeness results do not apply to PRA: IL(PRA) is not ILM or ILP. IL(PRA) does of course contain all the principles known to be part of IL(All), the interpretability logic of the principles common to all reasonable arithme...
متن کاملBisimulation quotients of Veltman models
Interpretability logic is a modal description of the interpretability predicate. The modal system IL is an extension of the provability logic GL (Gödel–Löb). Bisimulation quotients and largest bisimulations have been well studied for Kripke models. We examine interpretability logic and consider how these results extend to Veltman models. REPORTS ON MATHEMATICAL LOGIC 40 (2006), 59–73 Domagoj VR...
متن کاملTheoretical principles of ethical architecture in the holy Quran: On the basis of Aristotelian logic in Islamic school of thought
This research is a Qur'anic review that examines the effects of ethics on architecture from the Holy Qur'an’s point of view with the goal of introducing logical theoretical principals of ethical architecture. In order to reach the research goal, this research conducts the Induction, deduction and reverse extraction of research’s resulted theoretical concepts based on Aristotle's formal logic. T...
متن کاملThe Interpretability Logic of Peano Arithmetic
PA is Peano arithmetic. The formula InterppA(r,/l) is a formalization of the assertion that the theory PA + a interprets the theory PA + , O (the variables a and are intended to range over codes of sentences of PA). We extend Solovay's modal analysis of the formalized provability predicate of PA, PrpA(x), to the case of the formalized interpretability relation Interp,,(x, y). The relevant modal...
متن کامل