You are currently browsing the tag archive for the ‘Rosser’ tag.

In this post I address two critical issues, as raised in private correspondence with researchers, which may illuminate some objections to Gödel’s reasoning and conclusions that have been raised elsewhere by Wittgenstein, Floyd, Putnam et al.:

(i) By Rosser’s reasoning, doesn’t simple consistency suffice for defining an undecidable arithmetical proposition?

(ii) Doesn’t Gödel’s undecidable formula assert its own unprovability?

NOTE: The following correspondence refers copiously to *this paper* that was *presented* in June 2015 at the workshop on *Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics*, University of Montpellier, France.

Subsequently, most of the cited results were detailed formally in *the following paper* due to appear in the December 2016 issue of ‘*Cognitive Systems Research*‘:

**A: Doesn’t simple consistency suffice for defining Rosser’s undecidable arithmetical proposition?**

“*You claim that the PA system is -inconsistent, and that Gödel’s first theorem holds vacuously. But by Rosser’s result, simple consistency suffices.*“

Well, it does seem surprising that Rosser’s claim—that his ‘undecidable’ proposition only assumes simple consistency—has not been addressed more extensively in the literature. Number-theoretic expositions of Rosser’s proof have generally remained either implicit or sketchy (see, for instance, *this post*).

Note that Rosser’s proposition and reasoning involve interpretation of an existential quantifier, whilst Gödel’s proposition and reasoning only involve interpretation of a universal quantifier.

The reason why Rosser’s claim is untenable is that—in order to interpret the existential quantifier as per Hilbert’s -calculus—Rosser’s argument needs to assume his Rule C (see Elliott Mendelson, *Introduction to Mathematical Logic*, 1964 ed., p.73), which implicitly implies that Gödel’s arithmetic P—in which Rosser’s argumentation is grounded—is -consistent .

See, for instance, *this analysis* of (a) *Wang’s* outline of Rosser’s argument on p.5, (b) *Beth’s outline* of Rosser’s argument on p.6, and (c) *Mendelson’s exposition* of Rosser’s argument in Section 4.2 on p.8.

Moreover, the assumption is foundationally fragile, because Rule C invalidly assumes that we can introduce an ‘unspecified’ formula denoting an ‘unspecified’ numeral into PA even if the formula has not been demonstrated to be algorithmically definable in terms of the alphabet of PA.

See Theorem 8.5 and following remarks in Section 8, pp.7-8 of *this paper* that was *presented* in June 2015 at the workshop on *Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics*, University of Montpellier, France.

**B: As I see it, rule C is only a shortcut.**

“*As I see it, rule C is only a shortcut; it is totally eliminable. Moreover, it is part of predicate logic, not of the Peano’s arithmetic.*“

Assuming that Rule C is a short cut which can always be eliminated is illusory, and is tantamount to invalidly (see Corollary 8.6, p.17 of *the Epsilon 2015 paper*) claiming that Hilbert’s calculus is a conservative extension of the first-order predicate calculus.

*Reason*: Application of Rule C invalidly (see Theorem 8.5 and following remarks in Section 8, pp.7-8 of *the Epsilon 2015 paper*) involves introduction of a new individual constant, say , in a first-order theory (see Mendelson 1964, p.74, I(iv)); ‘invalidly’ since Rule C does not qualify that must be algorithmically computable from the alphabet of —which is necessary if is first-order.

Notation: We use square brackets to indicate that the expression within the brackets denotes a well-formed formula of a formal system, say , that is to be viewed syntactically merely as a first-order string of —i.e, one which is finitarily constructed from the alphabet of the language of —without any reference to its meaning under any interpretation of .

Essentially, Rule C mirrors in the intuitionistically objectionable postulation that the formula of can always be interpreted as:

holds for some element

in the domain of the interpretation of under which the formula interprets as the relation .

*The Epsilon 2015 paper* shows that this is not a valid interpretation of the formula under any finitary, evidence-based, interpretation of .

That, incidentally, is a consequence of the proof that PA is not -consistent; which itself is a consequence of (Theorem 7.1, p.15, of *the Epsilon 2015 paper*):

**Provability Theorem for PA**: A PA formula is provable if, and only if, interprets as an arithmetical relation that is algorithmically computable as always true (see Definition 3, p.7, of *the Epsilon 2015 paper*) over the structure of the natural numbers.

Compare with what Gödel has essentially shown in his famous 1931 paper on formally undecidable arithmetical propositions, which is that (Lemma 8.1, p.16, of *the Epsilon 2015 paper*):

**Gödel**: There is a PA formula —which Gödel refers to by its Gödel number —which is not provable in PA, even though interprets as an arithmetical relation that is algorithmically verifiable as always true (see Definition 4, p.7, of *the Epsilon 2015 paper*) over the structure of the natural numbers.

**C: If you by-pass the intuitionist objections, would all logicist and post-formalist theories hold?**

“*If I have understood correctly, you claim that the PA system is -inconsistent from an intuitionistic point of view? If you by-pass the intuitionist objections, would all logicist and post-formalist theories hold?*“

There is nothing to bypass—the first-order Peano Arithmetic PA is a formal axiomatic system which is -inconsistent as much for an intuitionist, as it is for a realist, a finitist, a formalist, a logicist or a nominalist.

Philosophers may differ about beliefs that are essentially unverifiable; but the -incompleteness of PA is a verifiable logical meta-theorem that none of them would dispute.

**D: Isn’t Gödel’s undecidable formula —which Gödel refers to by its Gödel number —self-referential?**

*Isn’t Gödel’s undecidable formula —which Gödel refers to by its Gödel number —self-referential and covertly paradoxical?*

*According to Wittgenstein it interprets in any model as a sentence that is devoid of sense, or even meaning. I think a good reason for this is that the formula is simply syntactically wrongly formed: the provability of provability is not defined and can not be consistently defined.*

*What you propose may be correct, but for automation systems of deduction wouldn’t -inconsistency be much more problematic than undecidability? *

*How would you feel if a syntax rule is proposed, that formulas containing numerals are instantiations of open formulas that may not be part of the canonical language? Too daring, may be?*

Let me briefly respond to the interesting points that you have raised.

1. The -inconsistency of PA is a meta-theorem; it is a Corollary of the Provability Theorem of PA (Theorem 7.1, p.15, of *the Epsilon 2015 paper*).

2. Gödel’s PA-formula is not an undecidable formula of PA. It is merely unprovable in PA.

3. Moreover, Gödel’s PA-formula is provable in PA, which is why the PA formula is not an undecidable formula of PA.

4. Gödel’s PA-formula is not self-referential.

5. Wittgenstein correctly believed—albeit purely on the basis of philosophical considerations unrelated to whether or not Gödel’s formal reasoning was correct—that Gödel was wrong in stating that the PA formula asserts its own unprovability in PA.

*Reason*: We have for Gödel’s primitive recursive relation that:

is true if, and only if, the PA formula is provable in PA.

However, in order to conclude that the PA formula asserts its own unprovability in PA, Gödel’s argument must further imply—which it does not—that:

is true (and so, by Gödel’s definition of , the PA formula is not provable in PA) if, and only if, the PA formula is provable in PA.

In other words, for the PA formula to assert its own unprovability in PA, Gödel must show—which his own argument shows is impossible, since the PA formula is not provable in PA—that:

The primitive recursive relation is algorithmically computable as always true if, and only if, the arithmetical relation is algorithmically computable as always true (where is the arithmetical interpretation of the PA formula over the structure of the natural numbers).

6. Hence, Gödel’s PA-formula is not covertly paradoxical.

7. **IF** Wittgenstein believed that the PA formula is empty of meaning and has no valid interpretation, then he was wrong, and—as Gödel justifiably believed—he could not have properly grasped Gödel’s formal reasoning that:

(i) ‘ is not -provable’ is a valid meta-theorem if PA is consistent, which means that:

‘If PA is consistent and we assume that the PA formula is provable in PA, then the PA formula must also be provable in PA; from which we may conclude that the PA formula is not provable in PA’

(ii) ‘ is not -provable’ is a valid meta-theorem ONLY if PA is -consistent, which means that:

‘If PA is -consistent and we assume that the PA formula is provable in PA, then the PA formula must also be provable in PA; from which we may conclude that the PA formula is not provable in PA’.

8. In fact the PA formula has the following TWO meaningful interpretations (the first of which is a true arithmetical meta-statement—since the PA formula is provable in PA for any PA-numeral —but the second is not—since the PA formula is not provable in PA):

(i) For any given natural number , there is an algorithm which will verify that each of the arithmetical meta-statements ‘ is true’, ‘ is true’, …, ‘ is true’ holds under the standard, algorithmically verifiable, interpretation of PA (see \S 5, p.11 of *the Epsilon 2015 paper*);

(ii) There is an algorithm which will verify that, for any given natural number , the arithmetical statement ‘ is true’ holds under the finitary, algorithmically computable, interpretation of PA (see \S 6, p.13 of *the Epsilon 2015 paper*).

9. **IF** Wittgenstein believed that the PA formula is not a well-defined PA formula, then he was wrong.

Gödel’s definition of the PA formula yields a well-formed formula in PA, and cannot be treated as ‘syntactically wrongly formed’.

10. The Provability Theorem for PA shows that both ‘proving something in PA’ and ‘proving that something is provable in PA’ are finitarily well-defined meta-mathematical concepts.

11. The Provability Theorem for PA implies that PA is complete with respect to the concepts of satisfaction, truth and provability definable in automated deduction systems, which can only define algorithmically computable truth.

12. The Provability Theorem for PA implies that PA is categorical, so you can introduce your proposed syntax rule ONLY if it leads to a conservative extension of PA.

13. Whether ‘daring’ or not, why would you want to introduce such a rule?

**E: Consider these two statements of yours …**

*Consider these two statements of yours:*

*“(iv): is the Gödel-number of the formula of PA” and*

*“D(4): Gödel’s PA-formula is not self-referential.”*

*If ‘‘ is the Gödel-number of the open formula in para (iv), and the second argument of the closed formula in para D(4) is ‘‘, then the second formula is obtained by instantiating the variable ‘‘ in the first with its own Gödel-number.*

*So how would you call, in one word, the relation between the entire formula (in D(4)) and its second argument?*

Para D(4) is an attempt to clarify precisely this point.

1. Apropos the first statement ‘(iv)’ cited by you:

From a pedantic perspective, the “relation between the entire formula (in D(4)) and its second argument” cannot be termed self-referential because the “second argument”, i.e., , is the Gödel-number of the PA formula , and not that of “the entire formula (in 4)”, i.e., of the formula itself (whose Gödel number is ).

Putting it crudely, is neither self-referential—nor circularly defined—because it is not defined in terms of , but in terms of .

2. Apropos the second statement ‘D(4)’ cited by you:

I would interpret:

Gödel’s PA-formula is self-referential

to mean, in this particular context, that—as Gödel wrongly claimed:

asserts its own unprovability in PA.

Now, if we were to accept the claim that is self-referential in the above sense, then (as various critics of Gödel’s reasoning have pointed out) we would have to conclude further that Gödel’s argument leads to the contradiction:

is true—and so, by Gödel’s definition of —the PA formula is not provable in PA—if, and only if, the PA formula is provable in PA.

However, in view of the Provability Theorem of PA (Theorem 7.1, p.15, of *the Epsilon 2015 paper*), this contradiction would only follow if Gödel’s argument were to establish (which it does not) that:

The primitive recursive relation is algorithmically computable as always true if, and only if, the arithmetical interpretation of the PA formula is algorithmically computable as always true over the structure of the natural numbers.

The reason Gödel cannot claim to have established the above is that his argument only proves the much weaker meta-statement:

The arithmetical interpretation of the PA formula is algorithmically verifiable as always true over the structure of the natural numbers.

Ergo—contrary to Gödel’s claim— Gödel’s PA-formula is not self-referential (and so, even though Gödel’s claimed interpretation of what his own reasoning proves is wrong, there is no paradox in Gödel’s reasoning per se)!

**F: Is the PA system -inconsistent without remedy?**

*Is the PA system -inconsistent without remedy? Is it possible to introduce a new axiom or new rule which by-passes the problematic unprovable statements of the Gödel-Rosser Theorems?*

1. Please note that the first-order Peano Arithmetic PA is:

(i) consistent (Theorem 7.3, p.15, of *the Epsilon 2015 paper*); which means that for any PA-formula , we cannot have that both and are Theorems of PA;

(ii) complete (Theorem 7.1, p.15, of *the Epsilon 2015 paper*); which means that we cannot add an axiom to PA which is not a Theorem of PA without inviting inconsistency;

(iii) categorical (Theorem 7.2, p.15, of *the Epsilon 2015 paper*); which means that if is an interpretation of PA over a structure , and is an interpretation of PA over a structure , then and are identical and denote the structure of the natural numbers defined by Dedekind’s axioms; and so PA has no model which contains an element that is not a natural number (see Footnote 54, p.16, of *the Epsilon 2015 paper*).

2. What this means with respect to Gödel’s reasoning is that:

(i) PA has no undecidable propositions, which is why it is not -consistent (Corollary 8.4, p.16, of *the Epsilon 2015 paper*);

(ii) The Gödel formula is not provable in PA; but it is algorithmically verifiable as true (Corollary 8.3, p.16, of *the Epsilon 2015 paper*) under the algorithmically verifiable standard interpretation of PA (see Section 5, p.11, of *the Epsilon 2015 paper*) over the structure of the natural numbers;

(iii) The Gödel formula is not provable in PA; and it is algorithmically computable as false (Corollary 8.3, p.16, of *the Epsilon 2015 paper*) under the algorithmically computable finitary interpretation of PA (see Section 6, p.13, of *the Epsilon 2015 paper*) over the structure of the natural numbers;

