✦ LIBER ✦

Light logics and optimal reduction: Completeness and complexity

✍ Scribed by Patrick Baillot; Paolo Coppola; Ugo Dal Lago

Book ID: 113641933
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 899 KB
Volume: 209
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2010.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On static logics, dynamic logics, and co

On static logics, dynamic logics, and complexity classes

✍ D. Harel; D. Peleg 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 793 KB

Combinations and completeness transfer f

Combinations and completeness transfer for quantified modal logics

✍ Schurz, G. 📂 Article 📅 2010 🏛 Oxford University Press 🌐 English ⚖ 236 KB

Completeness in sums of Boolean algebras

Completeness in sums of Boolean algebras and logics

✍ Vladimír Janiš; Zdenka Riečanová 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 347 KB

Completeness and cut-elimination theorem

Completeness and cut-elimination theorems for trilattice logics

✍ Norihiro Kamide; Heinrich Wansing 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The completeness of monotonic modal logi

The completeness of monotonic modal logics

✍ Brian F. Chellas; Audrey McKinney 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB

The purpose of this paper is to point out an error in KRISTER SEGERBERG'S proof of the completeness of the modal logic R, and to provide a correct proof.2) The correct proofbased on a notion and a strategy suggested by SEOERBERO'S techniquesintroduces a general approach for obtaining completeness th

Quantum logics and completeness criteria

Quantum logics and completeness criteria of inner product spaces

✍ Anatolij Dvurečenskij 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 433 KB