Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
The Tangibility Reflection Principle for Self-Verifying Axiom Systems
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
On the partial respects in which a real valued arithmetic system can verify its tableaux consistency
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic's 驴1 theorems. We will develop some new types of exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.