Interpolation and Definability over the Logic Gl

Studia Logica 99 (1-3):249-267 (2011)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2011-09-22

Downloads
26 (#521,908)

6 months
1 (#1,028,709)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

The mathematics of metamathematics.Helena Rasiowa - 1963 - Warszawa,: Państwowe Wydawn. Naukowe. Edited by Roman Sikorski.
Theory of Logical Calculi: Basic Theory of Consequence Operations.Ryszard Wójcicki - 1988 - Dordrecht, Boston and London: Kluwer Academic Publishers.
Constructive Negations and Paraconsistency.Sergei Odintsov - 2008 - Dordrecht, Netherland: Springer.
Semantical Investigations in Heyting's Intuitionistic Logic.Dov M. Gabbay - 1986 - Journal of Symbolic Logic 51 (3):824-824.

View all 18 references / Add more references