Finitarily consistent mechanist reasoning and non-finitarily consistent human reasoning: Mutually inconsistent yet complementary!
We now consider the following (tentatively expressed) conclusions suggested by our previous post, which we shall aim to investigate from various perspectives in these pages.
The Birmingham paper suggests that we may need to distinguish much more sharply than we do at present between:
Mathematical structures that are built upon only finitary reasoning, and
Mathematical structures that admit non-finitary reasoning.
For instance the Birmingham paper provides:
An example of a mathematical structure based on finitary reasoning, namely the finitarily sound algorithmic interpretation of the first order Peano Arithmetic PA.
An example of a mathematical structure based on non-finitary reasoning, namely the non-finitarily sound standard interpretation of the first order Peano Arithmetic PA.
The Birmingham paper suggests that the roots of the distinction between these two structures lies in the fact that:
Finitary reasoning does not assume that Aristotle’s particularisation is always true over infinite domains.
Non-finitary reasoning assumes that Aristotle’s particularisation is always true over infinite domains.
Consistency of Arithmetic
In the Birmingham paper we also show that:
Finitary reasoning proves that PA is consistent finitarily (as demanded by the second of Hilbert’s celebrated twenty three problems).
Non-finitary reasoning proves that PA is consistent non-finitarily (a consequence of Gentzen’s non-finitary proof of consistency for PA).
FOL is consistent; FOL+AP is -consistent
This suggests that:
Finitary reasoning as formalised in first order logic (FOL) is consistent.
Non-finitary reasoning as formalised in Hilbert’s -calculus (FOL+AP) is -consistent.
Since the Birmingham paper shows that Aristotle’s particularisation holds over the structure of the natural numbers if, and only if, PA is -consistent, it suggests that:
Finitary reasoning does not admit that PA can be -consistent (see Corollary 4 of this post).
Non-finitary reasoning admits that PA can be -consistent.
Since proofs of arithmetical undecidability implicitly assume Aristotle’s particularisation, this further suggests that:
Finitary reasoning does not admit undecidable arithmetical propositions (see Corollary 3 of this post).
Non-finitary reasoning admits undecidable arithmetical propositions.
A significant consequence is that:
Finitary reasoning does not admit an axiom of infinity.
Non-finitary reasoning admits an axiom of infinity.
Non-standard models of PA
A further consequence of this is that:
Finitary reasoning does not admit non-standard models of PA.
Non-finitary reasoning too does not admit non-standard models of PA.
Algorithmically computable truth and algorithmically verifiable truth
The Birmingham paper also suggests that:
The truths of finitary reasoning are algorithmically computable.
The truths of non-finitary reasoning are algorithmically verifiable, but not necessarily algorithmically computable.
Categoricity and incompleteness of Arithmetic
Finitary reasoning proves that PA is categorical with respect to algorithmically computable truth.
Non-finitary reasoning proves that PA is incomplete with respect to algorithmically verifiable truth (a consequence of Gödel’s proof of of the undecidability of some arithmetical propositions in any -consistent system of arithmetic).
How intelligences reason
This suggests that:
Finitary reasoning is a shared characteristic of all intelligences, human or non-human.
Non-finitary reasoning is a characteristic of human intelligence that may not be shared by any other intelligence.
Communication between intelligences: SETI
It further suggests that the search for extra-terrestrial intelligence may benefit from the argument that:
Finitary reasoning admits effective and unambiguous communication between two intelligences with respect to its (algorithmically computable) arithmetical truths.
Non-finitary reasoning does not admit effective and unambiguous communication between two intelligences with respect to its (algorithmically verifiable) arithmetical truths.
An unexpected consequence of the arguments of the Birmingham paper is that our perspectives on the relation between determinism and predictability may benefit from the paradigm shift demanded by the argument that:
Finitary reasoning admits the EPR paradox.
Non-finitary reasoning does not admit the EPR paradox.
The arguments of the Birmingham paper also suggest a fresh perspective on the issue of computationalism since:
Finitary reasoning does not admit Lucas’ Gödelian argument.
Non-finitary reasoning admits Lucas’ Gödelian argument.
It further suggests that the nature and status of ‘effective computability’ may also need to be assessed afresh since:
Finitary reasoning naturally equates algorithmic computability with effective computability.
Non-finitary reasoning naturally equates algorithmic verifiability with effective computability.
Church Turing Thesis
As also the nature of CT, since:
Finitary reasoning admits the Church-Turing Thesis.
Non-finitary reasoning does not admit the Church-Turing Thesis.
Broadly speaking, the two conflicting-but-complementary structures defined in the Birmingham paper suggest that we should be more explicit—in our argumentation—of the structure to which a particular assertion about the natural numbers pertains, since:
Both finitary and non-finitary reasoning do not admit the proof of Goodstein’s Theorem as neither admits a completed infinity.
Set-theoretical reasoning admits the proof of Goodstein’s Theorem as it admits a completed infinity.
There’s more …
What do you think?
Does Goodstein’s sequence over the natural numbers always terminate or not?