✦ LIBER ✦

Satisfiability problems for propositional calculi

✍ Scribed by Harry R. Lewis

Publisher: Springer
Year: 1979
Tongue: English
Weight: 612 KB
Volume: 13
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01744287

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The problem of reconstructability of pro

The problem of reconstructability of propositional calculi

✍ Marek Tokarz; Ryszard Wójcicki 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 423 KB

Algorithms for testing the satisfiabilit

Algorithms for testing the satisfiability of propositional formulae

✍ Giorgio Gallo; Giampaolo Urbani 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 590 KB

Algorithms for finding matrix models of

Algorithms for finding matrix models of propositional calculi

✍ Paul Pritchard 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 643 KB

Some self-dual primitive functions for P

Some self-dual primitive functions for Propositional Calculi

✍ Alan Rose 📂 Article 📅 1953 🏛 Springer 🌐 English ⚖ 274 KB

Sequent calculi for propositional star-f

Sequent calculi for propositional star-free likelihood logic

✍ R. Alonderis 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 131 KB

New sequent calculi for Visser's Formal

New sequent calculi for Visser's Formal Propositional Logic

✍ Katsumasa Ishii 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Two cut‐free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic (FPL) are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei‐Ardeshir's calculi for