𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the automatizability of resolution and related propositional proof systems

✍ Scribed by Albert Atserias; Marı́a Luisa Bonet

Book ID
113641496
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
251 KB
Volume
189
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the correspondence between arithmetic
On the correspondence between arithmetic theories and propositional proof systems – a survey
✍ Olaf Beyersdorff 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

## Abstract The purpose of this paper is to survey the correspondence between bounded arithmetic and propositional proof systems. In addition, it also contains some new results which have appeared as an extended abstract in the proceedings of the conference TAMC 2008 [11]. Bounded arithmetic is cl

On Formally Undecidable Propositions of
On Formally Undecidable Propositions of Principia Mathematica and Related Systems
✍ Kurt Gödel 📂 Library 📅 1992 🏛 Dover Publications 🌐 English ⚖ 657 KB

First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. It is thus uncertain that the basic axioms of arithmetic will not give rise to contradictions. Introduct