Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426879 | Information and Computation | 2009 | 16 Pages |
Abstract
In 1981, Paris and Wilkie indicated it was an open question whether IΣ0 would satisfy the Second Incompleteness Theorem for Herbrand deduction. We will show that some specially formulated axiomizations for IΣ0 can evade the Herbrandized version of the Second Incompleteness Theorem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics