✦ LIBER ✦

Decidability of a portion of the predicate calculus

✍ Scribed by Saharon Shelah

Book ID: 112885021
Publisher: The Hebrew University Magnes Press
Year: 1977
Tongue: English
Weight: 515 KB
Volume: 28
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02759780

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new decidable Horn fragment of predica

A new decidable Horn fragment of predicate calculus

✍ V. P. Orevkov 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 372 KB

Restriction of term complexity in deriva

Restriction of term complexity in derivations and decidable fragments of predicate calculus

✍ N. K. Zamov 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 468 KB

Decidability of Some Intuitionistic Pred

Decidability of Some Intuitionistic Predicate Theories

✍ Dov M. Gabbay 📂 Article 📅 1972 🏛 Association for Symbolic Logic 🌐 English ⚖ 453 KB

Decidability of mean value calculus

✍ Xiaoshan Li 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 514 KB

Axiomatization of the Infinite-Valued Pr

Axiomatization of the Infinite-Valued Predicate Calculus

✍ Louise Schmir Hay 📂 Article 📅 1963 🏛 Association for Symbolic Logic 🌐 English ⚖ 908 KB

Structural completeness of the first-ord

Structural completeness of the first-order predicate calculus

✍ W. A. Pogorzelski; T. Prucnal 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

1. The problem of structural conipleteness of a logical system is formulated as the qiicstion about derivability in this system of all permissible and structural rules (cf. [lo]).