(iv) The Gödel formula is provable in PA; and it is therefore also algorithmically verifiable as true under the algorithmically verifiable standard interpretation of PA over the structure of the natural numbers—which means that the logic by which the standard interpretation of PA assigns values of ‘satisfaction’ and ‘truth’ to the formulas of PA (under Tarski’s definitions) may be paraconsistent (see *http://plato.stanford.edu/entries/logic-paraconsistent*) since PA is consistent;

(v) The Gödel formula is provable in PA; and it is therefore algorithmically computable as true (Corollary 8.2, p.16, of *the Epsilon 2015 paper*) under the algorithmically computable finitary interpretation of PA over the structure of the natural numbers.

3. It also means that:

(a) The “Gödel-Rosser Theorem” is not a Theorem of PA;

(b) The “unprovable Gödel sentence” is not a “problematic statement”;

(c) The “PA system” does not require a “remedy” just because it is “-inconsistent”;

(d) No “new axiom or new rule” can “by-pass the unprovable sentence”.

4. Which raises the question:

Why do you see the “unprovable Gödel sentence” as a “problematic statement” that requires a “remedy” which must “by-pass the unprovable sentence”?

**Author’s working archives & abstracts of investigations**

**The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought**

*Christopher Mole* is an associate professor of philosophy at the University of British Columbia, Vancouver. He is the author of *Attention is Cognitive Unison: An Essay in Philosophical Psychology* (OUP, 2011), and *The Unexplained Intellect: Complexity, Time, and the Metaphysics of Embodied Thought* (Routledge, 2016).

In his preface to *The Unexplained Intellect*, Mole emphasises that his book is an attempt to provide arguments for (amongst others) the three theses that:

(i) “Intelligence might become explicable if we treat intelligence thought as if it were some sort of computation”;

(ii) “The importance of the rapport between an organism and its environment must be understood from a broadly computational perspective”;

(iii) “ our difficulties in accounting for our psychological orientation with respect to time are indications of the need to shift our philosophical focus away from mental *states*—which are altogether too static—and towards a theory of the mind in which it is *dynamic* mental entities that are taken to be metaphysically foundational”.

Mole explains at length his main claims in *The Unexplained Intellect*—and the cause that those claims serve—in a lucid and penetrating, VI-part, series of invited posts in *The Brains blog* (a leading forum for work in the philosophy and science of mind that was founded in 2005 by *Gualtiero Piccinini*, and has been administered by *John Schwenkler* since late 2011).

In these posts, Mole seeks to make the following points.

**I: The Unexplained Intellect: The mind is not a hoard of sentences**

We do not currently have a satisfactory account of how minds could be had by material creatures. If such an account is to be given then every mental phenomenon will need to find a place within it. Many will be accounted for by relating them to other things that are mental, but there must come a point at which we break out of the mental domain, and account for some things that are mental by reference to some that are not. It is unclear where this break out point will be. In that sense it is unclear which mental entities are, metaphysically speaking, the most fundamental.

At some point in the twentieth century, philosophers fell into the habit of writing as if the most fundamental things in the mental domain are mental states (where these are thought of as states having objective features of the world as their truth-evaluable contents). This led to a picture in which the mind was regarded as something like a hoard of sentences. The philosophers and cognitive scientists who have operated with this picture have taken their job to be telling us what sort of content these mental sentences have, how that content is structured, how the sentences come to have it, how they get put into and taken out of storage, how they interact with one another, how they influence behaviour, and so on.

This emphasis on states has caused us to underestimate the importance of non-static mental entities, such as inferences, actions, and encounters with the world. If we take these dynamic entities to be among the most fundamental of the items in the mental domain, then — I argue — we can avoid a number of philosophical problems. Most importantly, we can avoid a picture in which intelligent thought would be beyond the capacities of any physically implementable system.

**II: The Unexplained Intellect: Computation and the explanation of intelligence**

A lot of philosophers think that consciousness is what makes the mind/body problem interesting, perhaps because they think that consciousness is the only part of that problem that remains wholly philosophical. Other aspects of the mind are taken to be explicable by scientific means, even if explanatorily adequate theories of them remain to be specified.

I’ll remind the reader of computability theory’s power, with a view to indicating how it is that the discoveries of theoretical computer scientists place constraints on our understanding of what intelligence is, and of how it is possible.

**III: The Unexplained Intellect: The importance of computability**

If we found that we had been conceiving of intelligence in such a way that intelligence could not be modelled by a Turing Machine, our response should not be to conclude that some alternative must be found to a ‘Classically Computational Theory of the Mind’. To think only that would be to underestimate the scope of the theory of computability. We should instead conclude that, on the conception in question, intelligence would (be) *absolutely* inexplicable. This need to avoid making intelligence inexplicable places constraints on our conception of what intelligence is.

**IV: The Unexplained Intellect: Consequences of imperfection**

The lesson to be drawn is that, if we think of intelligence as involving the maintenance of satisfiable beliefs, and if we think of our beliefs as corresponding to a set of representational states, then our intelligence would depend on a run of good luck the chances of which are unknown.

My suggestion is that we can reach a more explanatorily satisfactory conception of intelligence if we adopt a dynamic picture of the mind’s metaphysical foundations.

**V: The Unexplained Intellect: The importance of rapport**

I suggest that something roughly similar is true of us. We are not guaranteed to have satisfiable beliefs, and sometimes we are rather bad at avoiding unsatisfiability, but such intelligence as we have is to be explained by reference to the rapport between our minds and the world.

Rather than starting from a set of belief states, and then supposing that there is some internal process operating on these states that enables us to update our beliefs rationally, we should start out by accounting for the dynamic processes through which the world is epistemically encountered. Much as the three-colourable map generator reliably produces three-colourable maps because it is essential to his map-making procedure that borders appear only where they will allow for three colorability, so it is essential to what it is for a state to be a belief that beliefs will appear only if there is some rapport between the believer and the world. And this rapport — rather than any internal processing considered in isolation from it — can explain the tendency for our beliefs to respect the demands of intelligence.

**VI: The Unexplained Intellect: The mind’s dynamic foundations**

memory is essentially a form of epistemic retentiveness: One’s present knowledge counts as an instance of memory when and only when it was attained on the basis of an epistemic encounter that lies in one’s past. One can epistemically encounter a *proposition* as the conclusion of an argument, and so can encounter it before the occurrence of any event to which it pertains, but one cannot encounter an *event* in that way. In the resulting explanation of memory’s temporal asymmetry, it is the dynamic events of epistemic encountering to which we must make reference. These encounters, and not the knowledge states to which they lead, do the lion’s share of the explanatory work.

**A: Simplifying Mole’s perspective**

It may help simplify Mole’s thought-provoking perspective if we make an arbitrary distinction between:

(i) The mind of an applied scientist, whose primary concern is our sensory observations of a ‘common’ external world;

(ii) The mind of a philosopher, whose primary concern is abstracting a coherent perspective of the external world from our sensory observations; and

(iii) The mind of a mathematician, whose primary concern is adequately expressing such abstractions in a formal language of unambiguous communication.

My understanding of Mole’s thesis, then, is that:

(a) although a mathematician’s mind may be capable of defining the ‘truth’ value of some logical and mathematical propositions without reference to the external world,

(b) the ‘truth’ value of any logical or mathematical proposition that purports to represent any aspect of the real world must be capable of being evidenced objectively to the mind of an applied scientist; and that,

(c) of the latter ‘truths’, what should interest the mind of a philosopher is whether there are some that are ‘knowable’ completely independently of the passage of time, and some that are ‘knowable’ only partially, or incrementally, with the passage of time.

**B. Support for Mole’s thesis**

It also seems to me that Mole’s thesis implicitly subsumes, or at the very least echoes, the belief expressed by Chetan R. Murthy (‘An Evaluation Semantics for Classical Proofs‘, Proceedings of Sixth IEEE Symposium on Logic in Computer Science, pp. 96-109, 1991; also Cornell TR 91-1213):

“It is by now folklore … that one can view the values of a simple functional language as specifying evidence for propositions in a constructive logic …”

If so, the thesis seems significantly supported by the following paper that is due to appear in the December 2016 issue of ‘Cognitive Systems Research’:

The CSR paper implicitly suggests that there are, indeed, (only?) two ways of assigning ‘true’ or ‘false’ values to any mathematical description of real-world events.

**C. Algorithmic computability**

First, a number theoretical relation is algorithmically computable if, and only if, there is an algorithm that can provide objective evidence (cf. ibid Murthy 91) for deciding the truth/falsity of each proposition in the denumerable sequence .

(We note that the concept of `algorithmic computability’ is essentially an expression of the more rigorously defined concept of `realizability’ on p.503 of Stephen Cole Kleene’s ‘*Introduction to Metamathematics*‘, North Holland Publishing Company, Amsterdam.)

**D. Algorithmic verifiability**

Second, a number-theoretical relation is algorithmically verifiable if, and only if, for any given natural number , there is an algorithm which can provide objective evidence for deciding the truth/falsity of each proposition in the finite sequence .

We note that algorithmic computability implies the existence of an algorithm that can finitarily decide the truth/falsity of each proposition in a well-defined denumerable sequence of propositions, whereas algorithmic verifiability does not imply the existence of an algorithm that can finitarily decide the truth/falsity of each proposition in a well-defined denumerable sequence of propositions.

The following theorem (Theorem 2.1, p.37 of the *CSR paper*) shows that although every algorithmically computable relation is algorithmically verifiable, the converse is not true:

**Theorem**: There are number theoretic functions that are algorithmically verifiable but not algorithmically computable.

**E. The significance of algorithmic ‘truth’ assignments for Mole’s theses**

The significance of such algorithmic ‘truth’ assignments for Mole’s theses is that:

*Algorithmic computability*—reflecting the ambit of classical Newtonian mechanics—characterises natural phenomena that are determinate and predictable.

Such phenomena are describable by mathematical propositions that can be termed as ‘knowable completely’, since at any point of time they are algorithmically computable as ‘true’ or ‘false’.

Hence both their past and future behaviour is completely computable, and their ‘truth’ values are therefore ‘knowable’ independent of the passage of time.

*Algorithmic verifiability*—reflecting the ambit of Quantum mechanics—characterises natural phenomena that are determinate but unpredictable.

Such phenomena are describable by mathematical propositions that can only be termed as ‘knowable incompletely’, since at any point of time they are only algorithmically verifiable, but not algorithmically computable, as ‘true’ or ‘false’

Hence, although their past behaviour is completely computable, their future behaviour is not completely predictable, and their ‘truth’ values are not independent of the passage of time.

**F. Where Mole’s implicit faith in the adequacy of set theoretical representations of natural phenomena may be misplaced**

It also seems to me that, although Mole’s analysis justifiably holds that the:

“ importance of the rapport between an organism and its environment”

has been underacknowledged, or even overlooked, by existing theories of the mind and intelligence, it does not seem to mistrust, and therefore ascribe such underacknowledgement to any lacuna in, the mathematical and epistemic foundations of the formal language in which almost all descriptions of real-world events are currently sought to be expressed, which is the language of the set theory ZF.

**G. Any claim to a physically manifestable ‘truth’ must be objectively accountable**

Now, so far as applied science is concerned, history teaches us that the ‘truth’ of any mathematical proposition that purports to represent any aspect of the external world must be capable of being evidenced objectively; and that such ‘truths’ must not be only of a subjective and/or revelationary nature which may require truth-certification by evolutionarily selected prophets.

(Not necessarily religious—see, for instance, Melvyn B. Nathanson’s remarks, “*Desperately Seeking Mathematical Truth*“, in the Opinion piece in the August 2008 Notices of the American Mathematical Society, Vol. 55, Issue 7.)

The broader significance of seeking objective accountability is that it admits the following (admittedly iconoclastic) distinction between the two fundamental mathematical languages:

1. The first-order Peano Arithmetic PA as the language of science; and

2. The first-order Set Theory ZF as the language of science fiction.

It is a distinction that is faintly reflected in Stephen G. Simpson’s more conservative perspective in his paper ‘*Partial Realizations of Hilbert’s Program*‘ (#6.4, p.15):

“Finitistic reasoning (my read: ‘First-order Peano Arithmetic PA’) is unique because of its clear real-world meaning and its indispensability for all scientific thought. Nonfinitistic reasoning (my read: ‘First-order Set Theory ZF’) can be accused of referring not to anything in reality but only to arbitrary mental constructions. Hence nonfinitistic mathematics can be accused of being not science but merely a mental game played for the amusement of mathematicians.”

The distinction is supported by the formal argument (detailed in the above-cited CSR paper) that:

(i) PA has two, hitherto unsuspected, evidence-based interpretations, the first of which can be treated as circumscribing the ambit of human reasoning about ‘true’ arithmetical propositions; and the second can be treated as circumscribing the ambit of mechanistic reasoning about ‘true’ arithmetical propositions.

What this means is that the language of arithmetic—formally expressed as PA—can provide all the foundational needs for all practical applications of mathematics in the physical sciences. This was was the point that I sought to make—in a limited way, with respect to quantum phenomena—in the following paper presented at Unilog 2015, Istanbul last year:

(Presented on 26’th June at the workshop on ‘*Emergent Computational Logics*’ at *UNILOG’2015, 5th World Congress and School on Universal Logic*, 20th June 2015 – 30th June 2015, Istanbul, Turkey.)

(ii) Since ZF axiomatically postulates the existence of an infinite set that cannot be evidenced (and which cannot be introduced as a constant into PA, or as an element into the domain of any interpretation of PA, without inviting inconsistency—see Theorem 1 in 4 of *this post*), it can have no evidence-based interpretation that could be treated as circumscribing the ambit of either human reasoning about ‘true’ set-theoretical propositions, or that of mechanistic reasoning about ‘true’ set-theoretical propositions.

The language of set theory—formally expressed as ZF—thus provides the foundation for abstract structures that—although of possible interest to philosophers of science—are only mentally conceivable by mathematicians subjectively, and have no verifiable physical counterparts, or immediately practical applications of mathematics, that can materially impact on the study of physical phenomena.

The significance of this distinction can be expressed more vividly in Russell’s phraseology as:

(iii) In the first-order Peano Arithmetic PA we always know what we are talking about, even though we may not always know whether it is true or not;

(iv) In the first-order Set Theory we never know what we are talking about, so the question of whether or not it is true is only of fictional interest.

**H. The importance of Mole’s ‘rapport’**

Accordingly, I see it as axiomatic that the relationship between an evidence-based mathematical language and the physical phenomena that it purports to describe, must be in what Mole terms as ‘rapport’, if we view mathematics as a set of linguistic tools that have evolved:

(a) to adequately abstract and precisely express through human reasoning our observations of physical phenomena in the world in which we live and work; and

(b) unambiguously communicate such abstractions and their expression to others through objectively evidenced reasoning in order to function to the maximum of our co-operative potential in acieving a better understanding of physical phenomena.

This is the perspective that I sought to make in the following paper presented at Epsilon 2015, Montpellier, last June, where I argue against the introduction of ‘unspecifiable’ elements (such as completed infinities) into either a formal language or any of its evidence-based interpretations (in support of the argument that since a completed infinity cannot be evidence-based, it must therefore be dispensible in any purported description of reality):

(Presented on 10th June at the Epsilon 2015 workshop on ‘*Hilbert’s Epsilon and Tau in Logic, Informatics and Linguistics*’, 10th June 2015 – 12th June 2015, University of Montpellier, France.)

**I. Why mathematical reasoning must reflect an ‘agnostic’ perspective**

Moreover, from a non-mathematician’s perspective, a Propertarian like *Curt Doolittle* would seem justified in his critique (comment of June 2, 2016 in *this Quanta review*) of the seemingly ‘mystical’ and ‘irrelevant’ direction in which conventional interpretations of Hilbert’s ‘theistic’ and Brouwer’s ‘atheistic’ reasoning appear to have pointed mainstream mathematics for, as I argue informally in an *earlier post*, the ‘truths’ of any mathematical reasoning must reflect an ‘agnostic’ perspective.

In a recent paper *A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory*, authors Adam Yedidia and Scott Aaronson argue upfront in their Introduction that:

“*Like any axiomatic system capable of encoding arithmetic, ZFC is constrained by Gödel’s two incompleteness theorems. The first incompleteness theorem states that if ZFC is consistent (it never proves both a statement and its opposite), then ZFC cannot also be complete (able to prove every true statement). The second incompleteness theorem states that if ZFC is consistent, then ZFC cannot prove its own consistency. Because we have built modern mathematics on top of ZFC, we can reasonably be said to have assumed ZFC’s consistency.*“

The question arises:

*How reasonable is it to build modern mathematics on top of a Set Theory such as ZF?*

Some immediate points to ponder upon (see also reservations expressed by Stephen G. Simpson in *Logic and Mathematics* and in *Partial Realizations of Hilbert’s Program*):

**1. “Like any axiomatic system capable of encoding arithmetic, …”**

The implicit assumption here that every ZF formula which is provable about the finite ZF ordinals must necessarily interpret as a true proposition about the natural numbers is fragile since, without such an assumption, we can only conclude from Goodstein’s argument (see Theorem 1.1 here) that a Goodstein sequence defined over the finite ZF ordinals must terminate even if the corresponding Goodstein sequence over the natural numbers does not terminate!

**2. “ZFC is constrained by Gödel’s two incompleteness theorems. The first incompleteness theorem states that if ZFC is consistent (it never proves both a statement and its opposite), then ZFC cannot also be complete (able to prove every true statement). The second incompleteness theorem states that if ZFC is consistent, then ZFC cannot prove its own consistency.”**

The implicit assumption here is that ZF is -consistent, which implies that ZF is consistent and must therefore have an interpretation over some mathematically definable structure in which ZF theorems interpret as ‘true’.

The question arises: Must such ‘truth’ be capable of being evidenced objectively, or is it only of a subjective, revelationary, nature (which may require truth-certification by evolutionarily selected prophets—see Nathanson’s remarks as cited in *this post*)?

The significance of seeking objective accountbility is that in a paper, “*The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas’ Gödelian Thesis*“, which is due to appear in the December 2016 issue of *Cognitive Systems Research*, we show (see also *this post*) that the first-order Peano Arithmetic PA:

(i) is finitarily consistent; but

(ii) is *not* -consistent; and

(iii) has no ‘undecidable’ arithmetical proposition (whence both of Gödel’s Incompleteness Theorems hold vacuously so far as the arithmetic of the natural numbers is concerned).

**3. “Because we have built modern mathematics on top of ZFC, we can reasonably be said to have assumed ZFC’s consistency.”**

Now, one justification for such an assumption (without which it may be difficult to justify building modern mathematics on top of ZF) could be the belief that acquisition of set-theoretical knowledge by students of mathematics has some essential educational dimension.

If so, one should take into account not only the motivations of such a student for the learning of mathematics, but also those of a mathematician for teaching it.

This, in turn, means that both the content of the mathematics which is to be learnt (or taught), as well as the putative utility of such learning (or teaching) for a student (or teacher), merit consideration.

Considering content, I would iconoclastically submit that the least one may then need to accomodate is the following distinction between the two fundamental mathematical languages:

1. The first-order Peano Arithmetic PA, which is the language of science; and

2. The first-order Set Theory ZF, which is the language of science fiction.

A distinction that is reflected in Stephen G. Simpson’s more conservative perspective in *Partial Realizations of Hilbert’s Program* (6.4, p.15):

Finitistic reasoning (*read ‘First-order Peano Arithmetic PA’*) is unique because of its clear real-world meaning and its indispensability for all scientific thought. Nonfinitistic reasoning (*read ‘First-order Set Thyeory ZF’*) can be accused of referring not to anything in reality but only to arbitrary mental constructions. Hence nonfinitistic mathematics can be accused of being not science but merely a mental game played for the amusement of mathematicians.

Reason:

(i) PA has two, hitherto unsuspected, evidence-based interpretations (see *this post*), the first of which can be treated as circumscribing the ambit of human reasoning about `true’ arithmetical propositions; and the second can be treated as circumscribing the ambit of mechanistic reasoning about `true’ arithmetical propositions.

It is this language of arithmetic—formally expressed as PA—that provides the foundation for all practical applications of mathematics where the latter could be argued as having an essential educational dimension.

(ii) Since ZF axiomatically postulates the existence of an infinite set that cannot be evidenced (and which cannot be introduced as a constant into PA, or as an element into the domain of any interpretation of PA, without inviting inconsistency—see paragraph 4.2 of *this post*), it can have no evidence-based interpretation that could be treated as circumscribing the ambit of either human reasoning about `true’ set-theoretical propositions, or that of mechanistic reasoning about `true’ set-theoretical propositions.

The language of set theory—formally expressed as ZF—thus provides the foundation for abstract structures that are only mentally conceivable by mathematicians (subjectively?), and have no physical counterparts, or immediately practical applications of mathematics, which could meaningfully be argued as having an essential educational dimension.

The significance of this distinction can be expressed more vividly in Russell’s phraseology as:

The distinction is lost when—as seems to be the case currently—we treat the acquisition of mathematical knowledge as necessarily including the body of essentially set-theoretic theorems—to the detriment, I would argue, of the larger body of aspiring students of mathematics whose flagging interest in acquiring such a wider knowledge in universities around the world reflects the fact that, for most students, their interests seem to lie primarily in how a study of mathematics can enable them to:

(a) adequately abstract and precisely express through human reasoning their experiences of the world in which they live and work; and

(b) unambiguously communicate such abstractions and their expression to others through objectively evidenced reasoning in order to function to the maximum of their latent potential in acieving their personal real-world goals.

In other words, it is not obvious how how any study of mathematics that has the limited goals (a) and (b) can have any essentially educational dimension that justifies the assumption that ZF is consistent.

**A foundational argument for defining Effective Computability formally, and weakening the Church and Turing Theses – II**

** The Logical Issue**

In the previous posts we addressed first the computational issue, and second the philosophical issue—concerning the informal concept of `effective computability’—that seemed implicit in Selmer Bringsjord’s narrational case against Church’s Thesis ^{[1]}.

We now address the logical issue that leads to a formal definability of this concept which—arguably—captures our intuitive notion of the concept more fully.

We note that in this paper on undecidable arithmetical propositions we have shown how it follows from Theorem VII of Gödel’s seminal 1931 paper that every recursive function is representable in the first-order Peano Arithmetic PA by a formula which is algorithmically verifiable, but not algorithmically computable, *if* we assume (*Aristotle’s particularisation*) that the negation of a universally quantified formula of the first-order predicate calculus is always indicative of the existence of a counter-example under the standard interpretation of PA.

In this earlier post on the Birmingham paper, we have also shown that:

(i) The concept of algorithmic verifiability is well-defined under the standard interpretation of PA over the structure of the natural numbers; and

(ii) The concept of algorithmic computability too is well-defined under the algorithmic interpretation of PA over the structure of the natural numbers; and

We shall argue in this post that the standard postulation of the Church-Turing Thesis—which postulates that the intuitive concept of `effective computability’ is completely captured by the formal notion of `algorithmic computability’—does not hold if we formally define a number-theoretic formula as effectively computable if, and only if, it is algorithmically verifiable; and it therefore needs to be replaced by a weaker postulation of the Thesis as an instantiational equivalence.

** Weakening the Church and Turing Theses**

We begin by noting that the following theses are classically equivalent ^{[1]}:

**Standard Church’s Thesis:** ^{[2]} A number-theoretic function (or relation, treated as a Boolean function) is effectively computable if, and only if, it is recursive ^{[3]}.

**Standard Turing’s Thesis:** ^{[4]} A number-theoretic function (or relation, treated as a Boolean function) is effectively computable if, and only if, it is Turing-computable ^{[5]}.

In this paper we shall argue that, from a foundational perspective, the principle of Occam’s razor suggests the Theses should be postulated minimally as the following equivalences:

**Weak Church’s Thesis:** A number-theoretic function (or relation, treated as a Boolean function) is effectively computable if, and only if, it is instantiationally equivalent to a recursive function (or relation, treated as a Boolean function).

**Weak Turing’s Thesis:** A number-theoretic function (or relation, treated as a Boolean function) is effectively computable if, and only if, it is instantiationally equivalent to a Turing-computable function (or relation, treated as a Boolean function).

** The need for explicitly distinguishing between `instantiational’ and `uniform’ methods**

**Why Church’s Thesis?**

It is significant that both Kurt Gödel (initially) and Alonzo Church (subsequently—possibly under the influence of Gödel’s disquietitude) enunciated Church’s formulation of `effective computability’ as a Thesis because Gödel was instinctively uncomfortable with accepting it as a definition that *minimally* captures the essence of `*intuitive* effective computability’ ^{[6]}.

**Kurt Gödel’s reservations**

Gödel’s reservations seem vindicated if we accept that a number-theoretic function can be effectively computable instantiationally (in the sense of being algorithmically *verifiable* as defined in the Birmingham paper, reproduced in this post), but not by a uniform method (in the sense of being algorithmically *computable* as defined in the Birmingham paper, reproduced in this post).

The significance of the fact (considered in the Birmingham paper, reproduced in this post) that `truth’ too can be effectively decidable *both* instantiationally *and* by a uniform method under the standard interpretation of PA is reflected in Gödel’s famous 1951 Gibbs lecture^{[7]}, where he remarks:

“I wish to point out that one may conjecture the truth of a universal proposition (for example, that I shall be able to verify a certain property for any integer given to me) and at the same time conjecture that no general proof for this fact exists. It is easy to imagine situations in which both these conjectures would be very well founded. For the first half of it, this would, for example, be the case if the proposition in question were some equation of two number-theoretical functions which could be verified up to very great numbers .” ^{[8]}

**Alan Turing’s perspective**

Such a possibility is also implicit in Turing’s remarks ^{[9]}:

“The computable numbers do not include all (in the ordinary sense) definable numbers. Let P be a sequence whose *n*-th figure is 1 or 0 according as *n* is or is not satisfactory. It is an immediate consequence of the theorem of that P is not computable. It is (so far as we know at present) possible that any assigned number of figures of P can be calculated, but not by a uniform process. When sufficiently many figures of P have been calculated, an essentially new method is necessary in order to obtain more figures.”

**Boolos, Burgess and Jeffrey’s query**

The need for placing such a distinction on a formal basis has also been expressed explicitly on occasion ^{[10]}.

Thus, Boolos, Burgess and Jeffrey ^{[11]} define a diagonal *halting function*, , any value of which can be decided effectively, although there is no single algorithm that can effectively compute .

Now, the straightforward way of expressing this phenomenon should be to say that there are well-defined number-theoretic functions that are effectively computable instantiationally but not uniformly. Yet, following Church and Turing, such functions are labeled as uncomputable ^{[12]}!

However, as Boolos, Burgess and Jeffrey note quizically:

“According to Turing’s Thesis, since is not Turing-computable, cannot be effectively computable. Why not? After all, although no Turing machine computes the function , we were able to compute at least its first few values, For since, as we have noted, the empty function we have . And it may seem that we can actually compute for any positive integer —if we don’t run out of time.” ^{[13]}

**Why should Chaitin’s constant be labelled `uncomputable’?**

The reluctance to treat a function such as —or the function that computes the digit in the decimal expression of a Chaitin constant ^{[14]}—as computable, on the grounds that the `time’ needed to compute it increases monotonically with , is curious ^{[15]}; the same applies to any total Turing-computable function !^{[16]}

Moreover, such a reluctance to treat instantiationally computable functions such as as not `effectively computable’ is difficult to reconcile with a conventional wisdom that holds the standard interpretation of the first order Peano Arithmetic PA as defining an intuitively sound model of PA.

*Reason:* We have shown in the Birmingham paper (reproduced in this post) that ‘satisfaction’ and ‘truth’ under the standard interpretation of PA is definable constructively in terms of algorithmic verifiability (*instantiational computability*).

** Distinguishing between algorithmic verifiability and algorithmic computability**

We now show in Theorem 1 that if Aristotle’s particularisation is presumed valid over the structure of the natural numbers—as is the case under the standard interpretation of the first-order Peano Arithmetic PA—then it follows from the instantiational nature of the (constructively defined ^{[17]}) Gödel -function that a primitive recursive relation can be instantiationally equivalent to an arithmetical relation, where the former is algorithmically computable over , whilst the latter is algorithmically verifiable (i.e., instantiationally computable) but not algorithmically computable over .^{[18]}

** Significance of Gödel’s -function**

We note first that in Theorem VII of his seminal 1931 paper on formally undecidable arithmetical propositions Gödel showed that, given a total number-theoretic function and any natural number , we can construct a primitive recursive function and natural numbers such that for all .

In this paper we shall essentially answer the following question affirmatively:

**Query 3:** Does Gödel’s Theorem VII admit construction of an arithmetical function such that:

(a) for any given natural number , there is an algorithm that can verify for all (hence may be said to be algorithmically verifiable if is recursive);

(b) there is no algorithm that can verify for all (so may be said to be algorithmically uncomputable)?

** Defining effective computability**

Now, in the Birmingham paper (reproduced in this post), we have formally defined what it means for a formula of an arithmetical language to be:

(i) Algorithmically verifiable;

(ii) Algorithmically computable.

under an interpretation.

We shall thus propose the definition:

**Effective computability:** A number-theoretic formula is effectively computable if, and only if, it is algorithmically verifiable.

**Intuitionistically unobjectionable:** We note first that since every finite set of integers is recursive, every well-defined number-theoretical formula is algorithmically verifiable, and so the above definition is intuitionistically unobjectionable; and second that the existence of an arithmetic formula that is algorithmically verifiable but not algorithmically computable (Theorem 1) supports Gödel’s reservations on Alonzo Church’s original intention to label his Thesis as a definition ^{[19]}.

The concept is well-defined, since we have shown in the Birmingham paper (reproduced in this post) that the algorithmically verifiable and the algorithmically computable PA formulas are well-defined under the standard interpretation of PA and that:

(a) The PA-formulas are decidable as satisfied / unsatisfied or true / false under the standard interpretation of PA if, and only if, they are algorithmically verifiable;

(b) The algorithmically computable PA-formulas are a proper subset of the algorithmically verifiable PA-formulas;

(c) The PA-axioms are algorithmically computable as satisfied / true under the standard interpretation of PA;

(d) Generalisation and Modus Ponens preserve algorithmically computable truth under the standard interpretation of PA;

(e) The provable PA-formulas are precisely the ones that are algorithmically computable as satisfied / true under the standard interpretation of PA.

** Gödel’s Theorem VII and algorithmically verifiable, but not algorithmically computable, arithmetical propositions**

In his seminal 1931 paper on formally undecidable arithmetical propositions, Gödel defined a curious primitive recursive function—Gödel’s -function—as ^{[20]}:

**Definition 1:**

where denotes the remainder obtained on dividing by .

Gödel showed that the above function has the remarkable property that:

**Lemma 1:** For any given denumerable sequence of natural numbers, say , and any given natural number , we can construct natural numbers such that:

(i) ;

(ii) !;

(iii) for .

**Proof:** This is a standard result ^{[21]}.

Now we have the standard definition ^{[22]}:

**Definition 2:** A number-theoretic function is said to be representable in PA if, and only if, there is a PA formula with the free variables , such that, for any given natural numbers :

(i) if then PA proves: ;

(ii) PA proves: .

The function is said to be strongly representable in PA if we further have that:

(iii) PA proves:

**Interpretation of `‘:** The symbol `‘ denotes `uniqueness’ under an interpretation which assumes that Aristotle’s particularisation holds in the domain of the interpretation.

Formally, however, the PA formula:

is merely a short-hand notation for the PA formula:

.

We then have:

**Lemma 2** is strongly represented in PA by , which is defined as follows:

.

**Proof:** This is a standard result ^{[23]}.

Gödel further showed (also under the tacit, but critical, presumption of Aristotle’s particularisation ^{[24]} that:

**Lemma 3:** If is a recursive function defined by:

(i)

(ii)

where and are recursive functions of lower rank ^{[25]} that are represented in PA by well-formed formulas and ,

then is represented in PA by the following well-formed formula, denoted by :

**Proof:** This is a standard result ^{[26]}.

** What does “ is provable” assert under the standard interpretation of PA?**

Now, if the PA formula represents in PA the recursive function denoted by then by definition, for any given numerals , the formula is provable in PA; and true under the standard interpretation of PA.

We thus have that:

**Lemma 4:** “ is true under the standard interpretation of PA” is the assertion that:

Given any natural numbers , we can construct natural numbers —all functions of —such that:

(a) ;

(b) for all , ;

(c) ;

where , and are any recursive functions that are formally represented in PA by and respectively such that:

(i)

(ii) for all

(iii) and are recursive functions that are assumed to be of lower rank than .

**Proof:** For any given natural numbers and , if interprets as a well-defined arithmetical relation under the standard interpretation of PA, then we can define a deterministic Turing machine that can `construct’ the sequences:

and:

and give evidence to verify the assertion. ^{[27]}

We now see that:

**Theorem 1:** Under the standard interpretation of PA is algorithmically verifiable, but not algorithmically computable, as always true over .

**Proof:** It follows from Lemma 4 that:

(1) is PA-provable for any given numerals . Hence is true under the standard interpretation of PA. It then follows from the definition of in Lemma 3 that, for any given natural numbers , we can construct some pair of natural numbers —where are functions of the given natural numbers and —such that:

(a) for ;

(b) holds in .

Since is primitive recursive, defines a deterministic Turing machine that can `construct’ the denumerable sequence for any given natural numbers and such that:

(c) for .

We can thus define a deterministic Turing machine that will give evidence that the PA formula is true under the standard interpretation of PA.

Hence is algorithmically verifiable over under the standard interpretation of PA.

(2) Now, the pair of natural numbers are defined such that:

(a) for ;

(b) holds in ;

where is defined in Lemma 3 as !, and:

(c) ;

(d) is the `number’ of terms in the sequence .

Since is not definable for a denumerable sequence we cannot define a denumerable sequence such that:

(e) for all .

We cannot thus define a deterministic Turing machine that will give evidence that the PA formula interprets as true under the standard interpretation of PA for any given sequence of numerals .

Hence is not algorithmically computable over under the standard interpretation of PA.

The theorem follows.

**Corollary 1:** If the standard interpretation of PA is sound, then the classical Church and Turing theses are false.

The above theorem now suggests the following definition:

**Definition 2:** (*Effective computability*) A number-theoretic function is effectively computable if, and only if, it is algorithmically verifiable.

Such a definition of effective computability now allows the classical Church and Turing theses to be expressed as the weak equivalences in —rather than as identities—without any apparent loss of generality.

**References**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic* (4th ed). Cambridge University Press, Cambridge.

** Bri93** Selmer Bringsjord. 1993. *The Narrational Case Against Church’s Thesis.* Easter APA meetings, Atlanta.

**Ch36** Alonzo Church. 1936. *An unsolvable problem of elementary number theory.* In M. Davis (ed.). 1965. *The Undecidable* Raven Press, New York. Reprinted from the Am. J. Math., Vol. 58, pp.345-363.

**Ct75** Gregory J. Chaitin. 1975. *A Theory of Program Size Formally Identical to Information Theory.* J. Assoc. Comput. Mach. 22 (1975), pp. 329-340.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**Go51** Kurt Gödel. 1951. *Some basic theorems on the foundations of mathematics and their implications.* Gibbs lecture. In Kurt Gödel, Collected Works III, pp.304-323.\ 1995. *Unpublished Essays and Lectures.* Solomon Feferman et al (ed.). Oxford University Press, New York.

**Ka59** Laszlo Kalmár. 1959. *An Argument Against the Plausibility of Church’s Thesis.* In Heyting, A. (ed.) *Constructivity in Mathematics.* North-Holland, Amsterdam.

**Kl36** Stephen Cole Kleene. 1936. *General Recursive Functions of Natural Numbers.* Math. Annalen vol. 112 (1936) pp.727-766.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand, Princeton.

**Me90** Elliott Mendelson. 1990. *Second Thoughts About Church’s Thesis and Mathematical Proofs.* Journal of Philosophy 87.5.

**Pa71** Rohit Parikh. 1971. *Existence and Feasibility in Arithmetic.* The Journal of Symbolic Logic, Vol.36, No. 3 (Sep., 1971), pp. 494-508.

**Si97** Wilfried Sieg. 1997. *Step by recursive step: Church’s analysis of effective calculability* Bulletin of Symbolic Logic, Volume 3, Number 2.

**Sm07** Peter Smith. 2007. *Church’s Thesis after 70 Years.* A commentary and critical review of *Church’s Thesis After 70 Years.* In Meinong Studies Vol 1 (Ontos Mathematical Logic 1), 2006 (2013), Eds. Adam Olszewski, Jan Wolenski, Robert Janusz. Ontos Verlag (Walter de Gruyter), Frankfurt, Germany.

**Tu36** Alan Turing. 1936. *On computable numbers, with an application to the Entscheidungsproblem* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from the Proceedings of the London Mathematical Society, ser. 2. vol. 42 (1936-7), pp.230-265; corrections, Ibid, vol 43 (1937) pp. 544-546.

**An07** Bhupinder Singh Anand. 2007. *Why we shouldn’t fault Lucas and Penrose for continuing to believe in the Gödelian argument against computationalism – II.* In *The Reasoner*, Vol(1)7 p2-3.

**An12** … 2012. *Evidence-Based Interpretations of PA.* In Proceedings of the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, 2-6 July 2012, University of Birmingham, Birmingham, UK.

**Notes**

Return to 1: cf. Me64, p.237.

Return to 2: *Church’s (original) Thesis:* The effectively computable number-theoretic functions are the algorithmically computable number-theoretic functions Ch36.

Return to 11: cf. Me64, p.227.

Return to 4: After describing what he meant by “computable” numbers in the opening sentence of his 1936 paper on Computable Numbers Tu36, Turing immediately expressed this thesis—albeit informally—as: “… the computable numbers include all numbers which could naturally be regarded as computable”.

Return to 5: cf. BBJ03, p.33.

Return to 6: See Si97.

Return to 7: Go51.

Return to 8: Parikh’s paper Pa71 can also be viewed as an attempt to investigate the consequences of expressing the essence of Gödel’s remarks formally.

Return to 9: Tu36, , p.139.

Return to 10: Parikh’s distinction between `decidability’ and `feasibility’ in Pa71 also appears to echo the need for such a distinction.

Return to 11: BBJ03, p. 37.

Return to 12: The issue here seems to be that, when using language to express the abstract objects of our individual, and common, mental `concept spaces’, we use the word `exists’ loosely in three senses, without making explicit distinctions between them (see An07).

Return to 13: BBJ03, p.37.

Return to 14: Chaitin’s Halting Probability is given by , where the summation is over all self-delimiting programs that halt, and is the size in bits of the halting program ; see Ct75.

Return to 15: The incongruity of this is addressed by Parikh in Pa71.

Return to 16: The only difference being that, in the latter case, we know there is a common `program’ of constant length that will compute for any given natural number ; in the former, we know we may need distinctly different programs for computing for different values of , where the length of the program will, sometime, reference .

Return to 17: By Kurt Gödel; see Go31, Theorem VII.

Return to 18: **Analagous distinctions in analysis:** The distinction between algorithmically computable, and algorithmically verifiable but not algorithmically computable, number-theoretic functions seeks to reflect in arithmetic the essence of *uniform* methods (formally detailed in the Birmingham paper (reproduced in this post) and in its main consequence—the Provability Theorem for PA—as detailed in this post), classically characterised by the distinctions in analysis between: (a) uniformly continuous, and point-wise continuous but not uniformly continuous, functions over an interval; (b) uniformly convergent, and point-wise convergent but not uniformly convergent, series.

**A limitation of set theory and a possible barrier to computation:** We note, further, that the above distinction cannot be reflected within a language—such as the set theory ZF—which identifies `equality’ with `equivalence’. Since functions are defined extensionally as mappings, such a language cannot recognise that a set which represents a primitive recursive function may be equivalent to, but computationally different from, a set that represents an arithmetical function; where the former function is algorithmically computable over , whilst the latter is algorithmically verifiable but not algorithmically computable over .

Return to 19: See the Provability Theorem for PA in this post.

Return to 20: cf. Go31, p.31, Lemma 1; Me64, p.131, Proposition 3.21.

Return to 21: cf. Go31, p.31, Lemma 1; Me64, p.131, Proposition 3.22.

Return to 22: Me64, p.118.

Return to 23: cf. Me64, p.131, proposition 3.21.

Return to 24: The implicit assumption being that the negation of a universally quantified formula of the first-order predicate calculus is indicative of “the existence of a counter-example”—Go31, p.32.

Return to 25: cf. Me64, p.132; Go31, p.30(2).

Return to 26: cf. Go31, p.31(2); Me64}, p.132.

Return to 27: A critical philosophical issue that we do not address here is whether the PA formula can be considered to interpret under a sound interpretation of PA as a well-defined predicate, since the denumerable sequences and is not equal to if is not equal to —are represented by denumerable, distinctly different, functions respectively. There are thus denumerable pairs for which yields the sequence .

**A foundational argument for defining Effective Computability formally, and weakening the Church and Turing Theses – I**

** The Philosophical Issue**

In a previous post we have argued that standard interpretations of classical theory may inadvertently be weakening a desirable perception—of mathematics as the lingua franca of scientific expression—by ignoring the possibility that since mathematics is, indeed, indisputably accepted as the language that most effectively expresses and communicates intuitive truth, the chasm between formal truth and provability must, of necessity, be bridgeable.

We further queried whether the roots of such interpretations may lie in removable ambiguities that currently persist in the classical definitions of foundational elements; ambiguities that allow the introduction of non-constructive—hence non-verifiable, non-computational, ambiguous and essentially Platonic—elements into the standard interpretations of classical mathematics.

**Query 1:** Are formal classical theories essentially unable to adequately express the extent and range of human cognition, or does the problem lie in the way formal theories are classically interpreted at the moment?

We noted that the former addressed the question of whether there are absolute limits on our capacity to express human cognition unambiguously; the latter, whether there are only temporal limits—not necessarily absolute—to the capacity of classical interpretations to communicate unambiguously that which we intended to capture within our formal expression.

We argued that, prima facie, applied science continues, perforce, to interpret mathematical concepts Platonically, whilst waiting for mathematics to provide suitable, and hopefully reliable, answers as to how best it may faithfully express its observations verifiably.

** Are axiomatic computational concepts really unambiguous?**

This now raises the corresponding philosophical question that is implicit in Selmer Bringsjord’s narrational case against Church’s Thesis ^{[1]}:

**Query 2** Is there a duality in the classical acceptance of non-constructive, foundational, concepts as axiomatic?

We now argue that beyond the question raised in an earlier post of whether—as computer scientist Lance Fortnow believes—Turing machines can `capture everything we can compute’, or whether—as computer scientists Peter Wegner and Dina Goldin suggest—they are `inappropriate as a universal foundation for computational problem solving’, we also need to address the philosophical question—implicit in Bringsjord’s paper—of whether, or not, the concept of `effective computability’ is capable of a constructive, and intuitionistically unobjectionable, definition; and the relation of such definition to that of formal provability and to the standard perceptions of the Church and Turing Theses as reviewed here by at heart Trinity mathmo and by profession Philosopher Peter Smith.

We therefore consider the case for introduction of such a definition from a philosophical point of view, and consider some consequences.

** Mendelson’s thesis**

We note that Elliott Mendelson ^{[2]} is quoted by Bringsjord in his paper as saying (*italicised parenthetical qualifications added*):

(i) “Here is the main conclusion I wish to draw:

it is completely unwarranted to say that CT is unprovable just because it states an equivalence between a vague, imprecise notion (effectively computable function) and a precise mathematical notion (partial-recursive function)”.

(ii) “The concepts and assumptions that support the notion of partial-recursive function are, in an essential way, no less vague and imprecise (*non-constructive, and intuitionistically objectionable*) than the notion of effectively computable function; the former are just more familiar and are part of a respectable theory with connections to other parts of logic and mathematics.

(The notion of effectively computable function could have been incorporated into an axiomatic presentation of classical mathematics, but the acceptance of CT made this unnecessary.) …

Functions are defined in terms of sets, but the concept of set is no clearer (*not more non-constructive, and intuitionistically objectionable*) than that of function and a foundation of mathematics can be based on a theory using function as primitive notion instead of set.

Tarski’s definition of truth is formulated in set-theoretic terms, but the notion of set is no clearer (*not more non-constructive, and intuitionistically objectionable*), than that of truth.

The model-theoretic definition of logical validity is based ultimately on set theory, the foundations of which are no clearer (*not more non-constructive, and intuitionistically objectionable*) than our intuitive (*non-constructive, and intuitionistically objectionable*) understanding of logical validity”.

(iii) “The notion of Turing-computable function is no clearer (*not more non-constructive, and intuitionistically objectionable*) than, nor more mathematically useful (foundationally speaking) than, the notion of an effectively computable function …”

where:

(a) The Church-Turing Thesis, CT, is formulated as:

“A function is effectively computable if and only if it is Turing-computable”.

(b) An effectively computable function is defined to be the computing of the function by an algorithm.

(c) The classical notion of an algorithm is expressed by Mendelson as:

“… an effective and completely specified procedure for solving a whole class of problems. …

An algorithm does not require ingenuity; its application is prescribed in advance and does not depend upon any empirical or random factors”.

and, where Bringsjord paraphrases (iii) as:

(iv) “The notion of a formally defined program for guiding the operation of a TM is no clearer than, nor more mathematically useful (foundationally speaking) than, the notion of an algorithm”.

adding that:

(v) “This proposition, it would then seem, is the very heart of the matter.

If (iv) is true then Mendelson has made his case; if this proposition is false, then his case is doomed, since we can chain back by modus tollens and negate (iii)”.

** The concept of `constructive, and intuitionistically unobjectionable’**

Now, prima facie, any formalisation of a `vague and imprecise’, `intuitive’ concept—say C—would normally be intended to capture the concept C both faithfully and completely within a constructive, and intuitionistically unobjectionable ^{[3]}, language L.

Clearly, we could disprove the thesis—that C and its formalisation L are interchangeable, hence equivalent—by showing that there is a constructive aspect of C that is formalisable in a constructive language L’, but that such formalisation cannot be assumed expressible in L without introducing inconsistency.

However, equally clearly, there can be no way of proving the equivalence as this would contradict the premise that the concept is `vague and imprecise’, hence essentially open-ended in a non-definable way, and so non-formalisable.

Obviously, Mendelson’s assertion that there is no justification for claiming Church’s Thesis as unprovable must, therefore, rely on an interpretation that differs significantly from the above; for instance, his concept of provability may appeal to the axiomatic acceptability of `vague and imprecise’ concepts—as suggested by his remarks.

Now, we note that all the examples cited by Mendelson involve the decidability (computability) of an infinitude of meta-mathematical instances, where the distinction between the constructive meta-assertion that any given instance is individually decidable (instantiationally computable), and the non-constructive meta-assertion that all the instances are jointly decidable (uniformly computable), is not addressed explicitly.

However, , and appear to suggest that Mendelson’s remarks relate implicitly to non-constructive meta-assertions.

Perhaps the real issue, then, is the one that emerges if we replace Mendelson’s use of implicitly open-ended concepts such as `vague and imprecise’ and `intuitive’ by the more meta-mathematically meaningful concept of `non-constructive, and intuitionistically objectionable’, as italicised and indicated parenthetically.

The essence of Mendelson’s meta-assertion then appears to be that, if the classically accepted definitions of foundational concepts such as `partial recursive function’, `function’, `Tarskian truth’ etc. are also non-constructive, and intuitionistically objectionable, then replacing one non-constructive concept by another may be psychologically unappealing, but it should be meta-mathematically valid and acceptable.

** The duality**

Clearly, meta-assertion would stand refuted by a `non-algorithmic’ effective method that is constructive.

However, if it is explicitly—and, as suggested by the nature of the arguments in Bringsjord’s paper, widely—accepted at the outset that any effective method is necessarily algorithmic (i.e. uniform as stated in above), then any counter-argument to CT can, prima facie, only offer non-algorithmic methods that may, paradoxically, be `effective’ intuitively but in a non-constructive, and intuitionistically objectionable, way only!

Recognition of this dilemma is implicit in the admission that the various arguments, as presented by Bringsjord in the case against Church’s Thesis—including his narrational case—are open to reasonable, but inconclusive, refutations.

Nevertheless, if we accept Mendelson’s thesis that the inter-changeability of non-constructive concepts is valid in the foundations of mathematics, then Bringsjord’s case against Church’s Thesis, since it is based similarly on non-constructive concepts, should also be considered conclusive classically (even though it cannot, prima facie, be considered constructively conclusive in an intuitionistically unobjectionable way).

There is, thus, an apparent duality in the—seemingly extra-logical—decision as to whether an argument based on non-constructive concepts may be accepted as classically conclusive or not.

That this duality may originate in the very issues raised in Mendelson’s remarks—concerning the non-constructive roots of foundational concepts that are classically accepted as mathematically sound—is seen if we note that these issues may be more significant than is, prima facie, apparent.

** Definition of a formal mathematical object, and consequences**

Thus, if we define a formal mathematical object as any symbol for an individual letter, function letter or a predicate letter that can be introduced through definition into a formal theory without inviting inconsistency, then it can be argued that unrestricted, non-constructive, definitions of non-constructive, foundational, set-theoretic concepts—such as `mapping’, `function’, `recursively enumerable set’, etc.—in terms of constructive number-theoretic concepts—such as recursive number-theoretic functions and relations—may not always correspond to formal mathematical objects.

In other words, the assumption that every definition corresponds to a formal mathematical object may introduce a formal inconsistency into standard Peano Arithmetic and, ipso facto, into any Axiomatic Set Theory that models standard PA (an inconsistency which, loosely speaking, may be viewed as a constructive arithmetical parallel to Russell’s non-constructive impredicative set).

Since it can also be argued that the non-constructive element in Tarski’s definitions of `satisfiability’ and `truth’, and in Church’s Thesis, originate in a common, but removable, ambiguity in the interpretation of an effective method, perhaps it is worth considering whether Bringsjord’s acceptance of the assumption—that every constructive effective method is necessarily algorithmic, in the sense of being a uniform procedure as in above—is mathematically necessary, or even whether it is at all intuitively tenable.

(*Uniform procedure: A property usually taken to be a necessary condition for a procedure to qualify as effective.*)

Thus, we may argue that we can explicitly and constructively define a `non-algorithmic’ effective method as one that, in any given instance, is instantiationally computable if, and only if, it terminates finitely with a conclusive result; and an `algorithmic’ effective method as one that is uniformly computable if, and only if, it terminates finitely, with a conclusive result, in any given instance. ^{[4]}

** Bringsjord’s case against CT**

Apropos the specific arguments against CT it would seem, prima facie, that a non-algorithmic effective—even if not obviously constructive—method could be implicit in the following argument considered by Bringsjord:

“Assume for the sake of argument that all human cognition consists in the execution of effective processes (in brains, perhaps). It would then follow by CT that such processes are Turing-computable, i.e., that computationalism is true. However, if computationalism is false, while there remains incontrovertible evidence that human cognition consists in the execution of effective processes, CT is overthrown”.

Assuming computationalism is false, the issue in this argument would, then, be whether there is a constructive, and adequate, expression of human cognition in terms of individually effective methods.

An appeal to such a non-algorithmic effective method may, in fact, be implicit in Bringsjord’s consideration of the predicate H, defined by:

iff

where the predicate holds if, and only if, TM M, running program P on input , halts in exactly steps ( halt).

**Bringsjord’s Total Computability**

Bringsjord defines S as totally (*and, implicitly, uniformly*) computable in the sense that, given some triple , there is some (*uniform*) program P* which, running on some TM M*, can infallibly give us a verdict, Y (`yes’) or N (`no’), for whether or not S is true of this triple.

He then notes that, since the ability to (*uniformly*) determine, for a pair , whether or not H is true of it, is equivalent to solving the full halting problem, H is not totally computable.

**Bringsjord’s Partial Computability**

However, he also notes that there is a program (*implicitly non-uniform, and so, possibly, effective individually*) which, when asked whether or not some TM M run by P on halts, will produce Y iff halt. For this reason H is declared partially (*implicitly, individually*) computable.

More explicitly, Bringsjord remarks that Laszlo Kalmár’s refutation of CT ^{[5]} is classically inconclusive mainly because it does not admit any uniform effective method, but appeals to the existence of an infinitude of individually effective methods.

**Kalmár’s Perspective of CT**

Considering that it always seeks to calculate (defined below) constructively even in the absence of a uniform procedure—not necessarily within a fixed postulate system—we shall show that Kalmár’s finitary argument (^{[6]}as reproduced below from Bringsjord’s paper) makes a pertinent observation:

“First, he draws our attention to a function that isn’t Turing-computable, given that is ^{[7]}:

= {the least such that if exists; and if there is no such }

Kalmár proceeds to point out that for any in for which a natural number with exists,

`an obvious method for the calculation of the least such … can be given,’

namely, calculate in succession the values (which, by hypothesis, is something a computist or TM can do) until we hit a natural number such that , and set .

On the other hand, for any natural number for which we can prove, not in the frame of some fixed postulate system but by means of arbitrary—of course, correct—arguments that no natural number with exists, we have also a method to calculate the value in a finite number of steps.

Kalmár goes on to argue as follows. The definition of itself implies the tertium non datur, and from it and CT we can infer the existence of a natural number which is such that

(*) there is no natural number such that ; and

(**) this cannot be proved by any correct means.

Kalmár claims that (*) and (**) are very strange, and that therefore CT is at the very least implausible.”

**Distinguishing between individually effective computability and uniformly effective computability**

Now, the significant point that emerges from Bringsjord’s and Kalmár’s philosophical arguments is the need to distinguish formally between non-algorithmic (i.e., instantiational) computability (or, more precisely, algorithmic verifiability as defined here) and algorithmic (i.e., uniform) computability (or, more precisely, algorithmic computability as defined here) as highlighted in the Birmingham paper.

In the next post we note that this point has also been raised from a more formal, logical, perspective; and consider what is arguably an intuitively-more-adequate formal definability of `effective computability’ in terms of ‘algorithmic verifiability’ under which the classical Church and Turing Theses do not hold, but weakened Church and Turing Theses do!

**References**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic* (4th ed). Cambridge University Press, Cambridge.

** Bri93** Selmer Bringsjord. 1993. *The Narrational Case Against Church’s Thesis.* Easter APA meetings, Atlanta.

**Ch36** Alonzo Church. 1936. *An unsolvable problem of elementary number theory.* In M. Davis (ed.). 1965. *The Undecidable* Raven Press, New York. Reprinted from the Am. J. Math., Vol. 58, pp.345-363.

**Ct75** Gregory J. Chaitin. 1975. *A Theory of Program Size Formally Identical to Information Theory.* J. Assoc. Comput. Mach. 22 (1975), pp. 329-340.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**Go51** Kurt Gödel. 1951. *Some basic theorems on the foundations of mathematics and their implications.* Gibbs lecture. In Kurt Gödel, Collected Works III, pp.304-323.\ 1995. *Unpublished Essays and Lectures.* Solomon Feferman et al (ed.). Oxford University Press, New York.

**Ka59** Laszlo Kalmár. 1959. *An Argument Against the Plausibility of Church’s Thesis.* In Heyting, A. (ed.) *Constructivity in Mathematics.* North-Holland, Amsterdam.

**Kl36** Stephen Cole Kleene. 1936. *General Recursive Functions of Natural Numbers.* Math. Annalen vol. 112 (1936) pp.727-766.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand, Princeton.

**Me90** Elliott Mendelson. 1990. *Second Thoughts About Church’s Thesis and Mathematical Proofs.* Journal of Philosophy 87.5.

**Pa71** Rohit Parikh. 1971. *Existence and Feasibility in Arithmetic.* The Journal of Symbolic Logic, Vol.36, No. 3 (Sep., 1971), pp. 494-508.

**Si97** Wilfried Sieg. 1997. *Step by recursive step: Church’s analysis of effective calculability* Bulletin of Symbolic Logic, Volume 3, Number 2.

**Sm07** Peter Smith. 2007. *Church’s Thesis after 70 Years.* A commentary and critical review of *Church’s Thesis After 70 Years.** In Meinong Studies Vol 1 (Ontos Mathematical Logic 1), 2006 (2013), Eds. Adam Olszewski, Jan Wolenski, Robert Janusz. Ontos Verlag (Walter de Gruyter), Frankfurt, Germany.*

**Tu36** Alan Turing. 1936. *On computable numbers, with an application to the Entscheidungsproblem* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from the Proceedings of the London Mathematical Society, ser. 2. vol. 42 (1936-7), pp.230-265; corrections, Ibid, vol 43 (1937) pp. 544-546.

**An07** Bhupinder Singh Anand. 2007. *The Reasoner*, Vol(1)7 p2-3.

**An12** … 2012. *Evidence-Based Interpretations of PA.* In Proceedings of the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, 2-6 July 2012, University of Birmingham, Birmingham, UK.

**Notes**

Return to 2: Me90.

Return to 3: The terms `constructive’ and `constructive, and intuitionistically unobjectionable’ are used synonymously both in their familiar linguistic sense, and in a mathematically precise sense. Mathematically, we term a concept as `constructive, and intuitionistically unobjectionable’ if, and only if, it can be defined in terms of pre-existing concepts without inviting inconsistency. Otherwise, we understand it to mean unambiguously verifiable, by some `effective method’, within some finite, well-defined, language or meta-language. It may also be taken to correspond, broadly, to the concept of `constructive, and intuitionistically unobjectionable’ in the sense apparently intended by Gödel in his seminal 1931 paper Go31, p.26.

Return to 4: We note that the possibility of a distinction between the interpreted number-theoretic meta-assertions, `For any given natural number , is true’ and ` is true for all natural numbers ‘, is not evident unless these are expressed symbolically as, ` is true)’ and ` is true’, respectively. The issue, then, is whether the distinction can be given any mathematical significance. For instance, under a constructive formulation of Tarski’s definitions, we may qualify the latter by saying that it can be meaningfully asserted as a totality only if `‘ is a well-defined mathematical object.

Return to 5: Ka59.

Return to 6: Ka59.

Return to 7: Bringsjord notes that the original proof can be found on page 741 of Kleene Kl36.

Return to 8: We detail a formal proof of this Thesis in this post.

*
***So where exactly does the buck stop?**

Another reason why Lucas and Penrose should not be faulted for continuing to believe in their well-known Gödelian arguments against computationalism lies in the lack of an adequate consensus on the concept of `effective computability’.

For instance, Boolos, Burgess and Jeffrey (2003: Computability and Logic, 4th ed.~CUP, p37) define a diagonal *halting* function, , any value of which can be computed effectively, although there is no single algorithm that can effectively compute .

“According to Turing’s Thesis, since is not Turing-computable, cannot be effectively computable. Why not? After all, although no Turing machine computes the function , we were able to compute at least its first few values, For since, as we have noted, the empty function we have . And it may seem that we can actually compute for any positive integer —if we don’t run out of time.”

… ibid. 2003. p37.

Now, the straightforward way of expressing this phenomenon should be to say that there are well-defined real numbers that are instantiationally computable, but not algorithmically computable.

Yet, following Church and Turing, such functions are labeled as effectively uncomputable!

The issue here seems to be that, when using language to express the abstract objects of our individual, and common, mental `concept spaces’, we use the word `exists’ loosely in three senses, without making explicit distinctions between them.

First, we may mean that an individually conceivable object exists, within a language , if it lies within the range of the variables of . The existence of such objects is necessarily derived from the grammar, and rules of construction, of the appropriate constant terms of the language—generally finitary in recursively defined languages—and can be termed as constructive in by definition.

Second, we may mean that an individually conceivable object exists, under a formal interpretation of in another formal language, say **′**, if it lies within the range of a variable of under the interpretation.

Again, the existence of such an object in **′** is necessarily derivable from the grammar, and rules of construction, of the appropriate constant terms of **′**, and can be termed as constructive in **′** by definition.

Third, we may mean that an individually conceivable object exists, in an interpretation of , if it lies within the range of an interpreted variable of , where is a Platonic interpretation of in an individual’s subjective mental conception (in Brouwer’s sense).

Clearly, the debatable issue is the third case.

So the question is whether we can—and, if so, how we may—correspond the Platonically conceivable objects of various individual interpretations of , say , **′**, **′****′**, …, unambiguously to the mathematical objects that are definable as the constant terms of .

If we can achieve this, we can then attempt to relate to a common external world and try to communicate effectively about our individual mental concepts of the world that we accept as lying, by consensus, in a common, Platonic, `concept-space’.

For mathematical languages, such a common `concept-space’ is implicitly accepted as the collection of individual intuitive, Platonically conceivable, perceptions—, **′**, **′****′**, …,—of the standard intuitive interpretation, say , of Dedekind’s axiomatic formulation of the Peano Postulates.

Reasonably, if we intend a language or a set of languages to be adequate, first, for the expression of the abstract concepts of collective individual consciousnesses, and, second, for the unambiguous and effective communication of those of such concepts that we can accept as lying within our common concept-space, then we need to give effective guidelines for determining the Platonically conceivable mathematical objects of an individual perception of that we can agree upon, by common consensus, as corresponding to the constants (mathematical objects) definable within the language.

Now, in the case of mathematical languages in standard expositions of classical theory, this role is sought to be filled by the Church-Turing Thesis (CT). Its standard formulation postulates that every number-theoretic function (or relation, treated as a Boolean function) of , which can intuitively be termed as effectively computable, is partial recursive / Turing-computable.

However, CT does not succeed in its objective completely.

Thus, even if we accept CT, we still cannot conclude that we have specified explicitly that the domain of consists of only constructive mathematical objects that can be represented in the most basic of our formal mathematical languages, namely, first-order Peano Arithmetic (PA) and Recursive Arithmetic (RA).

The reason seems to be that CT is postulated as a strong identity, which, prima facie, goes beyond the minimum requirements for the correspondence between the Platonically conceivable mathematical objects of and those of PA and RA.

“We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers.”

… Church 1936: An unsolvable problem of elementary number theory, Am.~J.~Math., Vol.~58, pp.~345–363.

“The theorem that all effectively calculable sequences are computable and its converse are proved below in outline.

… Turing 1936: On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, ser.~2.~vol.~42 (1936–7), pp.~230–265.

This violation of the principle of Occam’s Razor is highlighted if we note (e.g., Gödel 1931: On undecidable propositions of Principia Mathematica and related systems I, Theorem VII) that, pedantically, every recursive function (or relation) is not shown as identical to a unique arithmetical function (or relation), but (*see the comment following Lemma 9 of this paper*) only as instantiationally equivalent to an infinity of arithmetical functions (or relations).

Now, the standard form of CT only postulates algorithmically computable number-theoretic functions of as effectively computable.

It overlooks the possibility that there may be number-theoretic functions and relations which are effectively computable / decidable instantiationally in a Tarskian sense, but not algorithmically.

**References**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic.* (4th ed). Cambridge University Press, Cambridge.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. pp.5-38.

**Lu61** John Randolph Lucas. 1961. *Minds, Machines and Gödel.* In *Philosophy.* Vol. 36, No. 137 (Apr. – Jul., 1961), pp. 112-127, Cambridge University Press.

**Lu03** John Randolph Lucas. 2003. *The Gödelian Argument: Turn Over the Page.* In Etica & Politica / Ethics & Politics, 2003, 1.

**Lu06** John Randolph Lucas. 2006. *Reason and Reality.* Edited by Charles Tandy. Ria University Press, Palo Alto, California.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand. pp.145-146.

**Pe90** Roger Penrose. 1990. *The Emperor’s New Mind: Concerning Computers, Minds and the Laws of Physics.* 1990, Vintage edition. Oxford University Press.

**Pe94** Roger Penrose. 1994. *Shadows of the Mind: A Search for the Missing Science of Consciousness.* Oxford University Press.

**Sc67** Joseph R. Schoenfield. 1967. *Mathematical Logic.* Reprinted 2001. A. K. Peters Ltd., Massachusetts.

**Ta33** Alfred Tarski. 1933. *The concept of truth in the languages of the deductive sciences.* In *Logic, Semantics, Metamathematics, papers from 1923 to 1938.* (p152-278). ed. John Corcoran. 1983. Hackett Publishing Company, Indianapolis.

**Wa63** Hao Wang. 1963. *A survey of Mathematical Logic.* North Holland Publishing Company, Amsterdam.

**An07a** Bhupinder Singh Anand. 2007. *The Mechanist’s challenge.* In *The Reasoner*, Vol(1)5 p5-6.

**An07b** … 2007. *Why we shouldn’t fault Lucas and Penrose for continuing to believe in the Gödelian argument against computationalism – I.* In *The Reasoner,* Vol(1)6 p3-4.

**An07c** … 2007. *The Reasoner*, Vol(1)7 p2-3.

**An08** … 2008. *Can we really falsify truth by dictat?.* In *The Reasoner*, Vol(2)1 p7-8.

**An12** … 2012. *Evidence-Based Interpretations of PA.* In *Proceedings* of the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, 2-6 July 2012, University of Birmingham, Birmingham, UK.

**A finitary arithmetical perspective on the forcing of non-standard models onto PA**

In the previous post we formally argued that the first order Peano Arithmetic PA is categorical from a finitary perspective (, Corollary 1).

We now argue that conventional wisdom which holds PA as essentially incomplete—and thus precludes categoricity—may appeal to finitarily fragile arguments (*as mentioned in this earlier post and in this preprint, now reproduced below*) for the existence of non-standard models of the first-order Peano Arithmetic PA.

Such wisdom ought, therefore, to be treated foundationally as equally fragile from a post-computationalist arithmetical perspective within classical logic, rather than accepted as foundationally sound relative to an ante-computationalist perspective of set theory.

**Post-computationalist doctrine**

“It is by now folklore … that one can view the *values* of a simple functional language as specifying *evidence* for propositions in a constructive logic …” (cf. Mu91).

** Introduction**

Once we accept as logically sound the set-theoretically based meta-argument ^{[1]} that the first-order Peano Arithmetic PA ^{[2]} can be forced—by an ante-computat- ionalist interpretation of the Compactness Theorem—into admitting non-standard models which contain an `infinite’ integer, then the set-theoretical properties ^{[3]} of the algebraic and arithmetical structures of such putative models should perhaps follow without serious foundational reservation.

**Compactness Theorem:** If every finite subset of a set of sentences has a model, then the whole set has a model (BBJ03. p.147).

However we shall argue that, from an arithmetical perspective, we can only conclude by the Compactness Theorem that if is the -theory of the standard model (interpretation) (Ka91, p.10-11), then we may consistently add to it the following as an additional—not necessarily independent—axiom:

.

Moreover, we shall argue that even though is algorithmically computable (Definition 2) as always true in the standard model (whence all of its instances are in ) we cannot conclude by the Compactness Theorem that:

is consistent and has a model which contains an `infinite’ integer ^{[4]}.

*Reason:* We shall argue that the condition in the above definition of requires, first of all, that we must be able to extend by the addition of a `relativised’ axiom (cf. Fe92; Me64, p.192) such as:

,

from which we may conclude the existence of some such that:

for all .

However, we shall further show that even this would not yield a model for since, by Theorem 1, we cannot introduce a `completed’ infinity such as into either or any model of !

** A post-computationalist doctrine**

More generally we shall argue that—if our interest is in the arithmetical properties of models of PA—then we first need to make explicit any appeal to non-constructive considerations such as Aristotle’s particularisation (Definition 3).

We shall then argue that, even from a classical perspective, there are serious foundational, post-computationalist, reservations to accepting that a consistent PA can be forced by the Compactness Theorem into admitting non-standard models which contain elements other than the natural numbers.

*Reason:* Any arithmetical application of the Compactness Theorem to PA can neither ignore currently accepted post-computationalist doctrines of objectivity—nor contradict the constructive assignments of satisfaction and truth to the atomic formulas of PA (therefore to the compound formulas under Tarski’s inductive definitions) in terms of either algorithmical verifiability or algorithmic computability (An12, ).

The significance of this doctrine ^{[5]} is that it helps highlight how the algorithmically verifiable (Definition 1) formulas of PA define the classical non-finitary standard interpretation of PA ^{[6]} (to which standard arguments for the existence of non-standard models of PA critically appeal).

Accordingly, we shall show that standard arguments which appeal to the ante-computationalist interpretation of the Compactness Theorem—for forcing non-standard models of PA ^{[7]} which contain an `infinite’ integer—cannot admit constructive assignments of satisfaction and truth ^{[8]} (in terms of algorithmical verifiability) to the atomic formulas of their putative extension of PA.

We shall conclude that such arguments therefore questionably postulate by axiomatic fiat that which they seek to `prove’!

** Standard arguments for non-standard models of PA**

In this limited investigation we shall consider only the following three standard arguments for the existence of non-standard models of the first-order Peano Arithmetic PA:

(*i*) If PA is consistent, then we obtain a non-standard model for PA which contains an `infinite’ integer by applying the Compactness Theorem to the union of the set of formulas that are satisfied or true in the classical `standard’ model of PA ^{[9]} and the countable set of all PA-formulas of the form .

(*ii*) If PA is consistent, then we obtain a non-standard model for PA which contains an `infinite’ integer by adding a constant to the language of PA and applying the Compactness Theorem to the theory **P**.

(*iii*) If PA is consistent, then we obtain a non-standard model for PA which contains an `infinite’ integer by adding the PA formula as an axiom to PA, where is a Gödelian formula ^{[10]} that is unprovable in PA, even though ] is provable in PA for any given PA numeral (Go31, p.25(1)).

We shall first argue that (*i*) and (*ii*)—which appeal to Thoralf Skolem’s ante-computationalist reasoning (in Sk34) for the existence of a non-standard model of PA—should be treated as foundationally fragile from a finitary, post-computationalist perspective within classical logic ^{[11]}.

We shall then argue that although (*iii*)—which appeals to Kurt Gödel’s (also ante-computationalist) reasoning (Go31) for the existence of a non-standard model of PA—does yield a model other than the classical `standard’ model of PA, we cannot conclude by even classical (albeit post-computationalist) reasoning that the domain is other than the domain of the natural numbers unless we make the non-constructive—and logically fragile—extraneous assumption that a consistent PA is necessarily -consistent.

(*-consistency*): A formal system S is -consistent if, and only if, there is no S-formula for which, first, is S-provable and, second, is S-provable for any given S-term .

** Algorithmically verifiable formulas and algorithmically computable formulas**

We begin by distinguishing between:

**Definition 1:** An atomic formula ^{[12]} of PA is algorithmically verifiable under an interpretation if, and only if, for any given numeral , there is an algorithm which can provide objective evidence (Mu91) for deciding the truth value of each formula in the finite sequence of PA formulas under the interpretation.

The concept is well-defined in the sense that the `algorithmic verifiability’ of the formulas of a formal language which contain logical constants can be inductively defined under an interpretation in terms of the `algorithmic verifiability’ of the interpretations of the atomic formulas of the language (An12).

We note further that the formulas of the first order Peano Arithmetic PA are decidable under the standard interpretation of PA over the domain of the natural numbers if, and only if, they are algorithmically verifiable under the interpretation ^{[13]}.

**Definition 2:** An atomic formula of PA is algorithmically computable under an interpretation if, and only if, there is an algorithm that can provide objective evidence for deciding the truth value of each formula in the denumerable sequence of PA formulas under the interpretation.

This concept too is well-defined in the sense that the `algorithmic computability’ of the formulas of a formal language which contain logical constants can also be inductively defined under an interpretation in terms of the `algorithmic computability’ of the interpretations of the atomic formulas of the language (An12).

We note further that the PA-formulas are decidable under an algorithmic interpretation of PA over if, and only if, they are algorithmically computable under the interpretation ^{[14]}.

Although we shall not appeal to the following in this paper, we note in passing that the foundational significance ^{[15]} of the distinction lies in the argument that:

**Lemma 1:** There are algorithmically verifiable number theoretical functions which are not algorithmically computable. ^{[16]}

**Proof:** Let denote the digit in the decimal expansion of a putatively given real number in the interval . By the definition of a real number as the limit of a Cauchy sequence of rationals, it follows that is an algorithmically verifiable number-theoretic function. Since every algorithmically computable real is countable (Tu36), Cantor’s diagonal argument (Kl52, pp.6-8) shows that there are real numbers that are not algorithmically computable. The Lemma follows.

** Making non-finitary assumptions explicit**

We next make explicit—and briefly review—a tacitly held fundamental tenet of classical logic which is unrestrictedly adopted as intuitively obvious by standard literature ^{[17]} that seeks to build upon the formal first-order predicate calculus FOL:

**Definition 3:** (*Aristotle’s particularisation*) This holds that from an assertion such as:

`It is not the case that: For any given , does not hold’,

usually denoted symbolically by `‘, we may always validly infer in the classical, Aristotlean, logic of predicates (HA28, pp.58-59) that:

`There exists an unspecified such that holds’,

usually denoted symbolically by `‘.

** The significance of Aristotle’s particularisation for the first-order predicate calculus**

Now we note that in a formal language the formula `‘ is an abbreviation for the formula `‘; and that the commonly accepted interpretation of this formula tacitly appeals to Aristotlean particularisation.

However, as L. E. J. Brouwer had noted in his seminal 1908 paper on the unreliability of logical principles (Br08), the commonly accepted interpretation of this formula is ambiguous if interpretation is intended over an infinite domain.

Brouwer essentially argued that, even supposing the formula `‘ of a formal Arithmetical language interprets as an arithmetical relation denoted by `‘, and the formula `‘ as the arithmetical proposition denoted by `‘, the formula `‘ need not interpret as the arithmetical proposition denoted by the usual abbreviation `‘; and that such postulation is invalid as a general logical principle in the absence of a means for constructing some putative object for which the proposition holds in the domain of the interpretation.

Hence we shall follow the convention that the assumption that `‘ is the intended interpretation of the formula `‘—which is essentially the assumption that Aristotle’s particularisation holds over the domain of the interpretation—must always be explicit.

** The significance of Aristotle’s particularisation for PA**

In order to avoid intuitionistic objections to his reasoning, Kurt Gödel introduced the syntactic property of -consistency ^{[18]} as an explicit assumption in his formal reasoning in his seminal 1931 paper on formally undecidable arithmetical propositions (Go31, p.23 and p.28).

Gödel explained at some length ^{[19]} that his reasons for introducing -consistency explicitly was to avoid appealing to the semantic concept of classical arithmetical truth in Aristotle’s logic of predicates (which presumes Aristotle’s particularisation).

The two concepts are meta-mathematically equivalent in the sense that, if PA is consistent, then PA is -consistent if, and only if, Aristotle’s particularisation holds under the standard interpretation of PA ^{[20]}.

** The ambiguity in admitting an `infinite’ constant**

We begin our consideration of standard arguments for the existence of non-standard models of PA which contain an `infinite’ integer by first highlighting and eliminating an ambiguity in the argument as it is usually found in standard texts ^{[21]}:

“**Corollary.** There is a non-standard model of **P** with domain the natural numbers in which the denotation of every nonlogical symbol is an arithmetical relation or function.

*Proof.* As in the proof of the existence of nonstandard models of arithmetic, add a constant to the language of arithmetic and apply the Compactness Theorem to the theory

**P** n:

to conclude that it has a model (necessarily infinite, since all models of **P** are). The denotations of in any such model will be a non-standard element, guaranteeing that the model is non-standard. Then apply the arithmetical Löwenheim-Skolem theorem to conclude that the model may be taken to have domain the natural numbers, and the denotations of all nonlogical symbols arithmetical.”

… BBJ03, p.306, Corollary 25.3.

** We cannot force PA to admit a transfinite ordinal**

The ambiguity lies in a possible interpretation of the symbol as a `completed’ infinity (such as Cantor’s first transfinite ordinal ) in the context of non-standard models of PA. To eliminate this possibility we establish trivially that, and briefly examine why:

**Theorem 1:** No model of PA can admit a transfinite ordinal under the standard interpretation of the classical logic FOL^{[22]}.

**Proof:** Let [] denote the PA-formula:

Since Aristotle’s particularisation is tacitly assumed under the standard interpretation of FOL, this translates in every model of PA, as:

If denotes an element in the domain of a model of PA, then either is 0, or is a `successor’.

Further, in every model of PA, if denotes the interpretation of []:

(a) is true;

(b) If is true, then is true.

Hence, by Gödel’s completeness theorem:

(c) PA proves ;

(d) PA proves .

*Gödel’s Completeness Theorem:* In any first-order predicate calculus, the theorems are precisely the logically valid well-formed formulas (*i. e. those that are true in every model of the calculus*).

Further, by Generalisation:

(e) PA proves ;

*Generalisation in PA:* [] follows from [].

Hence, by Induction:

(f) is provable in PA.

*Induction Axiom Schema of PA:* For any formula [] of PA:

[]

In other words, except 0, every element in the domain of any model of PA is a `successor’. Further, the standard PA axioms ensure that can only be a `successor’ of a unique element in any model of PA.

Since Cantor’s first limit ordinal is not the `successor’ of any ordinal in the sense required by the PA axioms, and since there are no infinitely descending sequences of ordinals (cf. Me64, p.261) in a model—if any—of a first order set theory such as ZF, the theorem follows.

** Why we cannot force PA to admit a transfinite ordinal**

Theorem 1 reflects the fact that we can define the usual order relation `‘ in PA so that every instance of the PA Axiom Schema of Finite Induction, such as, say:

(*i*) []

yields the weaker PA theorem:

(*ii*) []

Now, if we interpret PA without relativisation in ZF ^{[23]}— i.e., numerals as finite ordinals, [] as [], etc.— then (*ii*) always translates in ZF as a theorem:

(*iii*) []

However, (*i*) does not always translate similarly as a ZF-theorem, since the following is not necessarily provable in ZF:

(*iv*) []

*Example:* Define [] as `[]’.

We conclude that, whereas the language of ZF admits as a constant the first limit ordinal which would interpret in any putative model of ZF as the (`completed’ infinite) set of all finite ordinals:

**Corollary 1:** The language of PA admits of no constant that interprets in any model of PA as the set of all natural numbers.

We note that it is the non-logical Axiom Schema of Finite Induction of PA which does not allow us to introduce—contrary to what is suggested by standard texts ^{[24]}—an `actual’ (*or `completed’*) infinity disguised as an arbitrary constant (usually denoted by or ) into either the language, or a putative model, of PA ^{[25]}.

** Forcing PA to admit denumerable descending dense sequences**

The significance of Theorem 1 is seen in the next two arguments, which attempt to implicitly bypass the Theorem’s constraint by appeal to the Compactness Theorem for forcing a non-standard model onto PA ^{[26]}.

However, we argue in both cases that applying the Compactness Theorem constructively—even from a classical perspective—does not logically yield a non-standard model for PA with an `infinite’ integer as claimed ^{[27]}.

** An argument for a non-standard model of PA**

The first is the argument (Ln08, p.7) that we can define a non-standard model of PA with an infinite descending chain of successors, where the only non-successor is the null element :

1. Let (*the set of natural numbers*); (*equality*); (*the successor function*); (*the addition function*); (*the product function*); (*the null element*) be the structure that serves to define a model of PA, say .

2. Let T[] be the set of PA-formulas that are satisfied or true in .

3. The PA-provable formulas form a subset of T[].

4. Let be the countable set of all PA-formulas of the form , where the index is a natural number.

5. Let T be the union of and T[].

6. T[] plus any finite set of members of has a model, e.g., itself, since is a model of any finite descending chain of successors.

7. Consequently, by Compactness, T has a model; call it .

8. has an infinite descending sequence with respect to because it is a model of .

9. Since PA is a subset of T, is a non-standard model of PA.

** Why the argument in is logically fragile**

However if—as claimed in above— is a model of T[] plus any finite set of members of , and the PA term is well-defined for any given natural number , then:

All PA-formulas of the form are PA-provable,

is a proper sub-set of the PA-provable formulas, and

T is identically T[].

*Reason:* The argument cannot be that some PA-formula of the form is true in , but not PA-provable, as this would imply that if PA is consistent then PA+ has a model other than ; in other words, it would presume that which is sought to be proved, namely that PA has a non-standard model ^{[28]}!

Consequently, the postulated model of T in by `Compactness’ is the model that defines T[]. However, has no infinite descending sequence with respect to , even though it is a model of .

Hence the argument does not establish the existence of a non-standard model of PA with an infinite descending sequence with respect to the successor function .

** A formal argument for a non-standard model of PA**

The second is the more formal argument ^{[29]}:

“Let denote the complete -theory of the standard model, i.e. is the collection of all true -sentences. For each we let be the closed term of ; is just the constant symbol . We now expand our language by adding to it a new constant symbol , obtaining the new language , and consider the following -theory with axioms

(for each )

and

(for each )

This theory is consistent, for each finite fragment of it is contained in

for some , and clearly the -structure with domain and interpreted naturally, and interpreted by the integer , satisfies . Thus by the compactness theore is consistent and has a model . The first thing to note about is that

for all , and hence it contains an `infinite’ integer.”

** Why the argument in too is logically fragile**

We note again that, from an arithmetical perspective, any application of the Compactness Theorem to PA cannot ignore currently accepted computationalist doctrines of objectivity (cf. Mu91) and contradict the constructive assignment of satisfaction and truth to the atomic formulas of PA (therefore to the compound formulas under Tarski’s inductive definitions) in terms of either algorithmical verifiability or algorithmic computability (An12, ).

Accordingly, from an arithmetical perspective we can only conclude by the Compactness Theorem that if is the -theory of the standard model (interpretation), then we may consistently add to it the following as an additional—not necessarily independent—axiom:

.

Moreover, even though is algorithmically computable as always true in the standard model—whence all instances of it are also therefore in —we cannot conclude by the Compactness Theorem that is consistent and has a model which contains an `infinite’ integer.

*Reason:* The condition `‘ in requires, first of all, that we must be able to extend by the addition of a `relativised’ axiom (cf. Fe92; Me64, p.192) such as:

,

from which we may conclude the existence of some such that:

for all .

However, even this would not yield a model for since, by Theorem 1, we cannot introduce a `completed’ infinity such as into any model of !

As the argument stands, it seeks to violate finitarity by adding a new constant to the language of PA that is not definable in and, ipso facto, adding an atomic formula to PA whose satisfaction under any interpretation of PA is not algorithmically verifiable!

Since the atomic formulas of PA are algorithmically verifiable under the standard interpretation (An12, Corollary 2), the above conclusion too postulates that which it seeks to prove!

Moreover, the postulation would be false if were categorical.

Since must have a non-standard model if it is not categorical, we consider next whether we may conclude from Gödel’s incompleteness argument (in Go31) that any such model can have an `infinite’ integer.

** Gödel’s argument for a non-standard model of PA**

We begin by considering the Gödelian formula ^{[30]} which is unprovable in PA if PA is consistent, even though the formula is provable in a consistent PA for any given PA numeral .

Now, it follows from Gödel’s reasoning ^{[31]} that:

**Theorem 2:** If PA is consistent, then we may add the PA formula as an axiom to PA without inviting inconsistency.

**Theorem 3:** If PA is -consistent, then we may add the PA formula as an axiom to PA without inviting inconsistency.

Gödel concluded from this that:

**Corollary 2:** If PA is -consistent, then there are at least two distinctly different models of PA.

If we assume that a consistent PA is necessarily -consistent, then it follows that one of the two putative models postulated by Corollary 2 must contain elements other than the natural numbers.

We conclude that Gödel’s justification for the assumption that non-standard models of PA containing elements other than the natural numbers are logically feasible lies in his non-constructive—and logically fragile—assumption that a consistent PA is necessarily -consistent.

** Why Gödel’s assumption is logically fragile**

Now, whereas Gödel’s proof of Corollary 2 appeals to the non-constructive Aristotle’s particularisation, a constructive proof of the Corollary follows trivially from evidence-based interpretations of PA (An12).

*Reason:* Tarski’s inductive definitions allow us to provide *finitary* satisfaction and truth certificates to all atomic (and ipso facto to all compound) formulas of PA over the domain of the natural numbers in *two* essentially different ways:

(1) In terms of algorithmic verifiabilty (An12, ); and

(2) In terms of algorithmic computability (An12, ).

That there can be even one, let alone two, logically sound and finitary assignments of satisfaction and truth certificates to both the atomic and compound formulas of PA was hitherto unsuspected!

Moreover, neither the putative `algorithmically verifiable’ model, nor the `algorithmically computable’ model, of PA defined by these finitary satisfaction and truth assignments contains elements other than the natural numbers.

**(a) Any algorithmically verifiable model of PA is necessarily over **

For instance if, in the first case, we assume that the algorithmically verifiable atomic formulas of PA determine an algorithmically verifiable model of PA over the domain of the PA numerals, then such a putative model would be isomorphic to the standard model of PA over the domain of the natural numbers (An12, & , Corollary 2).

However, such a putative model of PA over would not be finitary since, if the formula were to interpret as true in it, then we could only conclude that, for any numeral , there is an algorithm which will finitarily certify the formula as true under an algorithmically verifiable interpretation in .

We could not conclude that there is a single algorithm which, for any numeral , will finitarily certify the formula as true under the algorithmically verifiable interpretation in .

Consequently, the PA Axiom Schema of Finite Induction would not interpret as true finitarily under the algorithmically verifiable interpretation of PA over the domain of the PA numerals.

Thus the algorithmically verifiable interpretation of PA would not define a finitary model of PA.

However, if we were to assume that the algorithmically verifiable interpretation of PA defines a non-finitary model of PA, then it would follow that:

PA is necessarily -consistent;

Aristotle’s particularisation holds over ; and

The `standard’ interpretation of PA also defines a non-finitary model of PA over .

**(b) The algorithmically computable interpretation of PA is over **

The second case is where the algorithmically computable atomic formulas of PA determine an algorithmically computable model of PA over the domain of the natural numbers (An12, & ).

The algorithmically computable model of PA is finitary since we can show that, if the formula interprets as true under it, then we may always conclude that there is a single algorithm which, for any numeral , will finitarily certify the formula as true in under the algorithmically computable interpretation.

Consequently we can show that all the PA axioms—including the Axiom Schema of Finite Induction—interpret finitarily as true in under the algorithmically computable interpretation of PA, and the PA Rules of Inference preserve such truth finitarily (An12, Theorem 4).

Thus the algorithmically computable interpretation of PA defines a finitary model of PA from which we may conclude that:

PA is consistent (An12, , Theorem 6).

** Why we cannot conclude that PA is necessarily -consistent**

By the way the above finitary interpretation (b) is defined under Tarski’s inductive definitions (An12, ), if a PA-formula interprets as true in the corresponding finitary model of PA, then there is an algorithm that provides a certificate for such truth for in ; whilst if interprets as false in the above finitary model of PA, then there is no algorithm that can provide such a truth certificate for in (An12, ).

Now, if there is no algorithm that can provide such a truth certificate for the Gödelian formula in , then we would have by definition first that the PA formula is true in the model, and second by Gödel’s reasoning that the formula is true in the model for any given numeral . Hence Aristotle’s particularisation would not hold in the model.

However, by definition if PA were -consistent then Aristotle’s particularisation must necessarily hold in every model of PA.

It follows that unless we can establish that there is some algorithm which can provide such a truth certificate for the Gödelian formula in , we cannot make the unqualified assumption—as Gödel appears to do—that a consistent PA is necessarily -consistent.

**Conclusion**

We have argued that standard arguments for the existence of non-standard models of the first-order Peano Arithmetic PA with domains other than the domain of the natural numbers should be treated as logically fragile even from within classical logic. In particular we have argued that although Gödel’s argument for the existence of a non-standard model of PA does yield a model of PA other than the classical non-finitary `standard’ model, we cannot conclude from it that the domain is other than the domain of the natural numbers unless we make the non-constructive—and logically fragile—assumption that a consistent PA is necessarily -consistent.

**References**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic* (4th ed). Cambridge University Press, Cambridge.

**Be59** Evert W. Beth. 1959. *The Foundations of Mathematics.* In *Studies in Logic and the Foundations of Mathematics.* Edited by L. E. J. Brouwer, E. W. Beth, A. Heyting. 1959. North Holland Publishing Company, Amsterdam.

**BF58** Paul Bernays and Abraham A. Fraenkel. 1958. *Axiomatic Set Theory* In *Studies in Logic and the Foundations of Mathematics.* Edited by L. E. J. Brouwer, E. W. Beth, A. Heyting. 1959. North Holland Publishing Company, Amsterdam.

**Bo00** Andrey I. Bovykin. 2000. *On order-types of models of arithmetic.* Thesis submitted to the University of Birmingham for the degree of Ph.D. in the Faculty of Science, School of Mathematics and Statistics, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, United Kingdom, 13 April 2000.

**Br08** L. E. J. Brouwer. 1908. *The Unreliability of the Logical Principles.* English translation in A. Heyting, Ed. *L. E. J. Brouwer: Collected Works 1: Philosophy and Foundations of Mathematics.* Amsterdam: North Holland / New York: American Elsevier (1975): pp.107-111.

**Co66** Paul J. Cohen. 1966. *Set Theory and the Continuum Hypothesis.* (Lecture notes given at Harvard University, Spring 1965) W. A. Benjamin, Inc., New York.

**Da82** Martin Davis. 1958. *Computability and Unsolvability.* 1982 ed. Dover Publications, Inc., New York.

**EC89** Richard L. Epstein, Walter A. Carnielli. 1989. *Computability: Computable Functions, Logic, and the Foundations of Mathematics.* Wadsworth & Brooks, California.

**Fe92** Solomon Feferman. 1992. *What rests on what: The proof-theoretic analysis of mathematics* Invited lecture, 15th International Wittgenstein Symposium: *Philosophy of Mathematics*, held in Kirchberg/Wechsel, Austria, 16-23 August 1992.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**HA28** David Hilbert & Wilhelm Ackermann. 1928. *Principles of Mathematical Logic.* Translation of the second edition of the *Grundzüge Der Theoretischen Logik.* 1928. Springer, Berlin. 1950. Chelsea Publishing Company, New York.

**Hi25** David Hilbert. 1925. *On the Infinite.* Text of an address delivered in Münster on 4th June 1925 at a meeting of the Westphalian Mathematical Society. In Jean van Heijenoort. 1967.Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**HP98** Petr Hájek and Pavel Pudlák. 1998. *Metamathematics of First-Order Arithmetic.* Volume 3 of *Perspectives in Mathematical Logic* Series, ISSN 0172-6641. Springer-Verlag, Berlin, 1998.

**Ka91** Richard Kaye. 1991. *Models of Peano Arithmetic.* Oxford Logic Guides, 15. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1991.

**Ka11** Richard Kaye. 2011. *Tennenbaum’s theorem for models of arithmetic.* In *Set Theory, Arithmetic, and Foundations of Mathematics.* Eds. Juliette Kennedy & Roman Kossak. Lecture Notes in Logic (No. 36). pp.66-79. Cambridge University Press, 2011. Cambridge Books Online. http://dx.doi.org/10.1017/CBO9780511910616.005.

**Kl52** Stephen Cole Kleene. 1952. *Introduction to Metamathematics.* North Holland Publishing Company, Amsterdam.

**Kn63** G. T. Kneebone. 1963. *Mathematical Logic and the Foundations of Mathematics: An Introductory Survey.* D. Van Norstrand Company Limited, London.

**Ko06** Roman Kossak and James H. Schmerl. 2006. *The structure of models of Peano arithmetic.* Oxford Logic Guides, 50. Oxford Science Publications. The Clarendon Press, Oxford University Press, Oxford, 2006.

**Li64** A. H. Lightstone. 1964. *The Axiomatic Method.* Prentice Hall, NJ.

**Ln08** Laureano Luna. 2008. *On non-standard models of Peano Arithmetic.* In *The Reasoner,* Vol(2)2 p7.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand, Princeton.

**Mu91.** Chetan R. Murthy. 1991. *An Evaluation Semantics for Classical Proofs.* Proceedings of Sixth IEEE Symposium on Logic in Computer Science, pp. 96-109, (also Cornell TR 91-1213), 1991.

**Nv64** P. S. Novikov. 1964. *Elements of Mathematical Logic.* Oliver & Boyd, Edinburgh and London.

**Qu63** Willard Van Orman Quine. 1963. *Set Theory and its Logic.* Harvard University Press, Cambridge, Massachusette.

**Rg87** Hartley Rogers Jr. 1987. *Theory of Recursive Functions and Effective Computability.* MIT Press, Cambridge, Massachusetts.

**Ro53** J. Barkley Rosser. 1953. *Logic for Mathematicians.* McGraw Hill, New York.

**Sh67** Joseph R. Shoenfield. 1967. *Mathematical Logic.* Reprinted 2001. A. K. Peters Ltd., Massachusetts.

**Sk28** Thoralf A. Skolem. 1928. *On Mathematical Logic.* Text of a lecture delivered on 22nd October 1928 before the Norwegian Mathematical Association. In Jean van Heijenoort. 1967. Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931* Harvard University Press, Cambridge, Massachusetts.

**Sk34** Thoralf A. Skolem. 1934. *\”{U}ber die Nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abz\”{a}hlbar unendlich vieler Aussagen mit ausschliesslich Zahlenvariablen.* Fundamenta Mathematicae, 23, 150-161. English version: *Peano’s axioms and models of arithmetic.* In *Mathematical interpretations of formal systems.* North Holland, Amsterdam, 1955, pp.1-14.

**Sm92** Raymond M. Smullyan. 1992. *Gödel’s Incompleteness Theorems.* Oxford University Press, Inc., New York.

**Su60** Patrick Suppes. 1960. *Axiomatic Set Theory.* Van Norstrand, Princeton.

**Tu36** Alan Turing. 1936. *On computable numbers, with an application to the Entscheidungsproblem* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from the Proceedings of the London Mathematical Society, ser. 2. vol. 42 (1936-7), pp.230-265; corrections, Ibid, vol 43 (1937) pp. 544-546.

**Wa63** Hao Wang. 1963. *A survey of Mathematical Logic.* North Holland Publishing Company, Amsterdam.

**An12** Bhupinder Singh Anand. 2012. *Evidence-Based Interpretations of PA.* In Proceedings of the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, 2-6 July 2012, University of Birmingham, Birmingham, UK.

**An13** … 2013. *A suggested mathematical perspective for the argument.* Presented on 7’th April at the workshop on `*Logical Quantum Structures*‘ at UNILOG’2013, World Congress and School on Universal Logic, March 2013 – April 2013, Rio de Janeiro, Brazil.

**Notes**

Return to 1: By which we mean arguments such as in Ka91 (see pg.1), where the meta-theory is taken to be a set-theory such as ZF or ZFC, and the logical consistency of the meta-theory is not considered relevant to the argumentation.

Return to 2: For purposes of this investigation we may take this to be a first order theory such as the theory S defined in Me64, pp.102-103.

Return to 3: eg. Ka91; Bo00; BBJ03,\ ch.25,\ p.302; Ko06; Ka11.

Return to 4: As argued in Ka91, p.10-11.

Return to 5: Some of the—hitherto unsuspected—consequences of this doctrine are detailed in An12.

Return to 6: An12, Corollary 2; `non-finitary’ because the Axiom Schema of Finite Induction *cannot* be finitarily verified as true under the standard interpretation of PA with respect to `truth’ as defined by the algorithmically verifiable formulas of PA.

Return to 7: eg., BBJ03, p.155, Lemma 13.3 (Model existence lemma).

Return to 8: cf. The standard non-constructive set-theoretical assignment-by-postulation **(S5)** of the satisfaction properties **(S1)** to **(S8)** in BBJ03, p.153, Lemma 13.1 (Satisfaction properties lemma), which appeals critically to Aristotle’s particularisation.

Return to 9: For purposes of this investigation we may take this to be an interpretation of PA as defined in Me64, p.107.

Return to 10: In his seminal 1931 paper Go31, Kurt Gödel defines, and refers to, the formula corresponding to only by its `Gödel’ number (op. cit., p.25, Eqn.(12)), and to the formula corresponding to only by its `Gödel’ number .

Return to 11: By `classical logic’ we mean the standard first-order predicate calculus FOL where we neither deny the Law of the Excludeds Middle, nor assume that the FOL is -consistent (i.e., we do not assume that Aristotle’s particularisation must hold under any interpretation of the logic).

Return to 12: *Notation*: For the sake of convenience, we shall use square brackets to indicate that the expression enclosed by them is to be treated as denoting a formula of a formal theory, and not as denoting an interpretation.

Return to 13: However, as noted earlier, the Axiom Schema of Finite Induction *cannot* be finitarily verified as true under the standard interpretation of PA with respect to `truth’ as defined by the algorithmically verifiable formulas of PA .

Return to 14: In this case however, the Axiom Schema of Finite Induction *can* be finitarily verified as true under the standard interpretation of PA with respect to `truth’ as defined by the algorithmically computable formulas of PA (An12, Theorem 4).

Return to 15: The far reaching—hitherto unsuspected—consequences of this distinction for PA are detailed in An12.

Return to 16: We note that algorithmic computability implies the existence of an algorithm that can decide the truth/falsity of each proposition in a well-defined denumerable sequence of propositions, whereas algorithmic verifiability does not imply the existence of an algorithm that can decide the truth/falsity of each proposition in a well-defined denumerable sequence of propositions. From the point of view of a finitary mathematical philosophy, the significant difference between the two concepts could be expressed (An13) by saying that we may treat the decimal representation of a real number as corresponding to a physically measurable limit—and not only to a mathematically definable limit—if and only if such representation is definable by an algorithmically computable function.

Return to 17: See Hi25, p.382; HA28, p.48; Sk28, p.515; Go31, p.32.; Kl52, p.169; Ro53, p.90; BF58, p.46; Be59, pp.178 & 218; Su60, p.3; Wa63, p.314-315; Qu63, pp.12-13; Kn63, p.60; Co66, p.4; Me64, pp.45, 47, 52(ii), 214(fn); Nv64, p.92; Li64, p.33; Sh67, p.13; Da82, p.xxv; Rg87, p.xvii; EC89, p.174; Mu91; Sm92, p.18, Ex.3; BBJ03, p.102.

Return to 18: The significance of -consistency for the formal system PA is highlighted inAn12.

Return to 19: In his introduction on p.9 of Go31.

Return to 20: For details see An12.

Return to 21: cf. HP98, p.13, ; Me64, p.112, Ex. 2.

Return to 22: For purposes of this investigation we may take this to be the first order predicate calculus as defined in Me64, p.57.

Return to 23: In the sense indicated by Feferman Fe92.

Return to 24: eg. HP98, p.13, ; Ka91, p.11 & p.12, fig.1; BBJ03. p.306, Corollary 25.3; Me64, p.112, Ex. 2.

Return to 25: A possible reason why the Axiom Schema of Finite Induction does not admit non-finitary reasoning into either PA, or into any model of PA, is suggested in below.

Return to 26: eg. Ln08, p.7; Ka91, pp.10-11, p.74 & p.75, Theorem 6.4.

Return to 27: And as suggested also by standard texts in such cases; eg. BBJ03. p.306, Corollary 25.3; Me64, p.112, Ex. 2.

Return to 28: To place this distinction in perspective, Adrien-Marie Legendre and Carl Friedrich Gauss independently conjectured in 1796 that, if denotes the number of primes less than , then is asymptotically equivalent to /In. Between 1848/1850, Pafnuty Lvovich Chebyshev confirmed that if /(/In) has a limit, then it must be 1. However, the crucial question of whether /(/In) has a limit at all was answered in the affirmative using analytic methods independently by Jacques Hadamard and Charles Jean de la Vallée Poussin only in 1896, and using only elementary methods by Atle Selberg and Paul Erdös in 1949.

Return to 29: Ka91, pp.10-11; attributed as essentially Skolem’s argument in Sk34.

Return to 30: In his seminal 1931 paper Go31, Kurt Gödel defines, and refers to, the formula corresponding to only by its `Gödel’ number (op. cit., p.25, Eqn.(12)), and to the formula corresponding to only by its `Gödel’ number .

Return to 31: Go31, p.25(1) & p.25(2).

** The Holy Grail of Arithmetic: Bridging Provability and Computability**

*See also this update.*

**Peter Wegner and Dina Goldin**

In a short opinion paper, `Computation Beyond Turing Machines‘, Computer Scientists Peter Wegner and Dina Goldin (Wg03) advanced the thesis that:

`A paradigm shift is necessary in our notion of computational problem solving, so it can provide a complete model for the services of today’s computing systems and software agents.’

We note that Wegner and Goldin’s arguments, in support of their thesis, seem to reflect an extraordinarily eclectic view of mathematics, combining both an implicit acceptance of, and implicit frustration at, the standard interpretations and dogmas of classical mathematical theory:

(i) `… Turing machines are inappropriate as a universal foundation for computational problem solving, and … computer science is a fundamentally non-mathematical discipline.’

(ii) `(Turing’s) 1936 paper … proved that mathematics could not be completely modeled by computers.’

(iii) `… the Church-Turing Thesis … equated logic, lambda calculus, Turing machines, and algorithmic computing as equivalent mechanisms of problem solving.’

(iv) `Turing implied in his 1936 paper that Turing machines … could not provide a model for all forms of mathematics.’

(v) `… Gödel had shown in 1931 that logic cannot model mathematics … and Turing showed that neither logic nor algorithms can completely model computing and human thought.’

These remarks vividly illustrate the dilemma with which not only Theoretical Computer Sciences, but all applied sciences that depend on mathematics—for providing a verifiable language to express their observations precisely—are faced:

**Query:** Are formal classical theories essentially unable to adequately express the extent and range of human cognition, or does the problem lie in the way formal theories are classically interpreted at the moment?

The former addresses the question of whether there are absolute limits on our capacity to express human cognition unambiguously; the latter, whether there are only temporal limits—not necessarily absolute—to the capacity of classical interpretations to communicate unambiguously that which we intended to capture within our formal expression.

Prima facie, applied science continues, perforce, to interpret mathematical concepts Platonically, whilst waiting for mathematics to provide suitable, and hopefully reliable, answers as to how best it may faithfully express its observations verifiably.

**Lance Fortnow**

This dilemma is also reflected in Computer Scientist Lance Fortnow’s on-line rebuttal of Wegner and Goldin’s thesis, and of their reasoning.

Thus Fortnow divides his faith between the standard interpretations of classical mathematics (and, possibly, the standard set-theoretical models of formal systems such as standard Peano Arithmetic), and the classical computational theory of Turing machines.

He relies on the former to provide all the proofs that matter:

`Not every mathematical statement has a logical proof, but logic does capture everything we can prove in mathematics, which is really what matters’;

and, on the latter to take care of all essential, non-provable, truth:

`… what we can compute is what computer science is all about’.

**Can faith alone suffice?**

However, as we shall argue in a subsequent post, Fortnow’s faith in a classical Church-Turing Thesis that ensures:

`… Turing machines capture everything we can compute’,

may be as misplaced as his faith in the infallibility of standard interpretations of classical mathematics.

*The reason:* There are, prima facie, reasonably strong arguments for a Kuhnian (Ku62) paradigm shift; not, as Wegner and Goldin believe, in the notion of computational problem solving, but in the standard interpretations of classical mathematical concepts.

However, Wegner and Goldin could be right in arguing that the direction of such a shift must be towards the incorporation of non-algorithmic effective methods into classical mathematical theory (as detailed in the Birmingham paper); presuming, from the following remarks, that this is, indeed, what `external interactions’ are assumed to provide beyond classical Turing-computability:

(vi) `… that Turing machine models could completely describe all forms of computation … contradicted Turing’s assertion that Turing machines could only formalize algorithmic problem solving … and became a dogmatic principle of the theory of computation’.

(vii) `… interaction between the program and the world (environment) that takes place during the computation plays a key role that cannot be replaced by any set of inputs determined prior to the computation’.

(viii) `… a theory of concurrency and interaction requires a new conceptual framework, not just a refinement of what we find natural for sequential [algorithmic] computing’.

(ix) `… the assumption that all of computation can be algorithmically specified is still widely accepted’.

A widespread notion of particular interest, which seems to be recurrently implicit in Wegner and Goldin’s assertions too, is that mathematics is a dispensable tool of science, rather than its indispensable mother tongue.

**Elliott Mendelson**

However, the roots of such beliefs may also lie in ambiguities, in the classical definitions of foundational elements, that allow the introduction of non-constructive—hence non-verifiable, non-computational, ambiguous, and essentially Platonic—elements into the standard interpretations of classical mathematics.

For instance, in a 1990 philosophical reflection, Elliott Mendelson’s following remarks (in Me90; reproduced from Selmer Bringsjord (Br93)), implicitly imply that classical definitions of various foundational elements can be argued as being either ambiguous, or non-constructive, or both:

`Here is the main conclusion I wish to draw: it is completely unwarranted to say that CT is unprovable just because it states an equivalence between a vague, imprecise notion (effectively computable function) and a precise mathematical notion (partial-recursive function). … The concepts and assumptions that support the notion of partial-recursive function are, in an essential way, no less vague and imprecise than the notion of effectively computable function; the former are just more familiar and are part of a respectable theory with connections to other parts of logic and mathematics. (The notion of effectively computable function could have been incorporated into an axiomatic presentation of classical mathematics, but the acceptance of CT made this unnecessary.) … Functions are defined in terms of sets, but the concept of set is no clearer than that of function and a foundation of mathematics can be based on a theory using function as primitive notion instead of set. Tarski’s definition of truth is formulated in set-theoretic terms, but the notion of set is no clearer than that of truth. The model-theoretic definition of logical validity is based ultimately on set theory, the foundations of which are no clearer than our intuitive understanding of logical validity. … The notion of Turing-computable function is no clearer than, nor more mathematically useful (foundationally speaking) than, the notion of an effectively computable function.’

Consequently, standard interpretations of classical theory may, inadvertently, be weakening a desirable perception—of mathematics as the lingua franca of scientific expression—by ignoring the possibility that, since mathematics is, indeed, indisputably accepted as the language that most effectively expresses and communicates intuitive truth, the chasm between formal truth and provability must, of necessity, be bridgeable.

**Cristian Calude, Elena Calude and Solomon Marcus**

The belief in the existence of such a bridge is occasionally implicit in interpretations of computational theory.

For instance, in an arXived paper *Passages of Proof*, Computer Scientists Cristian Calude, Elena Calude and Solomon Marcus remark that:

“Classically, there are two equivalent ways to look at the mathematical notion of proof: logical, as a finite sequence of sentences strictly obeying some axioms and inference rules, and computational, as a specific type of computation. Indeed, from a proof given as a sequence of sentences one can easily construct a Turing machine producing that sequence as the result of some finite computation and, conversely, given a machine computing a proof we can just print all sentences produced during the computation and arrange them into a sequence.”

In other words, the authors seem to hold that Turing-computability of a `proof’, in the case of an arithmetical proposition, is equivalent to provability of its representation in PA.

**Wilfrid Sieg**

We now attempt to build such a bridge formally, which is essentially one between the arithmetical ‘Decidability and Calculability’ described by Philosopher Wilfrid Sieg in his in-depth and wide-ranging survey ‘On Comptability‘, in which he addresses Gödel’s lifelong belief that an iff bridge between the two concepts is ‘impossible’ for ‘the whole calculus of predicates’ (Wi08, p.602).

** Bridging provability and computability: The foundations**

In the paper titled “Evidence-Based Interpretations of ” that was presented to the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, held from to July 2012 at the University of Birmingham, UK (reproduced in this post) we have defined what it means for a number-theoretic function to be:

(i) Algorithmically verifiable;

(ii) Algorithmically computable.

We have shown there that:

(i) The standard interpretation of the first order Peano Arithmetic PA is finitarily sound if, and only if, Aristotle’s particularisation holds over ; and the latter is the case if, and only if, PA is -consistent.

(ii) We can define a finitarily sound algorithmic interpretation of PA over the domain where, if is an atomic formula of PA, then the sequence of natural numbers satisfies if, and only if is algorithmically computable under , but we do not presume that Aristotle’s particularisation is valid over .

(iii) The axioms of PA are always true under the finitary interpretation , and the rules of inference of PA preserve the properties of satisfaction/truth under .

We concluded that:

**Theorem 1:** The interpretation of PA is finitarily sound.

**Theorem 2:** PA is consistent.

** Extending Buss’ Bounded Arithmetic**

One of the more significant consequences of the Birmingham paper is that we can extend the iff bridge between the domain of provability and that of computability envisaged under Buss’ Bounded Arithmetic by showing that an arithmetical formula is PA-provable if, and only if, interprets as true under an algorithmic interpretation of PA.

** A Provability Theorem for PA**

We first show that PA can have no non-standard model (for a distinctly different proof of this convention-challenging thesis see this post and this paper), since it is `algorithmically’ complete in the sense that:

**Theorem 3:** (*Provability Theorem for PA*) A PA formula is PA-provable if, and only if, is algorithmically computable as always true in .

**Proof:** We have by definition that interprets as true under the interpretation if, and only if, is algorithmically computable as always true in .

Since is finitarily sound, it defines a finitary model of PA over —say —such that:

If is PA-provable, then is algorithmically computable as always true in ;

If is PA-provable, then it is not the case that is algorithmically computable as always true in .

Now, we cannot have that both and are PA-unprovable for some PA formula , as this would yield the contradiction:

(i) There is a finitary model—say —of PA+ in which is algorithmically computable as always true in .

(ii) There is a finitary model—say —of PA+ in which it is not the case that is algorithmically computable as always true in

The lemma follows.

** The holy grail of arithmetic**

We thus have that:

**Corollary 1:** PA is categorical finitarily.

Now we note that:

**Lemma 2:** If PA has a sound interpretation over , then there is a PA formula which is algorithmically verifiable as always true over under even though is not PA-provable.

**Proof** In his seminal 1931 paper on formally undecidable arithmetical propositions, Kurt Gödel has shown how to construct an arithmetical formula with a single variable—say ^{[1]}—such that is not PA-provable ^{[2]}, but is instantiationally PA-provable for any given PA numeral . Hence, for any given numeral , the PA formula must hold for some . The lemma follows.

By the argument in Theorem 3 it follows that:

**Corollary 2:** The PA formula defined in Lemma 2 is PA-provable.

**Corollary 3:** Under any sound interpretation of PA, Gödel’s interprets as an algorithmically verifiable, but not algorithmically computable, tautology over .

**Proof** Gödel has shown that ^{[3]} interprets as an algorithmically verifiable tautology ^{[4]}. By Corollary 2 is not algorithmically computable as always true in .

**Corollary 4:** PA is *not* -consistent. ^{[5]}

**Proof** Gödel has shown that if PA is consistent, then is PA-provable for any given PA numeral ^{[6]}. By Corollary 2 and the definition of -consistency, if PA is consistent then it is *not* -consistent.

**Corollary 5:** The standard interpretation of PA is not finitarily sound, and does not yield a finitary model of PA ^{[7]}.

**Proof** If PA is consistent but not -consistent, then Aristotle’s particularisation does not hold over . Since the `standard’, interpretation of PA appeals to Aristotle’s particularisation, the lemma follows.

Since formal quantification is currently interpreted in classical logic ^{[8]} so as to admit Aristotle’s particularisation over as axiomatic ^{[9]}, the above suggests that we may need to review number-theoretic arguments ^{[10]} that appeal unrestrictedly to classical Aristotlean logic.

** The Provability Theorem for PA and Bounded Arithmetic**

In a 1997 paper ^{[11]}, Samuel R. Buss considered Bounded Arithmetics obtained by:

(a) limiting the applicability of the Induction Axiom Schema in PA only to functions with quantifiers bounded by an unspecified natural number bound ;

(b) `weakening’ the statement of the axiom with the aim of differentiating between effective computability over the sequence of natural numbers, and feasible `polynomial-time’ computability over a bounded sequence of the natural numbers ^{[12]}.

Presumably Buss’ intent—as expressed below—is to build an iff bridge between provability in a Bounded Arithmetic and Computability so that a formula, say , is provable in the Bounded Arithmetic if, and only if, there is an algorithm that, for any given numeral , decides the formula as `true’:

If is provable, then there should be an algorithm to find as a function of ^{[13]}.

Since we have proven such a Provability Theorem for PA in the previous section, the first question arises:

** Does the introduction of bounded quantifiers yield any computational advantage?**

Now, one difference ^{[14]} between a Bounded Arithmetic and PA is that we can presume in the Bounded Arithmetic that, from a proof of , we may always conclude that there is some numeral such that is provable in the arithmetic; however, this is not a finitarily sound conclusion in PA.

*Reason:* Since is simply a shorthand for , such a presumption implies that Aristotle’s particularisation holds over the natural numbers under any finitarily sound interpretation of PA.

To see that (as Brouwer steadfastly held) this may not always be the case, interpret as ^{[15]}:

There is an algorithm that decides as `true’ for any given numeral .

In such case, if is provable in PA, then we can only conclude that:

There is an algorithm that, for any given numeral , decides that it is not the case that there is an algorithm that, for any given numeral , decides as `true’.

We cannot, however, conclude—as we can in a Bounded Arithmetic—that:

There is an algorithm that, for any given numeral , decides that there is an algorithm that, for some numeral , decides as `true’.

*Reason:* may be a Halting-type formula for some numeral .

This could be the case if were PA-*un*provable, but PA-provable for any given numeral .

Presumably it is the belief that any finitarily sound interpretation of PA requires Aristotle’s particularisation to hold in , and the recognition that the latter does not admit linking provability to computability in PA, which has led to considering the effect of bounding quantification in PA.

However, as we have seen in the preceding sections, we are able to link provability to computability through the Provability Theorem for PA by recognising precisely that, to the contrary, any interpretation of PA which requires Aristotle’s particularisation to hold in cannot be finitarily sound!

The postulation of an unspecified bound in a Bounded Arithmetic in order to arrive at a provability-computability link thus appears dispensible.

The question then arises:

** Does `weakening’ the PA Induction Axiom Schema yield any computational advantage?**

Now, Buss considers a bounded arithmetic which is, essentially, PA with the following `weakened’ Induction Axiom Schema, PIND ^{[16]}:

However, PIND can be expressed in first-order Peano Arithmetic PA as follows:

.

Moreover, the above is a particular case of PIND():

.

Now we have the PA theorem:

It follows that the following is also a PA theorem:

In other words, for any numeral , PIND() is equivalent in PA to the standard Induction Axiom of PA!

Thus, the Provability Theorem for PA suggests that all arguments and conclusions of a Bounded Arithmetic can be reflected in PA without any loss of generality.

**References**

**Br93** Selmer Bringsjord 1993. *The Narrational Case Against Church’s Thesis.* Easter APA meetings, Atlanta.

**Br08** L. E. J. Brouwer. 1908. *The Unreliability of the Logical Principles.* English translation in A. Heyting, Ed. *L. E. J. Brouwer: Collected Works 1: Philosophy and Foundations of Mathematics.* Amsterdam: North Holland / New York: American Elsevier (1975): pp.107-111.

**Bu97** Samuel R. Buss. 1997. *Bounded Arithmetic and Propositional Proof Complexity.* In *Logic of Computation.* pp.67-122. Ed. H. Schwichtenberg. Springer-Verlag, Berlin.

**CCS01** Cristian S. Calude, Elena Calude and Solomon Marcus. 2001. *Passages of Proof.* Workshop, Annual Conference of the Australasian Association of Philosophy (New Zealand Division), Auckland. Archived at: http://arxiv.org/pdf/math/0305213.pdf. Also in EATCS Bulletin, Number 84, October 2004, viii+258 pp.

**Da82** Martin Davis. 1958. *Computability and Unsolvability.* 1982 ed. Dover Publications, Inc., New York.

**EC89** Richard L. Epstein, Walter A. Carnielli. 1989. *Computability: Computable Functions, Logic, and the Foundations of Mathematics.* Wadsworth & Brooks, California.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**HA28** David Hilbert & Wilhelm Ackermann. 1928. *Principles of Mathematical Logic.* Translation of the second edition of the *Grundzüge Der Theoretischen Logik.* 1928. Springer, Berlin. 1950. Chelsea Publishing Company, New York.

**He04** Catherine Christer-Hennix. 2004. *Some remarks on Finitistic Model Theory, Ultra-Intuitionism and the main problem of the Foundation of Mathematics.* ILLC Seminar, 2nd April 2004, Amsterdam.

**Hi25** David Hilbert. 1925. *On the Infinite.* Text of an address delivered in Münster on 4th June 1925 at a meeting of the Westphalian Mathematical Society. In Jean van Heijenoort. 1967.Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**Ku62** Thomas S. Kuhn. 1962. *The structure of Scientific Revolutions.* 2nd Ed. 1970. University of Chicago Press, Chicago.

**Me90** Elliott Mendelson. 1990. *Second Thoughts About Church’s Thesis and Mathematical Proofs.* In *Journal of Philosophy* 87.5.

**Pa71** Rohit Parikh. 1971. *Existence and Feasibility in Arithmetic.* In *The Journal of Symbolic Logic,>i> Vol.36, No. 3 (Sep., 1971), pp. 494-508.*

**Rg87** Hartley Rogers Jr. 1987. *Theory of Recursive Functions and Effective Computability.* MIT Press, Cambridge, Massachusetts.

**Ro36** J. Barkley Rosser. 1936. *Extensions of some Theorems of Gödel and Church.* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from *The Journal of Symbolic Logic.* Vol.1. pp.87-91.

**Si08** Wilfrid Sieg. 2008. *On Computability* in *Handbook of the Philosophy of Science. Philosophy of Mathematics.* pp.525-621. Volume Editor: Andrew Irvine. General Editors: Dov M. Gabbay, Paul Thagard and John Woods. Elsevier BV. 2008.

**WG03** Peter Wegner and Dina Goldin. 2003. *Computation Beyond Turing Machines.* Communications of the ACM, 46 (4) 2003.

**Notes**

Return to 1: Gödel refers to this formula only by its Gödel number (Go31, p.25(12)).

Return to 2: Gödel’s immediate aim in Go31 was to show that is not P-provable; by Generalisation it follows, however, that is also not P-provable.

Return to 3: Gödel refers to this formula only by its Gödel number (Go31, p.25, eqn.12).

Return to 4: Go31, p.26(2): “ holds”.

Return to 5: This conclusion is contrary to accepted dogma. See, for instance, Davis’ remarks in Da82, p.129(iii) that:

“… there is no equivocation. Either an adequate arithmetical logic is -inconsistent (in which case it is possible to prove false statements within it) or it has an unsolvable decision problem and is subject to the limitations of Gödel’s incompleteness theorem”.

Return to 6: Go31, p.26(2).

Return to 7: I note that finitists of all hues—ranging from Brouwer Br08 to Alexander Yessenin-Volpin He04—have persistently questioned the finitary soundness of the `standard’ interpretation .

Return to 8: See Hi25, p.382; HA28, p.48; Be59, pp.178 \& 218.

Return to 9: In the sense of being intuitively obvious. See, for instance, Da82, p.xxiv; Rg87, p.308 (1)-(4); EC89, p.174 (4); BBJ03, p.102.

Return to 10: For instance Rosser’s construction of an undecidable arithmetical proposition in PA (see Ro36)—which does not explicitly assume that PA is -consistent—implicitly presumes that Aristotle’s particularisation holds over .

Return to 11: Bu97.

Return to 12: See also Pa71.

Return to 13: See Bu97.

Return to 14: We suspect the only one.

Return to 15: We have seen in the earlier sections that such an interpretation is finitarily sound.

Return to 16: Where denotes the largest natural number lower bound of the rational .

**Evidence-Based Interpretations of PA**

In July 2012 I presented a paper titled “Evidence-Based Interpretations of ” to the Symposium on Computational Philosophy at the AISB/IACAP World Congress 2012-Alan Turing 2012, held from to July 2012 at the University of Birmingham, UK.

The title was accurate pedantically, but deliberately misleading!

‘*Misleading*‘ because—had I kept the interest of the audience paramount—the more appropriate title should have been the provocative claim:

‘A solution to the Second of Hilbert’s Twenty Three Problems‘.

‘*Deliberately*‘ because whether or not the argumentation of the paper did lead to a finitary proof of consistency for seemed, by itself, of little mathematical interest or consequence.

*Reason:* Because what did seem mathematically significant, however, was a distinction upon which the argumentation rested—between the use of algorithmic computability and algorithmic verifiabilty for logical validity—which had hitherto remained implicit.

*Why the deception?* Well, partly because caution was understandably advised, but to a larger extent because we know that either has a sound interpretation, or it is inconsistent.

Now if—following David Hilbert’s line of reasoning in the Second of his celebrated Twenty Three problems—we embrace the former (since the latter seems `*u-u-u-un-un-un-unthinkable*‘), then we must believe either that assignment of unique truth values to the formulas under any sound interpretation of is essentially human-intelligence subjective (eerily akin to a human revelation), or that there must be an objective such assignment that does not depend upon some unique way in which a human intelligence perceives and reasons.

The point of the conference paper was to highlight that the standard interpretation of does not address this issue, since it is silent on the methodology for such an assignment.

essentially asserts that, under Tarski’s inductive definitions of the satisfaction and truth of the formulas of under the interpretation, if there is a methodology for uniquely defining the satisfaction and truth of the *atomic* formulas of (presumably in a way that can be taken to mirror our—i.e. humankind’s—intuitive notion of the truth of the corresponding arithmetical propositions), then the satisfaction and truth of the *compound* PA formulas are defined uniquely under the interpretation by induction (and may also be taken to mirror our intuitive notion of the truth of the corresponding arithmetical propositions).

The consequences of not specifying a methodology are actually best illustrated by this example (in the borrowed terminology of a correspondent):

Let mean that there is an assignment which provides objective evidence (o.e.) for . It seems breaks down in the general treatment of conditionals . In order to have , we need to have an assignment which, first of all decides whether and, if it verifies that, then verifies . But to decide whether we have to decide whether or not there is an assignment that provides o.e. for , and that can’t be done in general under in the absence of a methodology for assigning objective satisfaction and truth values to the atomic formulas of .

The aim of the Birmingham paper (reproduced below) was to bridge this gap.

We formally showed there that there are, indeed, two essentially different methods of constructively assigning objective truth values uniquely to the *atomic* formulas of .

We then argued that if Tarski’s definitions are further accepted as inductively determining unique satisfaction and truth values for the *compound* formulas of , then we arrive at two interpretations of , say and .

We showed that is sound if, and only if, is sound; whence the latter, if sound, can indeed be taken to mirror our intuitive notion of the truth of the corresponding arithmetical propositions over the structure of the natural numbers as intended.

However, this interpretation is not finitary since the Axiom Schema of Finite Induction *is not* justified finitarily under the interpretation.

We further showed that is sound if, and only if, is -consistent; which illuminates Gödel’s undecidability Theorem (if is -consistent, it must have a formally undecidable proposition).

We then argued that the other interpretation is sound since the Axiom Schema of Finite Induction *is* justified finitarily under the interpretation.

However, what interpretation can be taken to mirror is only the algorithmic decidability of our intuitive notion of the truth of the corresponding arithmetical propositions!

In other words, arithmetical provability can be taken to correspond not to our intuitive notion of arithmetical truth (which is subjective), but to the algorithmic decidability of our intuitive notion of arithmetical truth (which is objective).

**Abstract**

We shall now show formally that Tarski’s inductive definitions admit evidence-based interpretations of the first-order Peano Arithmetic PA that allow us to define the satisfaction and truth of the quantified formulas of PA *constructively* over the domain of the natural numbers in *two* essentially different ways:

(1) in terms of algorithmic verifiabilty; and

(2) in terms of algorithmic computability.

We shall argue that the algorithmically computable PA-formulas *can* provide a finitary interpretation of PA over the domain of the natural numbers from which we may conclude that PA is consistent.

**1 Introduction**

In this paper we seek to address one of the philosophical challenges associated with accepting arithmetical propositions as true under an interpretation—either axiomatically or on the basis of subjective self-evidence—without any effective methodology for objectively evidencing such acceptance ^{[1]}.

For instance, conventional wisdom accepts Alfred Tarski’s definitions of the satisfiability and truth of the formulas of a formal language under an interpretation ^{[2]} and *postulates* that, under the standard interpretation of the first-order Peano Arithmetic PA ^{[3]} over the domain of the natural numbers:

(i) The atomic formulas of PA can be *assumed* as decidable under ;

(ii) The PA axioms can be *assumed* to interpret as satisfied/true under ;

(iii) the PA rules of inference—Generalisation and Modus Ponens—can be *assumed* to preserve such satisfaction/truth under .

**Standard interpretation of PA:** The standard interpretation of PA over the domain of the natural numbers is the one in which the logical constants have their `usual’ interpretations ^{[4]} in Aristotle’s logic of predicates (which subsumes Aristotle’s particularisation ^{[5]}), and ^{[7]}:

(a) the set of non-negative integers is the domain;

(b) the symbol [0] interprets as the integer 0;

(c) the symbol interprets as the successor operation (addition of 1);

(d) the symbols and interpret as ordinary addition and multiplication;

(e) the symbol interprets as the identity relation.

**The axioms of first-order Peano Arithmetic (PA)**

**PA** ;

**PA** ;

**PA** ;

**PA** ;

**PA** ;

**PA** ;

**PA** ;

**PA** ;

**PA** For any well-formed formula of PA:

.

**Generalisation in PA:** If is PA-provable, then so is .

**Modus Ponens in PA:** If and are PA-provable, then so is .

We shall show that although the seemingly innocent and self-evident assumption in (i) can, indeed, be justified, it conceals an ambiguity whose impact on (ii) and (iii) is far-reaching in significance and needs to be made explicit.

*Reason:* Tarski’s inductive definitions admit evidence-based interpretations of PA that actually allow us to metamathematically define the satisfaction and truth of the atomic (and, ipso facto, quantified) formulas of PA *constructively* over in *two* essentially different ways as below, only one of which is *finitary* ^{[7]}:

(1) in terms of algorithmic *verifiabilty* ^{[8]};

(2) in terms of algorithmic *computability* ^{[9]}.

*Case 1:* We show in Section 4.2 that the algorithmically verifiable PA-formulas admit an unusual, `instantiational’ Tarskian interpretation of PA over the domain of the PA *numerals*; and that this interpretation is sound if, and only if, PA is -consistent.

**Soundness (formal system):** We define a formal system S as sound under a Tarskian interpretation over a domain if, and only if, every theorem of S translates as ` is true under in ‘.

**Soundness (interpretation):** We define a Tarskian interpretation of a formal system S as sound over a domain if, and only if, S is sound under the interpretation over the domain .

**Simple consistency:** A formal system S is simply consistent if, and only if, there is no S-formula for which both and are S-provable.

**-consistency:** A formal system S is -consistent if, and only if, there is no S-formula for which, first, is S-provable and, second, is S-provable for any given S-term .

We further show that this interpretation can be viewed as a formalisation of the standard interpretation of PA over ; in the sense that—under Tarski’s definitions— is sound over if, and only if, is sound over (as postulated in (ii) and (iii) above).

Although the standard interpretation is *assumed* to be sound over (as expressed by (ii) and (iii) above), it cannot claim to be finitary since it it is not known to lead to a finitary justification of the truth—under Tarski’s definitions—of the Axiom Schema of (finite) Induction of PA in from which we may conclude—in an intuitionistically unobjectionable manner—that PA is consistent ^{[10]}.

We note that Gerhard Gentzen’s `constructive’ ^{[11]} consistency proof for formal number theory ^{[12]} is debatably finitary ^{[13]}, since it involves a Rule of Infinite Induction that appeals to the properties of transfinite ordinals.

*Case 2:* We show further in Section 4.3 that the algorithmically computable PA-formulas admit an `algorithmic’ Tarskian interpretation of PA over .

We then argue in Section 5 that is essentially different from since the PA-axioms—including the Axiom Schema of (finite) Induction—are algorithmically computable as satisfied/true under the standard interpretation of PA over , and the PA rules of inference preserve algorithmically computable satisfiability/truth under the interpretation ^{[14]}.

We conclude from the above that the interpretation is finitary, and hence sound over ^{[15]}.

We further conclude from the soundness of the interpretation over that PA is consistent ^{[16]}.

**2 Interpretation of an arithmetical language in terms of the computations of a simple functional language**

We begin by noting that we can, in principle, define ^{[17]} the classical `satisfaction’ and `truth’ of the formulas of a first order arithmetical language, such as PA, *verifiably* under an interpretation using as *evidence* ^{[18]} the computations of a simple functional language.

Such definitions follow straightforwardly for the atomic formulas of the language (i.e., those without the logical constants that correspond to `negation’, `conjunction’, `implication’ and `quantification’) from the standard definition of a simple functional language ^{[19]}.

Moreover, it follows from Alfred Tarski’s seminal 1933 paper on the concept of truth in the languages of the deductive sciences ^{[20]} that the `satisfaction’ and `truth’ of those formulas of a first-order language which contain logical constants can be inductively defined, under an interpretation, in terms of the `satisfaction’ and `truth’ of the interpretations of only the atomic formulas of the language.

Hence the `satisfaction’ and `truth’ of those formulas (of an arithmetical language) which contain logical constants can, in principle, also be defined verifiably under an interpretation using as evidence the computations of a simple functional language.

We show in Section 4 that this is indeed the case for PA under its standard interpretation , when this is explicitly defined as in Section 5.

We show, moreover, that we can further define `algorithmic truth’ and `algorithmic falsehood’ under such that the PA axioms interpret as always algorithmically true, and the rules of inference preserve algorithmic truth, over the domain of the natural numbers.

**2.1 The definitions of `algorithmic truth’ and `algorithmic falsehood’ under are not symmetric with respect to `truth’ and `falsehood’ under **

However, the definitions of `algorithmic truth’ and `algorithmic falsehood’ under are not symmetric with respect to classical (verifiable) `truth’ and `falsehood’ under .

For instance, if a formula of an arithmetic is algorithmically true under an interpretation (such as ), then we may conclude that there is an algorithm that, for any given numeral , provides evidence that the formula is algorithmically true under the interpretation.

In other words, there is an algorithm that provides evidence that the interpretation of *holds* in for any given natural number .

**Notation:** We use enclosing square brackets as in `‘ to indicate that the expression inside the brackets is to be treated as denoting a formal expression (formal string) of a formal language. We use an asterisk as in `‘ to indicate the asterisked expression is to be treated as denoting the interpretation of the formula in the corresponding domain of the interpretation.

**Defining the term `hold’:** We define the term `hold’—when used in connection with an interpretation of a formal language L and, more specifically, with reference to the computations of a simple functional language associated with the atomic formulas of the language L—explicitly in Section 4; the aim being to avoid appealing to the classically subjective (and existential) connotation implicitly associated with the term under an implicitly defined standard interpretation of an arithmetic ^{[21]}.

However, if a formula of an arithmetic is algorithmically false under an interpretation, then we can only conclude that there is no algorithm that, for any given natural number , can provide evidence whether the interpretation holds or not in .

We cannot conclude that there is a numeral such that the formula is algorithmically false under the interpretation; nor can we conclude that there is a natural number such that does not hold in .

Such a conclusion would require:

(i) either some additional evidence that will verify for some assignment of numerical values to the free variables of that the corresponding interpretation does not hold ^{[22]};

(ii) or the additional assumption that either Aristotle’s particularisation holds over the domain of the interpretation (as is implicitly presumed under the standard interpretation of PA over ) or, equivalently, that the arithmetic is -consistent ^{[23]}.

**Aristotle’s particularisation:** This holds that from a meta-assertion such as:

`It is not the case that: For any given , does not hold’,

usually denoted symbolically by `‘, we may always validly infer in the classical, Aristotlean, logic of predicates ^{[24]} that:

`There exists an unspecified such that holds’,

usually denoted symbolically by `‘.

**The significance of Aristotle’s particularisation for the first-order predicate calculus:** We note that in a formal language the formula `‘ is an abbreviation for the formula `‘. The commonly accepted interpretation of this formula—and a fundamental tenet of classical logic unrestrictedly adopted as intuitively obvious by standard literature ^{[25]} that seeks to build upon the formal first-order predicate calculus—tacitly appeals to Aristotlean particularisation.

However, L. E. J. Brouwer had noted in his seminal 1908 paper on the unreliability of logical principles ^{[26]} that the commonly accepted interpretation of this formula is ambiguous if interpretation is intended over an infinite domain.

Brouwer essentially argued that, even supposing the formula `‘ of a formal Arithmetical language interprets as an arithmetical relation denoted by `‘, and the formula `‘ as the arithmetical proposition denoted by `‘, the formula `‘ need not interpret as the arithmetical proposition denoted by the usual abbreviation `‘; and that such postulation is invalid as a general logical principle in the absence of a means for constructing some putative object for which the proposition holds in the domain of the interpretation.

Hence we shall follow the convention that the assumption that `‘ is the intended interpretation of the formula `‘—which is essentially the assumption that Aristotle’s particularisation holds over the domain of the interpretation—must always be explicit.

**The significance of Aristotle’s particularisation for PA:** In order to avoid intuitionistic objections to his reasoning, Kurt Gödel introduced the syntactic property of -consistency as an explicit assumption in his formal reasoning in his seminal 1931 paper on formally undecidable arithmetical propositions ^{[27]}.

Gödel explained at some length ^{[28]} that his reasons for introducing -consistency explicitly was to avoid appealing to the semantic concept of classical arithmetical truth in Aristotle’s logic of predicates (which presumes Aristotle’s particularisation).

It is straightforward to show that the two concepts are meta-mathematically equivalent in the sense that, if PA is consistent, then PA is -consistent if, and only if, Aristotle’s particularisation holds under the standard interpretation of PA over .

**3 Defining algorithmic verifiability and algorithmic computability**

The asymmetry of Section 2.1 suggests the following two concepts ^{[29]}:

**Definition 1: Algorithmic verifiability:** An arithmetical formula is algorithmically verifiable as true under an interpretation if, and only if, for any given numeral , we can define an algorithm which provides evidence that interprets as true under the interpretation.

**Tarskian interpretation of an arithmetical language verifiably in terms of the computations of a simple functional language:** We show in Section 4 that the `algorithmic verifiability’ of the formulas of a formal language which contain logical constants can be inductively defined under an interpretation in terms of the `algorithmic verifiability’ of the interpretations of the atomic formulas of the language; further, that the PA-formulas are decidable under the standard interpretation of PA over if, and only if, they are algorithmically verifiable under the interpretation (Corollary 2).

**Definition 2: Algorithmic computability:** An arithmetical formula is algorithmically computable as true under an interpretation if, and only if, we can define an algorithm that, for any given numeral , provides evidence that interprets as true under the interpretation.

**Tarskian interpretation of an arithmetical language algorithmically in terms of the computations of a simple functional language:** We show in Section 4 that the `algorithmic computability’ of the formulas of a formal language which contain logical constants can also be inductively defined under an interpretation in terms of the `algorithmic computability’ of the interpretations of the atomic formulas of the language; further, that the PA-formulas are decidable under an algorithmic interpretation of PA over if, and only if, they are algorithmically computable under the interpretation .

We now show that the above concepts are well-defined under the standard interpretation of PA over .

**4 The implicit Satisfaction condition in Tarski’s inductive assignment of truth-values under an interpretation**

We first consider the significance of the *implicit* Satisfaction condition in Tarski’s inductive assignment of truth-values under an interpretation.

We note that—essentially following standard expositions ^{[30]} of Tarski’s inductive definitions on the `satisfiability’ and `truth’ of the formulas of a formal language under an interpretation—we can define:

**Definition 3:** If is an atomic formula of a formal language S, then the denumerable sequence in the domain of an interpretation of S satisfies if, and only if:

(i) interprets under as a unique relation in for any witness of ;

(ii) there is a Satisfaction Method, SM() that provides objective *evidence* ^{[30]} by which any witness of can objectively *define* for any atomic formula of S, and any given denumerable sequence of , whether the proposition holds or not in ;

(iii) holds in for any .

**Witness:** From a constructive perspective, the existence of a `witness’ as in (i) above is implicit in the usual expositions of Tarski’s definitions.

**Satisfaction Method:** From a constructive perspective, the existence of a Satisfaction Method as in (ii) above is also implicit in the usual expositions of Tarski’s definitions.

**A constructive perspective:** We highlight the word `* define*‘ in (ii) above to emphasise the constructive perspective underlying this paper; which is that the concepts of `satisfaction’ and `truth’ under an interpretation are to be explicitly viewed as objective assignments by a convention that is witness-independent. A Platonist perspective would substitute `decide’ for `define’, thus implicitly suggesting that these concepts can `exist’, in the sense of needing to be discovered by some witness-dependent means—eerily akin to a `revelation’—if the domain is .

We can now inductively assign truth values of `satisfaction’, `truth’, and `falsity’ to the compound formulas of a first-order theory S under the interpretation in terms of *only* the satisfiability of the atomic formulas of S over as usual ^{[31]}:

**Definition 4:** A denumerable sequence of satisfies under if, and only if, does not satisfy ;

**Definition 5:** A denumerable sequence of satisfies under if, and only if, either it is not the case that satisfies , or satisfies ;

**Definition 6:** A denumerable sequence of satisfies under if, and only if, given any denumerable sequence of which differs from in at most the ‘th component, satisfies ;

**Definition 7:** A well-formed formula of is true under if, and only if, given any denumerable sequence of , satisfies ;

**Definition 8:** A well-formed formula of is false under if, and only if, it is not the case that is true under .

It follows that ^{[32]}:

**Theorem 1:** (*Satisfaction Theorem*) If, for any interpretation of a first-order theory S, there is a Satisfaction Method SM() which holds for a witness of , then:

(i) The formulas of S are decidable as either true or false over under ;

(ii) If the formulas of S are decidable as either true or as false over under , then so are the formulas of S.

**Proof:** It follows from the above definitions that:

(a) If, for any given atomic formula of S, it is decidable by whether or not a given denumerable sequence of satisfies in under then, for any given compound formula of S containing any one of the logical constants , it is decidable by whether or not satisfies in under ;

(b) If, for any given compound formula of S containing of the logical constants , it is decidable by whether or not a given denumerable sequence of satisfies in under then, for any given compound formula of S containing of the logical constants , it is decidable by whether or not satisfies in under ;

We thus have that:

(c) The formulas of S are decidable by as either true or false over under ;

(d) If the formulas of S are decidable by as either true or as false over under , then so are the formulas of S.

In other words, if the atomic formulas of of S interpret under as decidable with respect to the Satisfaction Method SM() by a witness over some domain , then the propositions of S (i.e., the and formulas of S) also interpret as decidable with respect to SM() by the witness over .

We now consider the application of Tarski’s definitions to various interpretations of first-order Peano Arithmetic PA.

**4.1 The standard interpretation of PA over the domain of the natural numbers**

The standard interpretation of PA over the domain of the natural numbers is obtained if, in :

(a) we define S as PA with standard first-order predicate calculus as the underlying logic ^{[34]};

(b) we define as the set of natural numbers;

(c) for any atomic formula of PA and sequence of , we take SATCON() as:

holds in and, for any given sequence of , the proposition is decidable in ;

(d) we define the witness informally as the `mathematical intuition’ of a human intelligence for whom, classically, SATCON() has been *implicitly* accepted as *objectively* `decidable’ in ;

We shall show that such acceptance is justified, but needs to be made explicit since:

**Lemma 1:** is both algorithmically verifiable and algorithmically computable in by .

**Proof:** (i) It follows from the argument in Theorem 2 (below) that is algorithmically verifiable in by .

(ii) It follows from the argument in Theorem 3 (below) that is algorithmically computable in by . The lemma follows.

Now, although it is not immediately obvious from the standard interpretation of PA over which of (i) or (ii) may be taken for *explicitly* deciding SATCON() by the witness , we shall show in Section 4.2 that (i) is consistent with (e) below; and in Section 4.3 that (ii) is inconsistent with (e). Thus the standard interpretation of PA over implicitly presumes (i).

(e) we postulate that Aristotle’s particularisation holds over ^{[35]}.

Clearly, (e) does not form any part of Tarski’s inductive definitions of the satisfaction, and truth, of the formulas of PA under the above interpretation. Moreover, its inclusion makes extraneously non-finitary ^{[36]}.

We note further that if PA is –*in*consistent, then Aristotle’s particularisation does not hold over , and the interpretation is not sound over .

**4.2 An instantiational interpretation of PA over the domain of the PA numerals**

We next consider an instantiational interpretation of PA over the domain of the PA numerals ^{[37]} where:

(a) we define S as PA with standard first-order predicate calculus as the underlying logic;

(b) we define as the set of PA numerals;

(c) for any atomic formula of PA and any sequence of PA numerals in , we take SATCON() as:

is provable in PA and, for any given sequence of numerals of PA, the formula is decidable as either provable or not provable in PA;

(d) we define the witness as the meta-theory of PA.

**Lemma 2:** is always algorithmically verifiable in PA by .

**Proof:** It follows from Gödel’s definition of the primitive recursive relation ^{[38]}—where is the Gödel number of a proof sequence in PA whose last term is the PA formula with Gödel-number —that, if is an atomic formula of PA, can algorithmically verify for any given sequence of PA numerals which one of the PA formulas and is necessarily PA-provable.

Now, if PA is consistent but not -consistent, then there is a Gödelian formula ^{[39]} such that:

(i) is not PA-provable;

(ii) is PA-provable;

(iii) for any given numeral , the formula is PA-provable.

However, if is sound over , then (ii) implies contradictorily that it is not the case that, for any given numeral , the formula is PA-provable.

It follows that if is sound over , then PA is -consistent and, ipso facto, Aristotle’s particularisation must hold over .

Moreover, if PA is consistent, then every PA-provable formula interprets as true under some sound interpretation of PA over . Hence can effectively decide whether, for any given sequence of natural numbers in , the proposition holds or not in .

It follows that can be viewed as a constructive formalisation of the `standard’ interpretation of PA in which we do not need to non-constructively assume that Aristotle’s particularisation holds over .

**4.3 An algorithmic interpretation of PA over the domain of the natural numbers**

We finally consider the purely algorithmic interpretation of PA over the domain of the natural numbers where:

(a) we define S as PA with standard first-order predicate calculus as the underlying logic;

(b) we define as the set of natural numbers;

(c) for any atomic formula of PA and any sequence of natural numbers in , we take SATCON() as:

holds in and, for any given sequence of , the proposition is decidable as either holding or not holding in ;

(d) we define the witness as any simple functional language that gives evidence that SATCON() is always *effectively* decidable in :

**Lemma 3:** is always algorithmically computable in by .

**Proof:** If is an atomic formula of PA then, for any given sequence of numerals , the PA formula is an atomic formula of the form , where and are atomic PA formulas that denote PA numerals. Since and are recursively defined formulas in the language of PA, it follows from a standard result ^{[40]} that, if PA is consistent, then is algorithmically computable as either true or false in . In other words, if PA is consistent, then is algorithmically computable (since there is an algorithm that, for any given sequence of numerals , will give evidence whether interprets as true or false in . The lemma follows.

It follows that is an algorithmic formulation of the `standard’ interpretation of PA over in which we do not extraneously assume either that Aristotle’s particularisation holds over or, equivalently, that PA is -consistent.

**5 Formally defining the standard interpretation of PA over constructively**

It follows from the analysis of the applicability of Tarski’s inductive definitions of `satisfiability’ and `truth’ in Section 4 that we can formally define the standard interpretation of PA *constructively* where:

(a) we define S as PA with standard first-order predicate calculus as the underlying logic;

(b) we define as ;

(c) we take SM() as any simple functional language.

We note that:

**Theorem 2:** The atomic formulas of PA are algorithmically verifiable under the standard interpretation .

**Proof:** If is an atomic formula of PA then, for any given denumerable sequence of numerals , the PA formula is an atomic formula of the form , where and are atomic PA formulas that denote PA numerals. Since and are recursively defined formulas in the language of PA, it follows from a standard result that, if PA is consistent, then interprets as the proposition which either holds or not for a witness in .

Hence, if PA is consistent, then is algorithmically verifiable since, for any given denumerable sequence of numerals , we can define an algorithm that provides evidence that the PA formula is decidable under the interpretation.

The theorem follows.

It immediately follows that:

**Corollary 1:** The `satisfaction’ and `truth’ of PA formulas containing logical constants can be defined under the standard interpretation of PA over in terms of the evidence provided by the computations of a simple functional language.

**Corollary 2:** The PA-formulas are decidable under the standard interpretation of PA over if, and only if, they are algorithmically verifiable under the interpretation.

**5.1 Defining `algorithmic truth’ under the standard interpretation of PA over **

Now we note that, in addition to Theorem 2:

**Theorem 3:** The atomic formulas of PA are algorithmically computable under the standard interpretation .

**Proof:** If is an atomic formula of PA then we can define an algorithm that, for any given denumerable sequence of numerals , provides evidence whether the PA formula is true or false under the interpretation.

The theorem follows.

This suggests the following definitions:

**Definition 9:** A well-formed formula of PA is algorithmically true under if, and only if, there is an algorithm which provides evidence that, given any denumerable sequence of , satisfies ;

**Definition 10:**A well-formed formula of PA is algorithmically false under if, and only if, it is not algorithmically true under .

**5.2 The PA axioms are algorithmically computable**

The significance of defining `algorithmic truth’ under as above is that:

**Lemma 4:** The PA axioms PA to PA are algorithmically computable as algorithmically true over under the interpretation .

**Proof:** Since , , , are defined recursively ^{[41]}, the PA axioms PA to PA interpret as recursive relations that do not involve any quantification. The lemma follows straightforwardly from Definitions 3 to 8 in Section 4 and Theorem 2.

**Lemma 5:** For any given PA formula , the Induction axiom schema interprets as algorithmically true under .

**Proof:** By Definitions 3 to 10:

(a) If interprets as algorithmically false under the lemma is proved.

Since interprets as algorithmically true if, and only if, either interprets as algorithmically false or interprets as algorithmically true.

(b) If interprets as algorithmically true and interprets as algorithmically false under , the lemma is proved.

(c) If and both interpret as algorithmically true under , then by Definition 9 there is an algorithm which, for any natural number , will give evidence that the formula is true under .

Since interprets as algorithmically true under , it follows that there is an algorithm which, for any natural number , will give evidence that the formula is true under the interpretation.

Hence is algorithmically true under .

Since the above cases are exhaustive, the lemma follows.

**The Poincaré-Hilbert debate:** We note that Lemma 5 appears to settle the Poincaré-Hilbert debate ^{[42]} in the latter’s favour. Poincaré believed that the Induction Axiom could not be justified finitarily, as any such argument would necessarily need to appeal to infinite induction. Hilbert believed that a finitary proof of the consistency of PA was possible.

**Lemma 6:** Generalisation preserves algorithmic truth under .

**Proof:** The two meta-assertions:

` interprets as algorithmically true under ^{[43]}‘

and

` interprets as algorithmically true under ‘

both mean:

is algorithmically computable as always true under .

It is also straightforward to see that:

Modus Ponens preserves algorithmic truth under .

We thus have that:

**Theorem 4:** The axioms of PA are always algorithmically true under the interpretation , and the rules of inference of PA preserve the properties of algorithmic satisfaction/truth under ^{[44]}.

**5.3 The interpretation of PA over is sound**

We conclude from Section 4.3 and Section 5.2 that there is an algorithmic interpretation of PA over such that:

**Theorem 5:** The interpretation of PA is sound over .

**Proof:** It follows immediately from Theorem 4 that the axioms of PA are always true under the interpretation , and the rules of inference of PA preserve the properties of satisfaction/truth under .

We thus have a finitary proof that:

**Theorem 6:** PA is consistent.

**Conclusion**

We have shown that although conventional wisdom is justified in *assuming* that the quantified arithmetical propositions of the first order Peano Arithmetic PA are *constructively* decidable under the standard interpretation of PA over the domain of the natural numbers, the assumption does not address—and implicitly conceals—a significant ambiguity that needs to be made explicit.

*Reason:* Tarski’s inductive definitions admit evidence-based interpretations of the first-order Peano Arithmetic PA that allow us to define the satisfaction and truth of the quantified formulas of PA *constructively* over in *two* essentially different ways.

*First* in terms of algorithmic verifiabilty. We show that this allows us to define a *formal instantiational* interpretation of PA over the domain of the PA numerals that is sound (i.e. PA theorems interpret as true in ) if, and only if, the standard interpretation of PA over —which is not known to be finitary—is sound.

*Second* in terms of algorithmic computability. We show that this allows us to define a finitary *algorithmic* interpretation of PA over which *is* sound, and so we may conclude that PA is consistent.

**Acknowledgements**

We would like to thank Professor Rohit Parikh for his suggestion that this paper should appeal to the computations of a simple functional language in general, and avoid appealing to the computations of a Turing machine in particular.

**References**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic* (4th ed). Cambridge University Press, Cambridge.

**Be59** Evert W. Beth. 1959. *The Foundations of Mathematics.* Studies in Logic and the Foundations of Mathematics. Edited by L. E. J. Brouwer, E. W. Beth, A. Heyting. 1959. North Holland Publishing Company, Amsterdam.

**BF58** Paul Bernays and Abraham A. Fraenkel. 1958. *Axiomatic Set Theory.* Studies in Logic and the Foundations of Mathematics. Edited by L. E. J. Brouwer, E. W. Beth, A. Heyting. 1959. North Holland Publishing Company, Amsterdam.

**Br08** L. E. J. Brouwer. 1908. *The Unreliability of the Logical Principles.* English translation in A. Heyting, Ed. *L. E. J. Brouwer: Collected Works 1: Philosophy and Foundations of Mathematics.* Amsterdam: North Holland / New York: American Elsevier (1975): pp.107-111.

**Br13** L. E. J. Brouwer. 1913. *Intuitionism and Formalism.* Inaugural address at the University of Amsterdam, October 14, 1912. Translated by Professor Arnold Dresden for the Bulletin of the American Mathematical Society, Volume 20 (1913), pp.81-96. 1999. Electronically published in Bulletin (New Series) of the American Mathematical Society, Volume 37, Number 1, pp.55-64.

**Co66** Paul J. Cohen. 1966. *Set Theory and the Continuum Hypothesis.* (Lecture notes given at Harvard University, Spring 1965) W. A. Benjamin, Inc., New York.

**Cr05** John N. Crossley. 2005. *What is Mathematical Logic? A Survey.* Address at the *First Indian Conference on Logic and its Relationship with Other Disciplines* held at the Indian Institute of Technology, Powai, Mumbai from January 8 to 12. Reprinted in *Logic at the Crossroads: An Interdisciplinary View – Volume I* (pp.3-18). ed. Amitabha Gupta, Rohit Parikh and Johan van Bentham. 2007. Allied Publishers Private Limited, Mumbai.

**Da82** Martin Davis. 1958. *Computability and Unsolvability.* 1982 ed. Dover Publications, Inc., New York.

**EC89** Richard L. Epstein, Walter A. Carnielli. 1989. *Computability: Computable Functions, Logic, and the Foundations of Mathematics.* Wadsworth & Brooks, California.

**Fe06** Solomon Feferman. 2006. *Are There Absolutely Unsolvable Problems? Gödel’s Dichotomy.* Philosophia Mathematica (2006) 14 (2): 134-152.

**Fe08** Solomon Feferman. 2008. *Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert’s program.* in *Special Issue: Gödel’s dialectica Interpretation* Dialectica, Volume 62, Issue 2, June 2008, pp. 245-290.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**HA28** David Hilbert & Wilhelm Ackermann. 1928. *Principles of Mathematical Logic.* Translation of the second edition of the *Grundzüge Der Theoretischen Logik.* 1928. Springer, Berlin. 1950. Chelsea Publishing Company, New York.

**Hi25** David Hilbert. 1925. *On the Infinite.* Text of an address delivered in Münster on 4th June 1925 at a meeting of the Westphalian Mathematical Society. In Jean van Heijenoort. 1967.Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**Hi27** David Hilbert. 1927. *The Foundations of Mathematics.* Text of an address delivered in July 1927 at the Hamburg Mathematical Seminar. In Jean van Heijenoort. 1967.Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**Kl52** Stephen Cole Kleene. 1952. *Introduction to Metamathematics.* North Holland Publishing Company, Amsterdam.

**Kn63** G. T. Kneebone. 1963. *Mathematical Logic and the Foundations of Mathematics: An Introductory Survey.* D. Van Norstrand Company Limited, London.

**Li64** A. H. Lightstone. 1964. *The Axiomatic Method.* Prentice Hall, NJ.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand, Princeton.

**Mu91** Chetan R.\ Murthy. 1991. *An Evaluation Semantics for Classical Proofs.* Proceedings of Sixth IEEE Symposium on Logic in Computer Science, pp. 96-109, (also Cornell TR 91-1213), 1991.

**Nv64** P. S. Novikov. 1964. *Elements of Mathematical Logic.* Oliver & Boyd, Edinburgh and London.

**Pa71** Rohit Parikh. 1971. *Existence and Feasibility in Arithmetic.* The Journal of Symbolic Logic, Vol.36, No. 3 (Sep., 1971), pp. 494-508.

**Qu63** Willard Van Orman Quine. 1963. *Set Theory and its Logic. Harvard University Press, Cambridge, Massachusette.*

**Rg87** Hartley Rogers Jr. 1987. *Theory of Recursive Functions and Effective Computability.<i.* MIT Press, Cambridge, Massachusetts.

**Ro53** J. Barkley Rosser. 1953. *Logic for Mathematicians* McGraw Hill, New York.

**Ru53** Walter Rudin. 1953. *Principles of Mathematical Analysis.* McGraw Hill, New York.

**Sh67** Joseph R. Shoenfield. 1967. *Mathematical Logic.* Reprinted 2001. A. K. Peters Ltd., Massachusetts.

**Sk28** Thoralf Skolem. 1928. *On Mathematical Logic* Text of a lecture delivered on 22nd October 1928 before the Norwegian Mathematical Association. In Jean van Heijenoort. 1967. Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**Sm92** Raymond M. Smullyan. 1992. *Gödel’s Incompleteness Theorems.* Oxford University Press, Inc., New York.

**Su60** Patrick Suppes. 1960. *Axiomatic Set Theory.* Van Norstrand, Princeton.

**Ta33** Alfred Tarski. 1933. *The concept of truth in the languages of the deductive sciences.* In *Logic, Semantics, Metamathematics, papers from 1923 to 1938* (p152-278). ed. John Corcoran. 1983. Hackett Publishing Company, Indianapolis.

**Tu36** Alan Turing. 1936. *On computable numbers, with an application to the Entscheidungsproblem.* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from the Proceedings of the London Mathematical Society, ser. 2. vol. 42 (1936-7), pp.230-265; corrections, Ibid, vol 43 (1937) pp.\ 544-546.

**Wa63** Hao Wang. 1963. *A survey of Mathematical Logic.* North Holland Publishing Company, Amsterdam.

**We27** Hermann Weyl. 1927. *Comments on Hilbert’s second lecture on the foundations of mathematics* In Jean van Heijenoort. 1967. Ed. *From Frege to Gödel: A source book in Mathematical Logic, 1878 – 1931.* Harvard University Press, Cambridge, Massachusetts.

**Notes**

Return to 1: For a brief recent review of such challenges, see Fe06, Fe08.

Return to 2: As detailed in Section 4.

Return to 3: We take this to be the first-order theory S defined in Me64, p.102.

Return to 4: We essentially follow the definitions in Me64, p.49.

Return to 5: We define this important concept explicitly later in Section 2.1. Loosely speaking, Aristotle’s particularisation is the assumption that we may always interpret the formal expression `[]’ of a formal language under an interpretation as `There exists an object in the domain of the interpretation such that ‘.

Return to 6: See Me64, p.107.

Return to 7: `Finitary’ in the sense that “… there should be an algorithm for deciding the truth or falsity of any mathematical statement“. For a brief review of `finitism’ and `constructivity’ in the context of this paper see Fe08.

Return to 8: Section 3, Definition 1.

Return to 9: Section 3, Definition 2.

Return to 10: The possibility/impossibility of such justification was the subject of the famous Poincaré-Hilbert debate. See Hi27, p.472; also Br13, p.59; We27, p.482; Pa71, p.502-503.

Return to 11: In the sense highlighted by Elliott Mendelson in Me64, p.261.

Return to 12: cf. Me64, p258.

Return to 13: See for instance http://en.wikipedia.org/wiki/Hilbert’s\_program.

Return to 14: Section 5.2, Theorem 4.

Return to 15: Section 5.3, Theorem 5.

Return to 16: Section 5.3, Theorem 6.

Return to 17: Formal definitions are given in Section 4.

Return to 18: Mu91.

Return to 19: Such as, for instance, that of a deterministic Turing machine (Me64, pp.229-231) based essentially on Alan Turing’s seminal 1936 paper on computable numbers (Tu36).

Return to 20: Ta33.

Return to 21: As, for instance, in Go31.

Return to 22: Essentially reflecting Brouwer’s objection to the assumption of Aristotle’s particularisation over an infinite domain.

Return to 23: An assumption explicitly introduced by Gödel in Go31.

Return to 24: HA28, pp.58-59.

Return to 25: See Hi25, p.382; HA28, p.48; Sk28, p.515; Go31, p.32.; Kl52, p.169; Ro53, p.90; BF58, p.46; Be59, pp.178 & 218; Su60, p.3; Wa63, p.314-315; Qu63, pp.12-13; Kn63, p.60; Co66, p.4; Me64, p.52(ii); Nv64, p.92; Li64, p.33; Sh67, p.13; Da82, p.xxv; Rg87, p.xvii; EC89, p.174; Mu91; Sm92, p.18, Ex.3; BBJ03, p.102; Cr05, p.6.

Return to 26: Br08.

Return to 27: Go31, p.23 and p.28.

Return to 28: In his introduction on p.9 of Go31.

Return to 29: The distinction sought to be made between algorithmic verifiabilty and algorithmic computability can be viewed as reflecting in number theory the similar distinction in analysis between, for instance, continuous functions (Ru53, p.65, 4.5) and uniformly continuous functions (Ru53, p.65, 4.13); or that between convergent sequences (Ru53, p.65, 7.1) and uniformly convergent sequences (Ru53, p.65, 7.7).}

Return to 30: cf. Me64, p.51.

Return to 31: In the sense of Mu91.

Return to 32: See Me64, p.51; Mu91.

Return to 33: cf. Me64, pp.51-53.

Return to 34: Where the string is defined as—and is to be treated as an abbreviation for—the string . We do not consider the case where the underlying logic is Hilbert’s formalisation of Aristotle’s logic of predicates in terms of his -operator (Hi27, pp.465-466).

Return to 35: Hence a PA formula such as interprets under as `There is some natural number such that holds in .

Return to 36: Br08.

Return to 37: The raison d’être, and significance, of such interpretation is outlined in this short unpublished note accessible at http://alixcomsi.com/8\_Meeting\_Wittgenstein\_requirement\_1000.pdf.

Return to 38: Go31, p. 22(45).

Return to 39: Gödel constructively defines, and refers to, this formula by its Gödel number `‘: see Go31, p.25, Eqn.(12).

Return to 40: For any natural numbers , if , then PA proves (Me64, p.110, Proposition 3.6). The converse is obviously true.

Return to 41: cf. Go31, p.17.

Return to 42: See Hi27, p.472; also Br13, p.59; We27, p.482; Pa71, p.502-503.

Return to 43: See Definition 7.

Return to 44: Without appeal, moreover, to Aristotle’s particularisation.

*See also (i) this later publication by Sebastian Grève, where he concludes that “… while Gödel indeed showed some significant understanding of Wittgenstein here, ultimately, Wittgenstein perhaps understood Gödel better than Gödel understood himself”; and (ii) this note on Rosser’s Rule C and Wittgenstein’s objections on purely philosophical considerations to Gödel’s reasoning and conclusions, where we show that, although not at all obvious (perhaps due to Gödel’s overpoweringly plausible presentation of his interpretation of his own formal reasoning over the years) what Gödel claimed to have proven is not—as suspected and held by Wittgenstein—supported by Gödel’s formal argumentation.*

**A: Misunderstanding Gödel’s Theorems VI and XI: Incompleteness and Undecidability**

In an informal essay, “*Misunderstanding Gödel’s Theorems VI and XI: Incompleteness and Undecidability*“, DPhil candidate Sebastian Grève at The Queen’s College, Oxford, attempts to come to terms with what he subjectively considers:

*“… has not been properly addressed as such by philosophers hitherto as of great philosophical importance in our understanding of Gödel’s Incompleteness Theorems.”*

Grève’s is an unusual iconoclastic perspective:

*“This essay is an open enquiry towards a better understanding of the philosophical significance of Gödel’s two most famous theorems. I proceed by a discussion of several common misunderstandings, led by the following four questions:*

*1) Is the Gödel sentence true?*

*2) Is the Gödel sentence undecidable?*

*3) Is the Gödel sentence a statement?*

*4) Is the Gödel sentence a sentence?*

*Asking these questions in this order means to trace back the steps of Gödel’s basic philosophical interpretation of his formal results. What I call the basic philosophical interpretation is usually just taken for granted by philosopher’s writing about Gödel’s theorems.”*

In a footnote Grève acknowledges Wittgenstein’s influence by suggesting that:

*“This essay can be read as something like a free-floating interpretation of the theme of Wittgenstein’s remarks on Gödel’s Incompleteness Theorems in Wittgenstein: 1978[RFM], I-(III), partly following Floyd: 1995 but especially Kienzler: 2008, and constituting a reply to inter alia Rodych: 2003”.*

**B: Why we may see the trees, but not the forest**

We note that Grève’s four points are both overdue and well-made:

1. *Is the Gödel sentence true?*

Grève’s objection that standard interpretations are obscure when they hold the Gödel sentence as being intuitively true deserves consideration (see this post).

The ‘truth’ of the sentence should and does—as Wittgenstein stressed and suggested—follow objectively from the axioms and rules of inference of arithmetic.

2. *Is the Gödel sentence undecidable?*

Grève’s observation that the ‘undecidability’ of the Gödel sentence conceals a philosophically questionable assumption is well-founded.

The undecidability in question follows only on the assumption of ‘-consistency’ made explicitly by Gödel.

This assumption is actually logically equivalent to the philosophically questionable assertion that from the provability of we may conclude the existence of some numeral for which is provable.

Since Rosser’s proof implicitly makes this assumption by means of his logically questionable Rule C, his claim of avoiding omega-consistency for arithmetic is illusory.

3. *Is the Gödel sentence a statement?*

Grève rightly holds that the Gödel sentence should be treated as a valid statement within the formal arithmetic S, since it is structurally defined as a well-formed formula of S.

4. *Is the Gödel sentence a sentence?*

Grève’s concern about whether the Gödel sentence of S is a valid arithmetical proposition under interpretation also seems to need serious philosophical consideration.

It can be argued (see the comment following the proof of Lemma 9 of this preprint) that the way the sentence is formally defined as the universal quantification of an instantiationally (but not algorithmically) defined arithmetical predicate does not yield an unequivocally defined arithmetical proposition in the usual sense under interpretation.

In this post ^{[*]} we shall not only echo Grève’s disquietitude, but argue further that Gödel’s interpretation and assessment of his own formal reasoning in his seminal 1931 paper on formally undecidable arithmetical propositions is, essentially, a post-facto imposition that continues to influence standard expositions of Gödel’s reasoning misleadingly.

**Feynman’s cover-up factor**

Our thesis is influenced by physicist Richard P. Feynman, who started his 1965 Nobel Lecture with a penetrating observation:

*We have a habit in writing articles published in scientific journals to make the work as finished as possible, to cover up all the tracks, to not worry about the blind alleys or describe how you had the wrong idea first, and so on. So there isn’t any place to publish, in a dignified manner, what you actually did in order to get to do the work.*

That such `cover up’ may have unintended—and severely limiting—consequences on a discipline is suggested by Gödel’s interpretation, and assessment, of his own formal reasoning in his seminal 1931 paper on formally undecidable arithmetical propositions (Go31).

Thus, in his informal preamble to the result that he intended to prove formally, Gödel wrote (cf. Go31, p.9):

*The analogy of this result with Richard’s antinomy is immediately evident; there is also a close relationship with the Liar Paradox … Thus we have a proposition before us which asserts its own unprovability.*

Further, interpreting the significance of his formal reasoning as having established the existence of a formally undecidable arithmetical proposition that is, however, decidable by meta-mathematical arguments, Gödel noted that:

*The precise analysis of this remarkable circumstance leads to surprising results concerning consistency proofs of formal systems … (Go31, p.9)*

*The true reason for the incompleteness which attaches to all formal systems of mathematics lies, as will be shown in Part II of this paper, in the fact that the formation of higher and higher types can be continued into the transfinite (c.f., D. Hilbert, `Über das Unendliche’, Math. Ann. 95, p. 184), while, in every formal system, only countable many are available. Namely, one can show that the undecidable sentences which have been constructed here always become decidable through adjunction of suitable high types (e.g. of the type to the system . A similar result also holds for the axiom systems of set theory. (Go31, p.28, footnote 48a)*

The explicit thesis of this foundational paper is that the above interpretation is an instance of a `cover up’—in Feynman’s sense—which appears to be a post-facto imposition that, first, continues to echo in and misleadingly ^{[1]} influence standard expositions of Gödel’s reasoning when applied to a first-order Peano Arithmetic, PA, and, second, that it obscures the larger significance of the genesis of Gödel’s reasoning.

As Gödel’s various remarks in Go31 suggest, this possibly lay in efforts made at the dawn of the twentieth century—largely as a result of Brouwer’s objections (Br08)—to define unambiguously the role that the universal and existential quantifiers played in formal mathematical reasoning.

That this issue is critical to Gödel’s reasoning in Go31, but remains unresolved in it, is obscured by his powerful presentation and interpretation.

So, to grasp the underlying mathematical significance of Gödel’s reasoning, and of what he has actually achieved, one may need to avoid focusing (as detailed in the previous posts on *A foundational perspective on the semantic and logical paradoxes*; in this post on undecidable Gödelian propositions, and in this preprint on undecidable Gödelian propositions):

on the analogy of the so-called `Liar paradox’;

on Gödel’s interpretation of his arithmetical proposition as asserting its own formal unprovability in his formal Peano Arithmetic P (Go31, pp.9-13);

on his interpretation of the reasons for the `incompleteness’ of P; and

on his assessment and interpretation of the formal consequences of such `incompleteness’.

We show in this paper that, when applied to PA ^{[2]}, all of these obscure the deeper significance of what Gödel actually achieved in Go31.

**C: Hilbert: If the -Rule is true, can P be completed?**

Instead, Gödel’s reasoning may need to be located specifically in the context of Hilbert’s Program (cf. Hi30, pp.485-494) in which he proposed an -rule as a finitary means of extending a Peano Arithmetic—such as his formal system P in Go31—to a possible completion (*i.e. to logically showing that, given any arithmetical proposition, either the proposition, or its negation, is formally provable from the axioms and rules of inference of the extended Arithmetic*).

*Hilbert’s -Rule:* If it is proved that the P-formula [] interprets as a true numerical formula for each given P-numeral [], then the P-formula may be admitted as an initial formula (*axiom*) in P.

It is likely that Gödel’s 1931 paper evolved out of attempts to prove Hilbert’s -rule in the limited—and more precise—sense that if a formula [] is provable in P for each given numeral [], then the formula [] must be provable in P.

Now, if we meta-assume Hilbert’s -rule for P, then it follows that, if P is consistent, then there is no P-formula [] for which, first, [] is P-provable and, second, [] is P-provable for any given P-numeral [].

Gödel defined a consistent Peano Arithmetic with the above property as additionally -consistent (Go31, pp.23-24).

**D: The significance of -consistency**

To place the significance of -consistency in a current perspective, we note that the standard model of the first order Peano Arithmetic PA (cf. Me64, p.107; Sc67, p.23, p.209; BBJ03, p.104) *presumes* ^{[3]} that the standard interpretation * M* of PA (under which the PA-formula [], which is merely an abbreviation for , interprets as true if, and only if, holds for some natural number under

*) is*

**M***sound*(cf. BBJ03, p.174).

Clearly, if such an interpretation of the existential quantifier is sound, it immediately implies that PA is necessarily -consistent ^{[4]}.

Since Brouwer’s main objection was to Hilbert’s presumption that such an interpretation of the existential quantifier is sound, Gödel explicitly avoided this assumption in his seminal 1931 paper (Go31, p.9) in order to ensure that his reasoning was acceptable as “constructive” and “intuitionistically unobjectionable” (Go31, p.26).

He chose, instead, to present the formal undecidability of his arithmetical proposition—and the consequences arising from it—as explicitly conditional on the assumption of the formal property of -consistency for his Peano Arithmetic P under the unqualified—and, as we show below, mistaken—belief that:

*PA is -consistent (Go31, p.28, footnote 48a).*

**E: Gödel: If the -Rule is true, P cannot be completed**

Now, Gödel’s significant achievement in Go31 was the discovery that, if P is consistent, then it was possible to construct a P-formula, [] ^{[5]}, such that is P-provable for any given P-numeral [] (Go31, p.25(2)), but [] is P-unprovable (Go31, p.25(1)).

However, it becomes apparent from his remarks in Go31 that Gödel considered his more significant achievement the further argument that, if P is assumed -consistent, then both [] and [] ^{[6]} are P-unprovable, and so P is incomplete!

This is the substance of Gödel’s Theorem VI (Go31, p.24).

Although this Theorem neither validated nor invalidated Hilbert’s -rule, it did imply that assuming the rule led not to the completion of a Peano Arithmetic as desired by Hilbert, but to its essential incompletability!

**F: The -Rule is inconsistent with PA**

Now, apparently, the possibility neither considered by Gödel in 1931, nor seriously since, is that a formal sytem of Peano Arithmetic—such as PA—may be consistent *and* –*in*consistent.

If so, one would ascribe this omission to the `cover up’ factor mentioned by Feynman, since a significant consequence of Gödel’s reasoning—in the first half of his proof of his Theorem VI—is that it actually establishes PA as –*in*consistent (as detailed in Corollary 9 of this preprint and Corollary 4 of this post).

In other words, we can logically show for Gödel’s formula [] that [ ] is PA-provable, and that [] is PA-provable for any given PA-numeral [].

Consequently, Gödel’s Theorem VI is vacuously true for PA, and it also follows that Hilbert’s -Rule is inconsistent with PA!

**G: Need: A paradigm shift in interpreting the quantifiers**

Thus Gödel’s unqualified belief that:

“*PA is -consistent*“

was misplaced, and Brouwer’s objection to Hilbert’s presumption—that the above interpretation of the existential quantifier is sound—was justified; since, if PA is consistent, then it is provably –*in*consistent, from which it follows that the standard interpretation * M* of PA is

*not*sound.

Hence we can no longer interpret `[] is true’ maximally under the standard interpretation of PA as:

(i) The arithmetical relation is not always ^{[7]} true.

However, since the theorems of PA—when treated as Boolean functions—are Turing-computable as always true under a *sound* finitary interpretation of PA, we *can* interpret `[] is true’ minimally as:

(ii) The arithmetical relation is not Turing-computable as always true.

This interpretation allows us to conclude from Gödel’s meta-mathematical argument that we can construct a PA-formula [] that is unprovable in PA, but which is true under a sound interpretation of PA ^{[8]} although we may now no longer conclude from Gödel’s reasoning that there is an undecidable arithmetical PA-proposition.

Moreover, the interpretation admits an affirmative answer to Hilbert’s query: Is PA complete or completeable?

**H: PA is algorithmically complete**

In outline, the basis from which this conclusion follows formally is that:

(i) Gödel’s proof of the essential incompleteness of any formal system of Peano Arithmetic (Go31, Theorem VI, p.24) *explicitly* assumes that the arithmetic is -consistent;

(ii) Rosser’s extension of Gödel’s proof of the essential incompleteness of any formal system of Peano Arithmetic (cf. Ro36, Theorem II, p.233) *implicitly* presumes that the Arithmetic is -consistent (as detailed in this post);

(iii) PA is –*in*consistent (as detailed in Corollary 9 of this preprint);

(iv) The classical `standard’ interpretation of PA (cf. Me64, section \S 2, pp.49-53; p107) over the structure []—defined as { (*the set of natural numbers*); (*equality*); (*the successor function*); (*the addition function*); (*the product function*); (*the null element*)}— does *not* define a finitary model of PA (as detailed in the paper titled *Evidence-Based Interpretations of PA* presented at IACAP/AISB Turing 2012, Birmingham, UK in July 2012);

(v) We can define a sound interpretation of PA—in terms of Turing-computability—which yields a finitary model of PA, but which does not admit a non-standard model for PA (as detailed in this paper);

(vi) PA is algorithmically complete in the sense that an arithmetical proposition defines a Turing-machine TM which computes as true under if, and only if, the corresponding PA-formula [] is PA-provable (as detailed in Section 8 of this preprint).

**I: Gödel’s proof of his Theorem XI does not withstand scrutiny**

Since Gödel’s proof of his Theorem XI (Go31, p.36)—in which he claims to show that the consistency of his formal system of Peano Arithmetic P can be expressed as a P-formula which is not provable in P—appeals critically to his Theorem VI, it follows that this proof cannot be applied to PA.

However, we show below that there are other, significant, reasons why Gödel’s reasoning in this proof must be treated as classically objectionable per se.

**J: Why Gödel’s interpretation of the significance of his Theorem XI is classically objectionable**

Now, in his Theorem XI, Gödel constructs a formula [] ^{[9]} in P and assumes that [] translates—under a sound interpretation of P—as an arithmetical proposition that is true if, and only if, a specified formula of P is unprovable in P.

Now, if there were such a P-formula, then, since an inconsistent system necessarily proves every well-formed formula of the system, it would follow that a proof sequence within P proves that P is consistent.

However, Gödel shows that his formula [] is not P-provable (Go31, p.37).

He concludes that the consistency of any formal system of Peano Arithmetic is not provable within the Arithmetic. ^{[10]}

**K: Defining meta-propositions of P arithmetically**

Specifically, Gödel first shows how 46 meta-propositions of P can be defined by means of primitive recursive functions and relations (Go31, pp.17-22).

These include:

() A primitive recursive relation, *Form*(), which is true if, and only if, is the Gödel-number of a formula of P;

() A primitive recursive relation, , which is true if, and only if, is the Gödel-number of a proof sequence of P whose last formula has the Gödel-number .

Gödel assures the constructive nature of the first 45 definitions by specifying (cf. Go31, p.17, footnote 34):

*Everywhere in the following definitions where one of the expressions `‘, `‘, ` (There is a unique )’ occurs it is followed by a bound for . This bound serves only to assure the recursive nature of the defined concept.*

Gödel then defines a meta-mathematical proposition that is not recursive:

() A proposition, , which is true if, and only if, is true.

Thus is true if, and only if, is the Gödel-number of a provable formula of P.

**L: Expressing arithmetical functions and relations in P**

Now, by Gödel’s Theorem VII (Go31, p.29), any recursive relation, say , can be represented in P by some, corresponding, arithmetical formula, say [], such that, for any natural number :

If is true, then [] is P-provable;

If is false, then [] is P-provable.

However, Gödel’s reasoning in the first half of his Theorem VI (Go31, p.25(1)) establishes that the above representation does not extend to the closure of a recursive relation, in the sense that we cannot assume:

If is true (i.e, is true for any given natural number), then is P-provable.

In other words, we cannot assume that, even though the recursive relation is instantiationally equivalent to a sound interpretation of the P-formula [], the number-theoretic proposition must, necessarily, be logically equivalent to the—correspondingly sound—interpretation of the P-formula [].

The reason: In recursive arithmetic, the expression `‘ is an abbreviation for the assertion:

(*) There is some (at least one) natural number such that holds.

In a formal Peano Arithmetic, however, the formula `[]’ is simply an abbreviation for `[]’, which, under a sound finitary interpretation of the Arithmetic can have the verifiable translation:

(**) The relation is not Turing-computable as always true.

Moreover, Gödel’s Theorem VI establishes that we cannot conclude (*) from (**) without risking inconsistency.

Consequently, although a primitive recursive relation may be instantiationally equivalent to a sound interpretation of a P-formula, we cannot assume that the existential closure of the relation must have the same meaning as the interpretation of the existential closure of the corresponding P-formula.

However this, precisely, is the presumption made by Gödel in the proof of Theorem XI, from which he concludes that the consistency of P can be expressed in P, but is not P-provable.

**M: Ambiguity in the interpreted `meaning’ of formal mathematical expressions**

The ambiguity in the `meaning’ of formal mathematical expressions containing unrestricted universal and existential closure under an interpretation was emphasised by Wittgenstein (Wi56):

*Do I understand the proposition “There is . . .” when I have no possibility of finding where it exists? And in so far as what I can do with the proposition is the criterion of understanding it … it is not clear in advance whether and to what extent I understand it.*

**N: Expressing “P is consistent” arithmetically**

Specifically, Gödel defines the notion of “P is consistent” classically as follows:

P is consistent if, and only if, *Wid*(P) is true

where *Wid*(P) is defined as:

This translates as:

There is a natural number which is the Gödel-number of a formula of P, and this formula is not P-provable.

Thus, *Wid*(P) is true if, and only if, P is consistent.

**O: Gödel: “P is consistent” is always expressible in P**

However, Gödel, then, presumes that:

(i) *Wid*(P) can be represented by some formula [] of P such that “[] is true” and “*Wid*(P) is true” are logically equivalent (i.e., have the same meaning) under a sound interpretation of P;

(ii) if the recursive relation, (1931, p24(8.1)), is represented by the P-formula [], then the proposition “[] is true” is logically equivalent to (i.e., has the same meaning as) “ is true” under a sound interpretation of P.

**P: The loophole in Gödel’s presumption**

Although, (ii), for instance, does follow if “[] is true” translates as “ is Turing-computable as always true”, it does not if “[] is true” translates as “ is constructively computable as true for any given natural number , but it is not Turing-computable as true for any given natural number “.

So, if [], too, interprets as an arithmetical proposition that is constructively computable as true, but not Turing-computable as true, then the consistency of P may be provable instantiationally in P ^{[11]}.

Hence, at best, Gödel’s reasoning can only be taken to establish that the consistency of P is not provable algorithmically in P.

Gödel’s broader conclusion only follows if P purports to prove its own consistency algorithmically.

However, Gödel’s particular argument, based on his definition of *Wid*(P), does not support this claim.

**Bibliography**

**BBJ03** George S. Boolos, John P. Burgess, Richard C. Jeffrey. 2003. *Computability and Logic* (4th ed). Cambridge University Press, Cambridge.

**Br08** L. E. J. Brouwer. 1908. *The Unreliability of the Logical Principles.* English translation in A. Heyting, Ed. *L. E. J. Brouwer: Collected Works 1: Philosophy and Foundations of Mathematics.* Amsterdam: North Holland / New York: American Elsevier (1975): pp. 107-111.

**Go31** Kurt Gödel. 1931. *On formally undecidable propositions of Principia Mathematica and related systems I.* Translated by Elliott Mendelson. In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York.

**Hi27** David Hilbert. 1927. *The Foundations of Mathematics.* In *The Emergence of Logical Empiricism.* 1996. Garland Publishing Inc.

**Hi30** David Hilbert. 1930. *Die Grundlegung der elementaren Zahlenlehre.* Mathematische Annalen. Vol. 104 (1930), pp. 485-494.

**Me64** Elliott Mendelson. 1964. *Introduction to Mathematical Logic.* Van Norstrand. pp.145-146.

**Ro36** J. Barkley Rosser. 1936. *Extensions of some Theorems of Gödel and Church.* In M. Davis (ed.). 1965. *The Undecidable.* Raven Press, New York. Reprinted from The Journal of Symbolic Logic. Vol.1. pp.87-91.

**Sc67** Joseph R. Schoenfield. 1967. Mathematical Logic. Reprinted 2001. A. K. Peters Ltd., Massachusetts.

**Tu36** Alan Turing. 1936. *On computable numbers, with an application to the Entscheidungsproblem.* Proceedings of the London Mathematical Society, ser. 2. vol. 42 (1936-7), pp.230-265; corrections, Ibid, vol 43 (1937) pp. 544-546.

**Wi56** Ludwig Wittgenstein. 1956. *Remarks on the Foundations of Mathematics.* Edited by G. H. von Wright and R. Rhees. Translated by G. E. M. Anscombe. Basil Blackwell, Oxford.

**Notes**

Return to *: Edited and transcribed from this 2010 preprint. Some of its pedantic conclusions regarding the `soundness’ of the standard interpretation of PA (and consequences thereof) should, however, be treated as qualified by the broader philosophical perspective that treats the standard and algorithmic interpretations of PA as complementary—rather than contradictory—interpretations (as detailed in this post).

Return to 1: We show in this paper that, from a finitary perspective (such as that of this preprint) the proofs of both of Gödel’s celebrated theorems in Go31—his Theorem VI postulating the existence of an undecidable proposition in his formal Peano Arithmetic, P, and his Theorem XI postulating that the consistency of P can be expressed, but not proven, within P—hold vacuously for first order Peano Arithmetic, PA.

Return to 2: Although we have restricted ourselves in this paper to considering only PA, the arguments would—prima facie—apply equally to any first-order theory that contains sufficient Peano Arithmetic in Gödel’s sense (cf. Go31, p.28(2)), by which we mean that every primitive recursive relation is definable within the theory in the sense of Gödel’s Theorems V (Go31, p.22) and VII (Go31, p.29).

Return to 3: Following Hilbert.

Return to 4: Since we cannot, then, have that is PA-provable and that is also PA-provable for any given numeral .

Return to 5: This corresponds to the P-formula of his paper that Gödel defines, and refers to, only by its Gödel-number (cf. Go31, p.25, eqn.(12)).

Return to 6: Gödel refers to these P-formulas only by their Gödel-numbers and respectively (cf. Go31, p.25, eqn.13).

Return to 7: i.e., for any given natural number .

Return to 8: Because the arithmetical relation is a Halting-type of relation (cf.Tu36, ) that is constructively computable as true for any given natural number , although it is not Turing-computable as true for any given natural number (as detailed in this post).

Return to 9: Gödel refers to it only by its Gödel-number (Go31, p.37).

Return to 10: Gödel’s broader conclusion—unchallenged so far but questionable—was that his reasoning could be validly “… carried over, word for word, to the axiom systems of set theory M and of classical mathematics A”.

Return to 11: That Gödel was open to such a possibility in 1931 is evidenced by his remark (Go31, p37) that “… it is conceivable that there might be finitary proofs which cannot be represented in P (or in M or A)”.

## Recent comments