Abstract
We will generalize the Second Incompleteness Theorem almost to the level of Robinson's System Q. We will prove there exists a Π1 sentence V, such that if α is any finite consistent extension of Q+V then α will be unable to prove its Semantic Tableaux consistency. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
APA
Willard, D. E. (2000). The Semantic Tableaux version of the Second Incompleteness Theorem extends almost to Robinson’s arithmetic Q. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1847 LNAI, pp. 415–430). https://doi.org/10.1007/10722086_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free