Doing logic by computer: interpolation in fragments of intuitionistic propositional logic

Annals of Pure and Applied Logic 104 (1-3):97-112 (2000)
  Copy   BIBTEX

Abstract

In this paper we study the interpolation property in fragments of intuitionistic and propositional logic, using both proof theoretic and semantic techniques. We will also sketch some computational methods, based on the semantical techniques introduced, to obtain counterexamples in fragment where interpolation does not hold

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

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

Through your library

Similar books and articles

Interpolation in fragments of classical linear logic.Dirk Roorda - 1994 - Journal of Symbolic Logic 59 (2):419-444.
Interpolation theorems for intuitionistic predicate logic.G. Mints - 2001 - Annals of Pure and Applied Logic 113 (1-3):225-242.
On lengths of proofs in non-classical logics.Pavel Hrubeš - 2009 - Annals of Pure and Applied Logic 157 (2-3):194-205.
Remarks on uniform interpolation property.Majid Alizadeh - 2024 - Logic Journal of the IGPL 32 (5):810-814.
Hypersequent calculi for intuitionistic logic with classical atoms.Hidenori Kurokawa - 2010 - Annals of Pure and Applied Logic 161 (3):427-446.

Analytics

Added to PP
2014-01-16

Downloads
29 (#812,446)

6 months
7 (#469,699)

Historical graph of downloads
How can I increase my downloads?