✦ LIBER ✦

Glivenko Type Theorems for Intuitionistic Modal Logics

✍ Scribed by Guram Bezhanishvili

Book ID: 110292236
Publisher: Springer Netherlands
Year: 2001
Tongue: English
Weight: 310 KB
Volume: 67
Category: Article
ISSN: 0039-3215
DOI: 10.1023/a:1010577628486

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A strong completeness theorem in intuiti

A strong completeness theorem in intuitionistic quantified modal logic

✍ Hengshan Gao 📂 Article 📅 2000 🏛 SP Science China Press 🌐 English ⚖ 556 KB

Systems of Transfinite Type Theory Based

Systems of Transfinite Type Theory Based on Intuitionistic and Modal Logics

✍ Kenneth A. Bowen 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 953 KB

I n an earlier paper [2], using ZERMELO-FRAENXEL set theory (ZF) as metalanguage, for each ordinal 6 2 1, I introduced a system TTo of transfinite type theory formulated in GENTZEN'S sequentzen style [3]. The notion of sequent and the rules of inference were straightforward generalizations of those

Cut-Free Tableau Calculi for some Intuit

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics

✍ Mauro Ferrari 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 405 KB

Interpolation theorems for intuitionisti

Interpolation theorems for intuitionistic predicate logic

✍ G. Mints 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Craig interpolation theorem (which holds for intuitionistic logic) implies that the derivability of X; X ⇒ Y implies existence of an interpolant I in the common language of X and X ⇒ Y such that both X ⇒ I and I; X ⇒ Y are derivable. For classical logic this extends to X; X ⇒ Y; Y , but for intuitio

A general method for proving decidabilit

A general method for proving decidability of intuitionistic modal logics

✍ Natasha Alechina; Dmitry Shkatov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We generalise the result of [H. Ganzinger, C. Meyer, M. Veanes, The two-variable guarded fragment with transitive relations, in: Proc. 14th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999, pp. 24-34] on decidability of the two variable monadic guarded fragment of first

Cut-elimination Theorems for Some Infini

Cut-elimination Theorems for Some Infinitary Modal Logics

✍ Yoshihito Tanaka 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB

In this article, a cut-free system TLMω 1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames. The system TLMω 1 is a kind of Gentzen style sequent calculus, but a sequent of TLMω 1 is defined as a finite tree of sequents in a standar