✦ LIBER ✦

Undecidability of the homogeneous formulas of degree 3 of the predicate calculus

✍ Scribed by August Pieczkowski

Publisher: Springer Netherlands
Year: 1968
Tongue: English
Weight: 333 KB
Volume: 22
Category: Article
ISSN: 0039-3215
DOI: 10.1007/bf02125281

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Range and degree of realizability of for

Range and degree of realizability of formulas in the restricted predicate calculus

✍ Yu. V. Glebskii; D. I. Kogan; M. I. Liogon'kii; V. A. Talanov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 934 KB

On the Undecidability of Monadic Modal P

On the Undecidability of Monadic Modal Predicate Logic

✍ Akira Nakamura 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 1 views

The undecidability of the second order p

The undecidability of the second order predicate unification problem

✍ Gilles Amiot 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 397 KB

On the realizations of predicate formula

On the realizations of predicate formulas

✍ M. M. Kipnis 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 384 KB

Mechanical theorem proving in a certain

Mechanical theorem proving in a certain class of formulae of the predicate calculus

✍ Ewa Orłowska 📂 Article 📅 1969 🏛 Springer Netherlands 🌐 English ⚖ 453 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]).