✦ LIBER ✦

The Epsilon Calculus and Herbrand Complexity

✍ Scribed by Georg Moser; Richard Zach

Publisher: Springer Netherlands
Year: 2006
Tongue: English
Weight: 321 KB
Volume: 82
Category: Article
ISSN: 0039-3215
DOI: 10.1007/s11225-006-6610-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of tensor calculus

✍ Carsten Damm; Markus Holzer; Pierre McKenzie 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 359 KB

Complexity of subclasses of the intuitio

Complexity of subclasses of the intuitionistic propositional calculus

✍ G. Mints 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 341 KB

On the Complexity of Nonassociative Lamb

On the Complexity of Nonassociative Lambek Calculus with Unit

✍ Maria Bulińska 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 200 KB

Herbrand strategies and the “greater ded

Herbrand strategies and the “greater deducibility” relation

✍ S. Yu. Maslov; S. A. Norgela 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 630 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

On the relationship between CWA, minimal

On the relationship between CWA, minimal model, and minimal herbrand model semantics

✍ Michael Gelfond; Halina Przymusinska; Teodor Przymusinski 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

The purpose of ithis article is to compare three types of nonmonotonic semantics: (a) proof-theoretic semantics based on the closed world assumption, (b) model-theoretic semantics based on the notion of a minimal model, and (c) model-theoretic semantics based on the notion of a minimal Herbrand mode