Proof-theoretic modal PA-Completeness III: The syntactic proof

Studia Logica 63 (3):301-310 (1999)
This paper is the final part of the syntactic demonstration of the Arithmetical Completeness of the modal system G; in the preceding parts [9] and [10] the tools for the proof were defined, in particular the notion of syntactic countermodel. Our strategy is: PA-completeness of G as a search for interpretations which force the distance between G and a GL-LIN-theorem to zero. If the GL-LIN-theorem S is not a G-theorem, we construct a formula H expressing the non G-provability of S, so that ⊢GL-LIN ∼ H and so that a canonical proof T of ∼ H in GL-LIN is a syntactic countermodel for S with respect to G, which has the height θ(T) equal to the distance d(S, G) of S from G. Then we define the interpretation ξ of S which represents the proof-tree T in PA. By induction on θ(T), we prove that ⊢PA Sξ and d(S, G) > 0 imply the inconsistency of PA.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005262101188
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,777
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Paraconsistent Informational Logic.Paola Forcheri & Paolo Gentilini - 2005 - Journal of Applied Logic 3 (1):97-118.

Add more citations

Similar books and articles
Modal Completeness of ILW.Dick De Jongh & Frank Veltman - 1999 - In Jelle Gerbrandy, Maarten Marx, Maarten de Rijke & Yde Venema (eds.), Essays Dedicated to Johan van Benthem on the Occasion of His 50th Birthday. Amsterdam University Press.
Russell's Completeness Proof.Peter Milne - 2008 - History and Philosophy of Logic 29 (1):31-62.
Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2008 - Journal of Logic, Language and Information 17 (1):291-292.

Monthly downloads

Added to index


Total downloads

14 ( #336,728 of 2,177,930 )

Recent downloads (6 months)

1 ( #317,203 of 2,177,930 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums