Are there parts of our arithmetical competence that no sound formal system can duplicate?
| dc.creator | Anand, Bhupinder Singh | |
| dc.date | 2002-10-30 | |
| dc.date | 2003-05-19 | |
| dc.date.accessioned | 2026-07-07T04:52:28Z | |
| dc.date.available | 2026-07-07T04:52:28Z | |
| dc.description | In 1995, David Chalmers opined as implausible that there may be parts of our arithmetical competence that no sound formal system could ever duplicate. We prove that the recursive number-theoretic relation x=Sb(y 19|Z(y)) - which is algorithmically verifiable since Goedel's recursive function Sb(y 19|Z(y)) is Turing-computable - cannot be "duplicated" in any consistent formal system of Arithmetic. | |
| dc.description | v2; introduced standardised ACI compliant notation for citations; 9 pages; this paper reproduces Meta-theorem 1 and related Meta-lemmas from my earlier paper http://arXiv.org/abs/math.GM/0210078 ; an HTML version is available at http://alixcomsi.com/index01.htm | |
| dc.identifier | https://arxiv.org/abs/math/0210456 | |
| dc.identifier | http://arxiv.org/abs/math/0210456 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65475 | |
| dc.subject | General Mathematics | |
| dc.subject | 03B10 | |
| dc.title | Are there parts of our arithmetical competence that no sound formal system can duplicate? | |
| dc.type | text |