Proof-theoretic modal PA-Completeness II: The syntactic countermodel
Studia Logica 63 (2):245-268 (1999)
| Abstract | This paper is the second part of the syntactic demonstration of the Arithmetical Completeness of the modal system G, the first part of which is presented in [9]. Given a sequent S so that ⊢GL-LIN S, ⊬G S, and given its characteristic formula H = char(S), which expresses the non G-provability of S, we construct a canonical proof-tree T of ~ H in GL-LIN, the height of which is the distance d(S, G) of S from G. T is the syntactic countermodel of S with respect to Gand is a tool of general interest in Provability Logic, that allows some classification in the set of the arithmetical interpretations. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesMichal Grabowski (1988). Arithmetical Completeness Versus Relative Completeness. Studia Logica 47 (3):213 - 220.
Dick H. J. Jongh & Franco Montagna (1987). Generic Generalized Rosser Fixed Points. Studia Logica 46 (2):193 - 203.
Sara Negri (2005). Proof Analysis in Modal Logic. Journal of Philosophical Logic 34 (5-6):507 - 544.
Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge (2008). Strong Completeness and Limited Canonicity for PDL. Journal of Logic, Language and Information 17 (1).
Sergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
H. Kushida & M. Okada (2003). A Proof-Theoretic Study of the Correspondence of Classical Logic and Modal Logic. Journal of Symbolic Logic 68 (4):1403-1414.
Paolo Gentilini (1993). Syntactical Results on the Arithmetical Completeness of Modal Logic. Studia Logica 52 (4):549 - 564.
Paolo Gentilini (1999). Proof-Theoretic Modal Pa-Completeness I: A System-Sequent Metric. Studia Logica 63 (1):27-48.
Paolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Studia Logica 63 (3):301-310.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,556 of 548,984 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
