Basic Propositional Calculus II. Interpolation: II. Interpolation

Archive for Mathematical Logic 40 (5):349-364 (2001)
  Copy   BIBTEX


Let ℒ and ? be propositional languages over Basic Propositional Calculus, and ℳ = ℒ∩?. Weprove two different but interrelated interpolation theorems. First, suppose that Π is a sequent theory over ℒ, and Σ∪ {C⇒C′} is a set of sequents over ?, such that Π,Σ⊢C⇒C′. Then there is a sequent theory Φ over ℳ such that Π⊢Φ and Φ, Σ⊢C⇒C′. Second, let A be a formula over ℒ, and C 1, C 2 be formulas over ?, such that A∧C 1⊢C 2. Then there exists a formula B over ℳ such that A⊢B and B∧C 1⊢C 2



    Upload a copy of this work     Papers currently archived: 74,662

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

Basic Propositional Calculus I.Mohammad Ardeshir & Wim Ruitenburg - 1998 - Mathematical Logic Quarterly 44 (3):317-343.
A Cut-Free Gentzen Formulation of Basic Propositional Calculus.Kentaro Kikuchi & Katsumi Sasaki - 2003 - Journal of Logic, Language and Information 12 (2):213-225.
Sequent Calculi for Visser's Propositional Logics.Kentaro Kikuchi & Ryo Kashima - 2001 - Notre Dame Journal of Formal Logic 42 (1):1-22.
A New Modal Lindström Theorem.Johan van Benthem - 2007 - Logica Universalis 1 (1):125-138.
New Sequent Calculi for Visser's Formal Propositional Logic.Katsumasa Ishii - 2003 - Mathematical Logic Quarterly 49 (5):525.
Constructive Interpolation in Hybrid Logic.Patrick Blackburn & Maarten Marx - 2003 - Journal of Symbolic Logic 68 (2):463-480.
Coinductive Formulas and a Many-Sorted Interpolation Theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
Interpolation and Preservation In.Holger Sturm - 1998 - Notre Dame Journal of Formal Logic 39 (2):190-211.


Added to PP

29 (#399,980)

6 months
1 (#419,921)

Historical graph of downloads
How can I increase my downloads?