Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem
| dc.creator | Anand, Bhupinder Singh | |
| dc.date | 2002-06-28 | |
| dc.date | 2003-05-11 | |
| dc.date.accessioned | 2026-07-07T04:49:26Z | |
| dc.date.available | 2026-07-07T04:49:26Z | |
| dc.description | If we apply an extension of the Deduction meta-Theorem to Goedel's meta-reasoning of "undecidability", we can conclude that Goedel's formal system of Arithmetic is not omega-consistent. If we then take the standard interpretation "(Ax)(F(x)" of the PA-formula [(Ax)F(x)] to mean "There is a general, x-independent, routine to establish that F(x) holds for all x", instead of "F(x) holds for all x", it follows that a constructively interpreted omega-inconsistent system proves Hilbert's Entscheidungsproblem negatively. | |
| dc.description | v3. Introduced ACI compliant notation for citations. 10 pages. An HTML version is available at http://alixcomsi.com/index01.htm | |
| dc.identifier | https://arxiv.org/abs/math/0206302 | |
| dc.identifier | http://arxiv.org/abs/math/0206302 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64422 | |
| dc.subject | General Mathematics | |
| dc.subject | 03B10 | |
| dc.title | Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem | |
| dc.type | text |