✦ LIBER ✦

A Proof System for Classical Logic

✍ Scribed by Witold A. Pogorzelski; Piotr Wojtylak

Publisher: Springer Netherlands
Year: 2005
Tongue: English
Weight: 145 KB
Volume: 80
Category: Article
ISSN: 0039-3215
DOI: 10.1007/s11225-005-6778-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A proof–theoretic study of the correspon

A proof–theoretic study of the correspondence of hybrid logic and classical logic

✍ H. Kushida; M. Okada 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 324 KB

On lengths of proofs in non-classical lo

On lengths of proofs in non-classical logics

✍ Pavel Hrubeš 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Cut Elimination inside a Deep Inference

Cut Elimination inside a Deep Inference System for Classical Predicate Logic

✍ Kai Brünnler 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 308 KB

A completeness proof for adapted probabi

A completeness proof for adapted probability logic

✍ H.Jerome Keisler 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 578 KB

A proof rule for restoring logic circuit

A proof rule for restoring logic circuits

✍ J.A. Bergstra; J.W. Klop 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 843 KB

An axiomatic semantics is given for restoring logic circuits, both statically and dynamically. As an example the Muller C-element is discussed in detail. It is shown that a consistent circuit reacts in an unambiguous way on new inputs.

A Classic Proof of a Recurrence for a Ve

A Classic Proof of a Recurrence for a Very Classical Sequence

✍ Dominique Foata; Doron Zeilberger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 254 KB

has recently narrated the fascinating story of how the classical Schro der [Sch1870] numbers s(n) are even more classical than was previously believed. They (at least s(10)=103049) were known to Hipparchus (190 127 b.c.). Stanley recalled the three-term linear recurrence p. 57]) and stated that ``