A. Berarducci. The interpretability logic of Peano arithmetic. Journal of Symbolic Logic, 55:1059--1089, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....operators might also be analyzed using our strategy. A suitable test case would be is given by the binary interpretability operator . whose truth definition is based on a binary relation R and a ternary relation S as follows: w j= OE . iff 9y (Rwy y j= OE 8z (Swyz z j= See Berarducci [5] for further details on this operator. In our comparisons in this paper we focused on equivalence relations between models that were defined by fairly simple first order conditions. De Nicola and Vaandrager [8] study so called branching bisimulations whose definition involves non first order ....

A. Berarducci. The interpretability logic of Peano Arithmetic. Journal of Symbolic Logic, 55:1059--1089, 1990.

....# has more than one interpretation. Another most salient interpretation is # 1 conservativity. More precisely, the arithmetic realization of A # B in a theory T , containing I# 1 , will be that T plus the realization of B is # 1 conservative over T plus the interpretation of A. In Berarducci [Ber90] and Shavrukov [Sha88] it was proved that the interpretability logic (ILM) obtained by adding Montagna s axiom M : p # q) #r) # (q #r) Sas97a] also gave the same method, independently. to IL is complete for this arithmetic interpretation in PA, and hence for interpretability as well, ....

A. Berarducci, The interpretability logic of Peano arithmetic, The Journal of Symbolic Logic, 55, 1990, pp. 1059--1089.

....principle: Montagna s Principle. M A B (A 2C) B 2C) The PA validity of M was known independently to Svejdar and Lindstrom. Arithmetical completeness for the system ILM: IL M was conjectured by A. Visser. It was proved independently by V. Shavrukov (see [17] and A. Berarducci (see [3]) For nice presentations of the proof see also [33] or [12] It turns out that ILM is sound and complete for all reasonable arithmetical theories satisfying full induction. 9 Here wejustverify the arithmetical validityofM. Let T have full induction. Weprove the stronger principle: ffl A T ....

A. Berarducci. The interpretability logic of Peano arithmetic. The Journal of Symbolic Logic, 55:1059--1089, 1990.

....relations between essentially reflexive theories are the same . However, this is not true for finitely axiomatized theories like I Sigma 1 . De Jongh and Veltman [5] introduced the propositional modal logic ILM , whose language contains two modal operators: 2 (unary) and (binary) Berarducci [1] and Shavrukov [7] independently, proved that ILM is the logic of interpretability over PA, that is, ILM yields exactly the schemata of PA provable formulas, when 2A is understood as a formalization of A is PA provable and A B as a formalization of P A B is interpretable in PA A . By the ....

....realization , T A . The rest of the paper is a proof of this theorem. It has a lot of similarity with proofs given in [3] 4] 11] Just as in [3] and [4] I define here a Solovay function in terms of regular witnesses rather than provability in finite subtheories (as this is done in [1], 7] 11] Disregarding this difference, my Solovay function is almost the same as the one given in [11] for both works, unlike [1] or [7] employ finite Veltman models rather than infinite Visser models. The ( part can be checked by a routine induction on ILM proofs, and we are going to ....

[Article contains additional citation context not shown here]

A.Berarducci, The interpretability logic of Peano Arithmetic. The Journal of Symbolic Logic 55 (1990), No 3, pp. 1059-1089.

....See [55] The second class is that of sequential, locally essentially reflexive theories containing I Sigma 1 . Examples are PA and ZF. Theories in this class satisfy are sound and complete for the logic ILM. This result was proved independently by Alessandro Berarducci and Volodya Shavrukov. See [5] and [39] Outside of these major classes we know very little. See section 9 and appendix B. 1.5 Philosophical interest The philosophical interest of Provability Logic is that it analyzes Godelian metamathematical reasoning in its bare essence. I think that this, all by itself, constitutes a ....

.... ( 2 ) M was known before to Lindstrom and to Svejdar (even if not in modal guise ) M characterizes IL frames with the following property: yS x zRu ) yRu. We call such frames ILM frames. De Jongh Veltman show that ILM is complete w.r.t. finite ILM models. See [12] or, alternatively, [5]. A simplified ILM frame is a simplified IL frame with the property that ySzRu ) yRu. In [53] it is shown that every ILM model bisimulates with a simplified ILM model. The proof is also given in the more accessible [5] Thus we have completeness w.r.t. simplified ILM models. However for ....

[Article contains additional citation context not shown here]

A. Berarducci. The interpretability logic of Peano arithmetic. The Journal of Symbolic Logic, 55:1059--1089, 1990.

....fi over T if T ff T fi. Interpretability logic is the branch of provability logic that studies interpretability. The subject was introduced by Visser [Vis90] who also showed two ACTs for the relation of interpretability over finitely axiomatized theories. In the same vein, Berarducci [Ber90] and Shavrukov [Sha88] independently showed two ACTs for the relation of interpretability over theories like PA and ZF. An overview of interpretability logic, including ample motivation for studying the subject, can be found in [Vis97] In the present paper, we obtain extensions of the ....

....2 s (ff) be a natural formalization of I Sigma s proves ff and let 3 s (ff) be an abbreviation of :2 s ( ff) The following characterization of interpretability over PA will be used several times. Lemma 3.2 (Orey H ajek) PA proves: 8ff; fi[ff fi 8s2(ff 3 s (fi) Proof. See page 1065 in [Ber90]. We also need the following reflection principle: Lemma 3.3 Fix OE(x) PA proves: 8x; s2(2 s (OE( x) OE( x) Proof. See page 1064 in [Ber90] Next we introduce the theory ACA 0 . This step is not strictly necessary for our present purposes, but working in ACA 0 instead of PA will make ....

[Article contains additional citation context not shown here]

A. Berarducci. The interpretability logic of Peano arithmetic. The Journal of Symbolic Logic, 55:1059--1089, 1990.

No context found.

A. Berarducci. The interpretability logic of Peano arithmetic. Journal of Symbolic Logic, 55:1059--1089, 1990.

No context found.

A. Berarducci, The Interpretability Logic of Peano Arithmetic, Journal of Symbolic Logic, 56, 1059-1089, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC