Are there parts of our arithmetical competence that no sound formal system can duplicate?
Bhupinder Singh Anand
Abstract
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.
Create a lesson
Related papers
Even and Odd Integer Values of the Secondary Zeta Function
Artur Kawalec
Generalized Pellet's theorem for analytic matrix-valued functions
Hiromochi Itoh, Kei Matsushima, Takayuki Yamada
Certifying non-existence of integer points on curves
Bogdan Grechuk, Eugene Go
A finite coefficient theory for shape identification in tilted generalized gamma families
Ran Huang
There are only finitely many irregular Diophantine quadruples
Bo He, Alain Togbe
A Multipatch Model for Evaluating Interdivisional Connectivity and Vaccination Dynamics in the 2026 Bangladesh Measles Outbreak
Faizunnesa Khondaker, Md. Kamrujjaman