✦ LIBER ✦

Number of prelocally table superintuitionistic propositional logics

✍ Scribed by S. I. Mardaev

Publisher: Springer US
Year: 1984
Tongue: English
Weight: 746 KB
Volume: 23
Category: Article
ISSN: 0002-5232
DOI: 10.1007/bf01979699

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Separability of normalizable superintuit

Separability of normalizable superintuitionistic propositional logics

✍ V. I. Khomich 📂 Article 📅 1998 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 654 KB

The effect of bounding the number of pri

The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

✍ Joseph Y. Halpern 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 910 KB

A well-known result of Ladner says that the satisfiability problem for K45, KD45, and S5 is NP-complete. This result implicitly assumes that there are infinitely many primitive propositions in the language; it is easy to see that the satisfiability problem for these logics becomes linear time if the