✦ LIBER ✦

A uniform semantic proof for cut-elimination and completeness of various first and higher order logics

✍ Scribed by Mitsuhiro Okada

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 201 KB
Volume: 281
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00024-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Phase semantic cut-elimination and norma

Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic

✍ Mitsuhiro Okada 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 698 KB

Phase Semantics for Higher Order Complet

Phase Semantics for Higher Order Completeness, Cut-Elimination and Normalization Proofs (Extended Abstract)

✍ Mitsuhiro Okada 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 35 KB

Simple proof of the completeness theorem

Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic

✍ Karim Nour; Christophe Raffalli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

We present a simpler way than usual to deduce the completeness theorem for the second-order classical logic from the ÿrst-order one. We also extend our method to the case of second-order intuitionistic logic.