David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 99 (1-3):249-267 (2011)
In a previous paper [ 21 ] all extensions of Johansson’s minimal logic J with the weak interpolation property WIP were described. It was proved that WIP is decidable over J. It turned out that the weak interpolation problem in extensions of J is reducible to the same problem over a logic Gl, which arises from J by adding tertium non datur. In this paper we consider extensions of the logic Gl. We prove that only finitely many logics over Gl have the Craig interpolation property CIP, the restricted interpolation property IPR or the projective Beth property PBP. The full list of Gl-logics with the mentioned properties is found, and their description is given. We note that IPR and PBP are equivalent over Gl. It is proved that CIP, IPR and PBP are decidable over the logic Gl
|Keywords||Minimal logic interpolation definability amalgamation|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
William Craig (1957). Three Uses of the Herbrand-Gentzen Theorem in Relating Model Theory and Proof Theory. Journal of Symbolic Logic 22 (3):269-285.
Larisa Maksimova (2000). Intuitionistic Logic and Implicit Definability. Annals of Pure and Applied Logic 105 (1-3):83-102.
J. C. C. McKinsey & Alfred Tarski (1948). Some Theorems About the Sentential Calculi of Lewis and Heyting. Journal of Symbolic Logic 13 (1):1-15.
Sergei P. Odintsov (2004). Logic of Classical Refutability and Class of Extensions of Minimal Logic. Logic and Logical Philosophy 9:91.
Helena Rasiowa (1963). The Mathematics of Metamathematics. Warszawa, Państwowe Wydawn. Naukowe.
Citations of this work BETA
No citations found.
Similar books and articles
Larisa L. Maksimova (1979). Interpolation Properties of Superintuitionistic Logics. Studia Logica 38 (4):419 - 428.
Eva Hoogland & Maarten Marx (2002). Interpolation and Definability in Guarded Fragments. Studia Logica 70 (3):373 - 409.
Finn V. Jensen (1974). Interpolation and Definability in Abstract Logics. Synthese 27 (1-2):251 - 257.
Larisa Maksimova (2002). Complexity of Interpolation and Related Problems in Positive Calculi. Journal of Symbolic Logic 67 (1):397-408.
Frank Wolter (1997). A Note on the Interpolation Property in Tense Logic. Journal of Philosophical Logic 26 (5):545-551.
Larisa Maksimova (2006). Definability and Interpolation in Non-Classical Logics. Studia Logica 82 (2):271 - 291.
Jouko Väänänen (2008). The Craig Interpolation Theorem in Abstract Model Theory. Synthese 164 (3):401 - 420.
Hiroakira Ono (1986). Craig's Interpolation Theorem for the Intuitionistic Logic and its Extensions—a Semantical Approach. Studia Logica 45 (1):19 - 33.
Małgorzata Porębska (1986). Interpolation and Amalgamation Properties in Varieties of Equivalential Algebras. Studia Logica 45 (1):35 - 38.
Giovanna D’Agostino (2008). Interpolation in Non-Classical Logics. Synthese 164 (3):421 - 435.
Giovanna D'Agostino (2008). Interpolation in Non-Classical Logics. Synthese 164 (3):421 - 435.
Gábor Sági & Saharon Shelah (2006). On Weak and Strong Interpolation in Algebraic Logics. Journal of Symbolic Logic 71 (1):104 - 118.
Judit X. Madarász (1998). Interpolation and Amalgamation; Pushing the Limits. Part I. Studia Logica 61 (3):311-345.
Solomon Feferman (2008). Harmonious Logic: Craig's Interpolation Theorem and Its Descendants. Synthese 164 (3):341 - 357.
Melvin Fitting (2002). Interpolation for First Order S5. Journal of Symbolic Logic 67 (2):621-634.
Sorry, there are not enough data points to plot this chart.
Added to index2011-09-22
Total downloads1 ( #505,694 of 1,679,362 )
Recent downloads (6 months)1 ( #182,933 of 1,679,362 )
How can I increase my downloads?