C. Smory nski, Self-reference and modal logic, Springer-Verlag, Berlin, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....separable. Note that for any inseparable pair hX; Y i, the sets X and Y are each consistent. Definition 2.9 (Complete Pair) Let hX; Y i be an inseparable pair. We say that hX; Y i is complete if 1. For each A 2 AX , either A 2 X or A 2 X . 2. For each A 2 A Y , either A 2 Y or A 2 Y . In e.g. Smory nski 1985 the following analogue of Lindenbaum s Lemma can be found. Proposition 2.10 Let hX; Y i be an inseparable pair. Then there exist sets X 0 , Y 0 such that X X 0 AX , Y Y 0 A Y and hX 0 ; Y 0 i is a complete pair. The preparations up to now suffice to define the worlds of the ....

Smory'nski, C. 1985. Self-reference and modal logic. Springer-Verlag.

....and thus GL is exactly the modal counterpart of PA provability. Solovay s proof is much too complex to be even sketched here. Su#ce it to say that it involves a di#cult fixpoint construction, using either the second recursion theorem of recursion theory, or Godel s fixedpoint result for PA. Any of [1, 2, 9] provide thorough treatments of GL. 3 The Fixed Point Theorem Godel s proof of his incompleteness theorems depended on finding a sentence of arithmetic that expressed its own unprovability. More generally, he developed a technique for constructing fixpoint sentences that express facts about ....

Smory nski, C. Self-reference and Modal Logic. Universitext, Springer-Verlag, 1985.

.... hdifirst hdilast 10. start first last . 4. Proving completeness In this section we prove the completeness of LOFT. Proving that LOFT is sound with respect to finite trees is straightforward, though readers new to modal logic may find it helpful to refer to Goldblatt [12] or Smory nski [16] for further discussion of the Segerberg and Lob schemas. Our proof uses ideas from provability logic and dynamic logic, and extends techniques used by Van Benthem and Meyer Viol [2] and Blackburn and Meyer Viol [5] The work falls into three phases. First, we show that LOFT is complete with ....

C. Smory'nski. Self Reference and Modal Logic. Springer Verlag, 1985.

....be the valuation in G such that U(p) V(p) for every variable p, and N = hG; Ui. Clearly, N; y) 6j= On the other hand, we have (N; y) j= and so (N; x) 6j= contrary to 2 V. 2 2 Visser gave this name to the logic in view of that K4 is sometimes called the basic modal logic (cf. [24]) 6 Note that only the axiom (p (q r) p q) p r) in the standard axiomatization of Int, say in [8] does not belong to V. Semantically the consequence relation Int in intuitionistic logic can be defined as Gamma Int iff 8M8x ( M; x) j= Gamma ) M;x) j= where M ....

C. Smory'nski. Self-reference and Modal Logic. Springer Verlag, Heidelberg & New York, 1985.

.... Gamma then it is both an (I M , critical and an (I P , critical successor of Gamma. Proposition 3.2 Let Gamma be a maximal ilm=p consistent set such that 3C 2 Gamma. Then there is a maximal ilm=p consistent successor Delta of Gamma with C, C 2 Delta. Proof. Well known (or cf. [4]) QED. Proposition 3.3 Let K 2 f M , P g, and let Gamma be a maximal ilm=p consistent set such that :IK C 2 Gamma. The there exists a maximal ilm=p consistent (I K , C) critical successor Delta of Gamma with 2 Delta. Proof. cf. 3, Proposition 2.4] QED. Proposition 3.4 Let K 2 f M , ....

Craig Smory'nski. Self-Reference and Modal Logic. Springer-Verlag, New York, 1985.

....J Note that for any inseparable pair hX; Y i, the sets X and Y are each consistent. Definition 2.9 (Complete Pair) Let hX; Y i be an inseparable pair. We say that hX; Y i is complete if 1. For each A 2 AX , either A 2 X or A 2 X. 2. For each A 2 A Y , either A 2 Y or A 2 Y . J In e.g. [14] the following analogue of Lindenbaum s Lemma can be found. Proposition 2.10 Let hX; Y i be an inseparable pair. Then there exist sets X 0 , Y 0 such that X X 0 AX , Y Y 0 A Y and hX 0 ; Y 0 i is a complete pair. The preparations up to now suffice to define the worlds of ....

C. Smory'nski. Self-reference and modal logic. Springer-Verlag, 1985.

....If OE n m (k) j OE n m (l) then n m (k) n m (l) Proof. Obvious, as Th n m (k) Th n m (l) a Chapter 5 Exactly provable L formulas 5. 1 Introduction In this chapter we will study the exactly provable formulas in fragments of provability logic L (GL in [Boolos 93] PRL in [Smory nski 85] According to Solovay s theorem [Solovay 76] on provability interpretations the theorems of the provability logic L are precisely those modal formulas that are provable in PA under arbitrary arithmetical interpretations (interpreting 2 as the formalized provability predicate in PA) The logic L ....

....A 1 ; Delta Delta Delta ;A n such that an L formula is an Delta consequence of T iff is a theorem of PA in the arithmetical interpretation in which the atomic formula p i is 100 Chapter 5. Exactly provable L formulas interpreted as A i (see e.g. Solovay 76] Boolos 93] or [Smory nski 85] Written out: T axiomatizes an arithmetically interpreted theory: f j T Delta g = f j PA (A 1 ; Delta Delta Delta ; A n )g: The faithfully interpretable propositional theories T in L n (i.e. L restricted to the language of p 1 ; Delta Delta Delta ; p n ) are according ....

[Article contains additional citation context not shown here]

C. Smory'nski, Self-Reference and Modal Logic, Universitext, Springer-Verlag, 1985.

....theory T with classical logic are, trivially, precisely the classical tautologies. The question becomes much more interesting if we consider classical theories and predicate logical schemes (see [44] or if we enrich the propositional language with a modal predicate for provability (see [1] or [28]) If we consider constructive theories, already the purely propositional case has some interest. If a theory is purely constructive , one would surely expect the valid propositional schemes to be precisely the theorems of intuitionistic propositional logic IPC. This turns out to be often the ....

C. Smory'nski. Self-Reference and Modal Logic. Universitext. Springer, New York, 1985.

....such theories under which the 8 maximal ones of particular interest. 1 Introduction This paper discusses Magari algebras (often called diagonalizable algebras) over a finite number of generators. Magari algebras are the algebras corresponding to the provability logic L (GL in [2] PRL in [11]) According to Solovay s theorem [12] on provability interpretations the theorems of the provability logic L are precisely those modal formulas that are provable in PA under arbitrary arithmetical interpretations (interpreting 2 as the formalized provability predicate in PA) Here, we are ....

.... Delta ; p n for which there is a sequence of arithmetical sentences A 1 ; Delta Delta Delta ;A n such that an L formula is an L consequence of T iff is a theorem of PA in the arithmetical interpretation in which the atomic formula p i is interpreted as A i (see e.g. 12] 2] or [11]) Written out: T axiomatizes an arithmetically interpreted theory: f j T L g = f j PA (A 1 ; Delta Delta Delta ; A n )g: The faithfully interpretable propositional theories T in L n (i.e. L restricted to the language of p 1 ; Delta Delta Delta ; p n ) are according to ....

[Article contains additional citation context not shown here]

C. Smory'nski, Self-Reference and Modal Logic, Universitext SpringerVerlag, 1985.

....[35] 37] 38] The method was adapted by Nelson to build stronger and stronger theories in his predicativist programme. See [34] 1 For the case of provability logic the programme of using the language to represent nontrivial reasoning was strongly advocated by Craig Smoryn nski. See his book [42]. The expertise developed in proving arithmetical completeness theorems for Interpretability Logic was used with good result by Shavrukov in the study of the combined logic for provability and a Feferman predicate. See [40] Dick de Jongh and Duccio Pianigiani, in their[11] used the work of ....

C. Smory'nski. Self-reference and modal logic. Springer-Verlag, 1985.

....sets of modal formulas are realizable in the sense that there is a realization mapping all the formulas of the set on true (provable) arithmetical sentences. So far, only a few scattered results seem to exist in this field of (infinitary) provability logic. Among those are the uniform ACTs (see [Smo85]) and some theorems of Shavrukov on Magari algebras [Sha93] This author s Ph. D. thesis [Str96] was also devoted to the subject. A survey of provability logic can be found in [JdJ98] Interpretability logic As a preliminary, let us start by outlining the definition of interpretability. Roughly, ....

....and some simple combinatorial considerations. In view of Lemma 3.1(iii) we make the following definition: ffl When G is finite, we say that the model k witnesses that G 6 A if k is a ( V G :A) reflexive model forcing V G :A. Arithmetical preliminaries ffl We use the dot notation of [Smo85]. Thus, if OE(x) is a formula with one free variable x, then OE( x) is a term with one free variable x. ffl The theory I Sigma s is PA with induction restricted to Sigma s formulas. ffl Let 2 s (ff) be a natural formalization of I Sigma s proves ff and let 3 s (ff) be an abbreviation of :2 s ....

C. Smory'nski. Self-Reference and Modal Logic. Universitext. Springer, New York, 1985.

No context found.

C. Smory nski, Self-reference and modal logic, Springer-Verlag, Berlin, 1985.

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