✦ LIBER ✦

Correctness of linear logic proof structures is -complete

✍ Scribed by Paulin Jacobé de Naurois; Virgile Mogbil

Book ID: 108281711
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 556 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.12.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof method of partial correctness and

Proof method of partial correctness and weak completeness for normal logic programs

✍ Gérard Ferrand; Pierre Deransart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 951 KB

Constant-only multiplicative linear logi

Constant-only multiplicative linear logic is NP-complete

✍ Patrick Lincoln; Timothy Winkler 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 959 KB

Completeness Proofs for Some Logics of P

Completeness Proofs for Some Logics of Programs

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

Condensed detachment is complete for rel

Condensed detachment is complete for relevance logic: A computer-aided proof

✍ Grigori Mints; Tanel Tammet 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 392 KB

A complete proof of correctness of the K

A complete proof of correctness of the Knuth-Bendix completion algorithm

✍ Gérard Huet 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 709 KB

Optimization complexity of linear logic

Optimization complexity of linear logic proof games

✍ Patrick D. Lincoln; John C. Mitchell; Andre Scedrov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A class of linear logic proof games is developed, each with a numeric score that depends on the number of preferred axioms used in a complete or partial proof tree. The complexity of these games is analyzed for the NP-complete multiplicative fragment (MLL) extended with additive constants and the PS