✦ LIBER ✦

A new decidable Horn fragment of predicate calculus

✍ Scribed by V. P. Orevkov

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 372 KB
Volume: 134
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-006-0117-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A Decidable Fragment of Recursive Arithm

A Decidable Fragment of Recursive Arithmetic

✍ R. L. Goodstein 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

On a decidable generalized quantifier lo

On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic

✍ Natasha Alechina 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 784 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]).

A Formalisation of the Propositional Cal

A Formalisation of the Propositional Calculus Corresponding to Wang's Calculus of Partial Predicates

✍ Alan Rose 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

A predicative and decidable characteriza

A predicative and decidable characterization of the polynomial classes of languages

✍ S. Caporaso; M. Zito; N. Galesi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Characterizations of PTIME, PSPACE, the polynomial hierarchy and its elements are given, which are decidable (membership can be decided by syntactic inspection to the constructions), predicative (according to points of view by Leivant and others), and are obtained by means of increasing restrictions