PP-2008-32: Interpretability in PRA

PP-2008-32: Bilkova, Marta and de Jongh, Dick and Joosten, Joost J. (2008) Interpretability in PRA. [Report]

[thumbnail of Full Text]
Text (Full Text)

Download (236kB) | Preview
[thumbnail of Abstract] Text (Abstract)

Download (1kB)


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
arithmetical theories. In this paper, we take two arithmetical
properties of PRA and see what their consequences in the modal logic
IL(PRA) are. These properties are reflected in the so-called
Beklemishev Principle $B$, and Zambella’s Principle $Z$, neither of
which is a part of IL(All). Both principles and their interrelation
are submitted to a modal study. In particular, we prove a frame
condition for $B$. morover, we prove that $Z$ follows from a
restricted form of $B$. Finally, we give an overview of the known
relationships of IL(PRA) to important other interpetability

Item Type: Report
Report Nr: PP-2008-32
Series Name: Prepublication (PP) Series
Year: 2008
Uncontrolled Keywords: interpetability; arithmetic
Depositing User: Prof. Dick de Jongh
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/306

Actions (login required)

View Item View Item