Basic Propositional Calculus II. Interpolation: II. Interpolation

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

Abstract

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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

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

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

Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Interpolation for extended modal languages.Balder ten Cate - 2005 - Journal of Symbolic Logic 70 (1):223-234.
On the Beth properties of some intuitionistic modal logics.C. Luppi - 2002 - Archive for Mathematical Logic 41 (5):443-454.
On the iterated ω‐rule.Grzegorz Michalski - 1992 - Mathematical Logic Quarterly 38 (1):203-208.
Finite cupping sets.Andrew Lewis - 2004 - Archive for Mathematical Logic 43 (7):845-858.

Analytics

Added to PP
2013-11-23

Downloads
56 (#415,874)

6 months
12 (#277,708)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references