Talk:Peano axioms

WikiProject Mathematics (Rated A-class, Mid-importance)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
 A Class
 Mid Importance
Field: Foundations, logic, and set theory
Archives: 1

Successor

Currently Successor function redirects here, yet its definition is deep in the middle of a section and rather brief. I feel this might not be enough explination for the layman to follow, and it could do with a little expansion. It might also be worth considering reverting Successor function back to a non redirect version. --Salix alba (talk) 16:31, 23 March 2007 (UTC)

Axiom 9

Axiom 9 is a little ambiguous about what K can be. Is it OK for K to contain numbers other than the naturals? --Salix alba (talk) 16:35, 23 March 2007 (UTC)

Sure; K can contain lots of other sets. The axiom is phrased that way because Peano phrased it that way. In the modern context of ZF, you could start with a set K and then use a separation axiom to extract the set of natural numbers in K, so it would be natural to restrict the axiom to sets that only contain natural numbers. But Peano was doing this in 1889 well before axiomatic set theory; the word set in axiom 9 should be read in a natural-language way. CMummert · talk 17:12, 23 March 2007 (UTC)

Peano arithmetic

This sections is lacking in historical info, who first formalised it in this way? The text quotes Kaye 1991, but mathworld has two references with the name before that date:[1]

• Kirby, L. and Paris, J. "Accessible Independence Results for Peano Arithmetic." Bull. London Math. Soc. 14, 285-293, 1982.
• Paris, J. and Harrington, L. "A Mathematical Incompleteness in Peano Arithmetic." In Handbook of Mathematical Logic (Ed. J. Barwise). Amsterdam, Netherlands: North-Holland, pp. 1133-1142, 1977.

I found that the formula

1. $\forall x,y,z ((x+y)+z = x+(y+z))$

might need a little typesetting. It took a second reading to realise that z was not a fuction. --Salix alba (talk) 19:21, 23 March 2007 (UTC)

The idea that addition and multiplication of naturals can be obtained from just successor dates back to at least 1920 (Skolem, "Foundations of elementary arithmetic"). The idea of expressing arithmetic as a first-order rather than second-order theory was certainly known in the 1930s and probably before; it was a subject of interest because the Lowenheim-Skolem theorem had just been proved and its meaning was not yet understood. Kaye (1991) is just used as a contemporary standard reference; the subject of first-order arithmetic is extremely classical. You're right that the article would benefit from a paragraph on this. CMummert · talk 19:57, 23 March 2007 (UTC)
I added material on Charles Sanders Peirce's priority over Peano and Dedekind, citing Peirce's article and a scholarly article by Paul Shields. Kiefer.Wolfowitz (talk) 22:00, 10 April 2010 (UTC)
Thanks. — Carl (CBM · talk) 22:59, 10 April 2010 (UTC)

Logical symbols ⊆ mathematical symbols

"Peano's paper employs a logical symbolism and maintains a clear distinction between mathematical and logical symbols (...)."

I think that logical symbols are mathematical symbols. Should it be "clear distinction between arithmetical and logical symbols"? Jayme 02:13, 21 April 2007 (UTC)

The way things are ordinarily conceived in mathematical logic today, logical symbols such as $\forall$ and $\exists$ (and often including $=$) are not considered "mathematical" per se. Symbols that go beyond the basic logical symbols are considered "mathematical" because they are used to develop mathematical theories using the logic as a starting point. Your viewpoint would be correct if all of logic was commonly viewed as a subfield of mathematics, but it isn't, and the distinction between the two is particularly important for mathematical logic. CMummert · talk 02:21, 21 April 2007 (UTC)

transfinite induction

The axiom excludes well-ordered sets of order type larger than ω. The more general transfinite induction requires a "limit case" property.

to be confusing and incorrect. Complete induction, although not quite correctly defined there, could also be used. For example, replacing:

$\forall \bar{y} (\phi(0,\bar{y}) \land \forall x ( \phi(x,\bar{y})\Rightarrow\phi(x+1,\bar{y})) \Rightarrow \forall x \phi(x,\bar{y}))$

by

$\forall \bar{y} (\forall x ( \forall z(z < x \Rightarrow \phi(z,\bar{y}))\Rightarrow\phi(x,\bar{y})) \Rightarrow \forall x \phi(x,\bar{y}))$

may be an appropriate formalization of complete induction. — Arthur Rubin | (talk) 17:54, 18 July 2007 (UTC)

Perhaps my addition is not needed here. However, it is not clear what you try to say, what is wrong?--Patrick 09:51, 19 July 2007 (UTC)
I thought it was just out of place; the induction axiom also excludes various non-well-ordered models. The second sentence mentions transfinite induction, which I don't think is relevant to Peano arithmetic. — Carl (CBM · talk) 13:01, 19 July 2007 (UTC)

Category-theoretic vs. Categorical

I changed this sec-head b/c 'categorical' means something different (as in having only one model up to isomorphism) and this is one of those areas where this meaning might be the intended/expected. I, for one, came to that section expecting to find a discussion of the categoricity (or non-categoricity) of various formulations of the Peano postulates. Zero sharp 20:48, 10 September 2007 (UTC)

Rewrite

Let me say I fully support Kaustuv's rewrite of the article. It removes a great deal of accumulated redundancy and makes the article more accessible. — Carl (CBM · talk) 13:24, 13 September 2007 (UTC)

I'm afraid I fully oppose it. It uses set-theoretic terminology when the simpler logical terminology will do, and logical terminology where set-theoretic terminology is needed. My reason for reverting it turns out to be incorrect, but the full version of the induction axiom was moved to somewhere I didn't expect to see it. There are probably more things that I disagree with, and some I agree with, but those are the problems that first came to mind. — Arthur Rubin | (talk) 14:36, 13 September 2007 (UTC)
Certainly Kaustuv version isn't perfect, but I think it's a good step forward. I was planning to edit various parts once Kaustuv hd it in place. I'd like to switch back to Kaustuv's version, and I'll be glad to fix problems and address concerns raised here about it. Would that be acceptable? — Carl (CBM · talk) 15:01, 13 September 2007 (UTC)
OK, the structure is better in Kastuv's versions, but the facts are wrong, in some cases subtly. In addition to what I noted, formal mathematics should link to model theory rather than formal systems, where we place what is essentially proof theory. I'm not sure we should place form over substance. — Arthur Rubin | (talk) 15:15, 13 September 2007 (UTC)
We should not place form over substance, but in this case I think the only way to achieve both is to start with a better form and then correct the substance. I significantly edited this page in January to correct various problems with the content [2] , but I didn't pay enough attention to the form. I don't mind working on the new version to fix any problems with the content that might be introduced. I was planning to give the article a detailed copyedit once Kaustuv had finished his edits this morning. — Carl (CBM · talk) 15:26, 13 September 2007 (UTC)
OK, I've reverted my reversion, but I'll keep an eye on the article, as well. Another problem I have is with the form of the axiom. The "current" version of axiom 7 reads:
For every m, nN, if S(m) = S(n), then m = n.
I think it should either be:
For all natural numbers m and n, if S(m) = S(n), then m = n,
or the logical form
$(\forall m)(\forall n)( S(m)=S(n) \rightarrow m=n)$
or
$(\forall m \in \mathrm N)(\forall n \in \mathrm N)( S(m)=S(n) \rightarrow m=n)$,
The mixed logical/natural language forms bother me. — Arthur Rubin | (talk) 16:05, 13 September 2007 (UTC)
(←) I did some editing this afternoon. I sympathize with Arthur Rubin about the wording of the axioms; the previous version [3] shows a format I would vouch for. I am a little concerned with the unhistorical presentation of the axioms, because I don't want the article to claim things about the original 9 axioms that are more recent changes. In particular, the order of the axioms in the previous version is the order Peano presented them in, but the current version of the article has a different order. — Carl (CBM · talk) 18:03, 13 September 2007 (UTC)

I was afraid of strong negative reactions, which is why I didn't commit my rewrite in May. I just want to say that I don't care about this article at all really, so I am not going to argue for my version. Good luck. 19:52, 13 September 2007 (UTC)

On further reflection, I agree with Arthur's point above that the emphasis on set theory is unnecessary. I certainly am no fan of set theory; whenever I need to recall the Peano axioms and their standard properties that are listed in every logic textbook, I re-derive them from the only fact I have committed to memory: that nnos are initial in 1→X→X diagrams. I have changed the statements of the axioms to use a judgemental formulation (that is, using the "is a natural number" judgement). 04:24, 16 September 2007 (UTC)

Heyting arithmetic needs work

That stub should be expanded and there should be some sort of comparison made with PA with regard to realizability and various completness/independence results. Not sure what goes where and how much of it is on WP already as sub- or strangely named articles. Just a note for any interested persons. 19:10, 29 November 2007 (UTC)

Section Models:Nonstandard Models

This section is just wrong about categoricity. First-order PA has many nonstandard models within any particular model of ZFC, and second-order PA has one ('standard') model (up to isomorphism) within each ('standard' or not) model of ZFC. That is what categoricity means. You can't even define the same kind of an isomorphism between models in different set theories as you can between models in the same set theory.

It even contradicts the paragraph directly above.

Xplat (talk) 06:31, 11 December 2007 (UTC)

You're right that that second paragraph got reworded sometime so that instead of saying that each model of set theory has a model of PA that it believes to be standard, it just said each model of set theory has one model of PA. I reworded that paragraph, using the "smallest" model as a stand-in for the standard model because I think that is clearer. On the other hand, it is perfectly possible, working in ZFC, to define an isomorphism between two models of set theory, or between sets in different models of set theory. ZFC is not different from any other first-order theory in that respect. I don't think that the article talks about isomorphisms between different models of set theory, though, and probably shouldn't. — Carl (CBM · talk) 14:36, 11 December 2007 (UTC)
Heh, guess I wasn't quite clear when I said "you can't define the same kind of an isomorphism". What I meant was that an isomorphism between two internal structures in different internal models of ZFC is defined differently than an isomorphism between two structures considered as living directly in an instance of ZFC serving as the host theory of your model theory. The difference is one of detail more than principle, of course, but it's still significant. You can have things happen like two sets with the same elements having different powersets, for instance, which can't happen when working in a single model of ZFC.
In any case, that was a side issue; your edit addressed my concerns excellently.
Xplat (talk) 18:29, 11 December 2007 (UTC)
The paragraph before Carl's edit was confusing because of its context, not so much its content. When discussing categoricity of second-order PA interpreted in second-order logic, it's an unnecessary complication to bring up models of ZFC. What categoricity means is that (up to isomorphism), only one such model exists, period, Platonistically if you like.
You don't gain anything by relativizing to a model of ZFC. If you're a realist about models of ZFC, then you might as well be a realist, period, because models of ZFC can be compared level-by-level to see which one is missing subsets it ought to have, and therefore which one is wrong. If you're not willing to be a realist, period, then you might as well stop talking about models too (except as linguistic metaphors/mental images/convenient figures of speech/what have you). --Trovatore (talk) 18:37, 11 December 2007 (UTC)
So, does the "right" model of ZFC satisfy GCH or not?
If you actually take a look at the categoricity theorem for PA2, there are two major steps to the argument: (1) all minimal models of PA2 are isomorphic and (2) all models of PA2 are minimal. ("Minimal" here means that the domain of first-order quantifiers contains only elements with numerals.) The first step itself divides into (1a) any two minimal models have a one-to-one relation on their domains of individuals that preserves 0 and S, (1b) administrivia extending this to a full isomorphism including any other predefined function or relation symbols in the theory, and (1c) the implicit assumption that the one-to-one relation on the domains of individuals will automatically extend to one between the domains of properties of individuals. This depends on a choice of the semantics of second-order logic, and for some choices it is untrue. For the standard semantics, it is true, but the standard semantics implicitly depends on a choice of some sort of set theory to ground the notion of 'arbitrary subsets of the domain'.
The step (1a) is another point where hidden assumptions come in. Under any metatheory, any reasonable variant of arithmetic will prove inequalities between any two numerals that are not identical, and this lets the proof carry through. However, one's metatheory may actually admit numerals with a nonstandard number of applications of S! This shows that although under any given metatheory, minimal models of PA2 are isomorphic, what counts as a "minimal" model is metatheory-relative.
Step (2) again depends on your semantics for second-order logic, in both of the above ways. If you don't use the standard semantics of SOL, your semantics need to be strong enough to allow the property 'has every inductive property' to be defined. Furthermore, they need to imply a strong enough relationship between the domains of first-order and second-order variables that the statement 'every number has every inductive property' is actually equivalent to the metatheoretical statement 'every number has a numeral' for the proof to go through. On top of that, even once the proof has gone through, you still have the same ambiguity as in (1a) which only gives you one isomorphism class of models per metatheory.
Truly, I am not willing to be a realist, full stop, or even about models of ZFC. I don't believe there's a "True Arithmetic" actually Out There that is negation-complete, or a canonical set of natural numbers, or a canonical tabulation of halting Turing machines (which are actually all the same thing). Nonetheless model theory has its uses. But we might be getting off topic here...
Xplat (talk) 08:12, 15 December 2007 (UTC)

Look, it's fine that you're not a realist and you still want to think about model theory. That describes lots of people. But models either exist or they don't. If they exist then the levels of the von Neumann hierarchy exist and are unique up to unique isomorphisms, GCH is either really true or really false even if we don't know which, etc. If they don't exist then your statements about models have the same status as any mathematical statements referencing objects you presumably don't believe in either. So either way the claim that the full second-order Peano Axioms are categorical is a true statement of mathematics, period, no qualification needed. How you interpret that statement does depend on your foundational philosophy, but not whether you accept the statement itself.

If you don't believe in models as real objects, then the claim that there are different models of ZFC, having different (possibly non-isomorphic) candidates for the canonical model of second-order PA, must be interpreted however you personally go about interpreting claims containing terms (such as "model") that do not denote real objects. But whatever interpretation that is, it will also work for the claim that second-order PA is categorical in second-order logic.

By the way, you seem to be conflating models with theories in the above, particularly when you speak of "only one isomorphism class of models per metatheory". It's not "per methatheory" but rather "per model of the methatheory". It is very important to keep this distinction straight, whether you're a realist or not -- mixing the two things up can easily lead you to outright, unambiguous mathematical errors, not just philosophical errors. --Trovatore (talk) 21:25, 15 December 2007 (UTC)

Induction Axiom vs Induction Schema

The article claims the induction axiom is 2nd order and the induction schema is 1st order. But the way in which the two are stated reads almost identically, if one ignores the superfluous y vector. If there's a distinction here its a very fine one which ought to be made clearer Houseofwealth (talk)

In the section on Arithmetic, regarding + and x, the article states "The respective functions and relations are constructed in second-order logic" But then further down the article states "The arithmetical operations of addition and multiplication and the order relation can also be defined using first-orer axioms." This appears contradictory to me. If it isn't, it would be nice to make the distinction clearer. Houseofwealth (talk) —Preceding comment was added at 00:39, 15 April 2008 (UTC)

The definition of addition (also, ofmultiplication) looks very simple. But there is a logical gap, when it is not say that wishing does not prove existence. Certainly, we desired an operation with such properties, but does not prove existence.Rehernan (talk) 05:06, 22 June 2013 (UTC)

Distributive Property

How does one prove that multiplication distributes over addition for natural numbers? That was just stated in the arithmetic section without explanation. Eebster the Great (talk) 17:48, 26 May 2008 (UTC)

A nifty question. Here's a shot at a proof without looking it up. I'm sure there's a one-liner proof out there.
The question becomes even more challenging if we restrict our thinking to a "Peano machine" (it is Turing-equivalent) with only four instructions (generalized behaviors) that prescribe the motions of the machine, plus "HALT"; this machine works on an unbounded number of "registers" r named a, b, ... p, q, r, ... etc. The various "numbers" exist as "counts" in the "registers" (tally marks on a piece of paper ruled into discrete boxes, pebbles in a various holes, etc). The machine executes a "program" -- a sequence of motions -- from the following instruction set: { CLeaR contents of register r (CLR r) -- empty the register (invokes notion of "zero"), INCrement the contents of register r (INC r), If contents of register p Equals the contents of register q then Jump to instruction z (JE p,q,z), unconditional Jump to instruction z (J z), HALT }.
Given these primitive "axioms", how can we know that distribution a*(b+c) = a*b + a*c is in fact "legal"? What do we have to do to prove this? For that matter, why do we assume that commutation a+b = b+a and a*b = b*a are "legal"?:
1 First we have to define the notions of "multiplication" from "addition" -- multiplication is defined in terms of successive additions -- given that "addition" is, in turn, defined in terms of successive increments. Some simple looping sub-programs take care of this. We have to define the "additive zero", and the "multiplicative unit 1" -- for all n, 1*n = n -- and we have to define the notion of a "multiplicative zero" i.e. for all n, n*0 = 0. (There also is a need for the commutation axiom or an inductive proof of commutation, or a defintion. Do we need a proof for a+b = b+a? I suspect that this can be proven.)
2 Given s is any integer, s = s+0
• Given a*(s) =def a*s and s = s+0 then a*s = a*(s) = a*(s+0) ; the definition of the additive identity
• Likewise a*s = a*s + 0
• Therefore a*s = a*(s) = a*(s+0) = a*(s) + 0 ; symbol string a*(s) equals both a*(s+0) and a*(s), i.e.:
• a*(s+0) = a*s + 0
• But we know also that a*0 = 0 ;the multiplicative "zero"
• So by equivalence of symbol strings,
• a*(s+0) = a*s + a*0
3 Something similar happens when we consider "1" -- the multiplicative identity
• Given that s = (a+b), then s = 1*s = 1*(a+b) = (a+b)
• And, since 1*a = a and 1*b = b, then (a+b) = 1*a + 1*b
• Therefore, 1*(a+b) = 1*a + 1*b
4 Now we have to proceed by induction, each time adding 1*(a+b) to the previous symbol-string
• Given that 1*(s)= s no matter what "s" is, then we've seen from above that:
• 1*(a+b) = 1*a+1*b
• Add s=(a+b) to itself, i.e. s + s = (a+b)+(a+b) = 1*(a+b) + 1*(a+b) = (1*a + 1*b) + (1*a + 1*b)
• 1*s + 1*s = 1*a + 1*a + 1*b + 1*b
• From the above we have: s + s = a + a + b + b
• s + s =def 2*s, a + a =def 2*a, b + b =def 2*b, etc
• Thus 2*s = 2*a + 2*b ;now we just have to be convinced that for all n, n+n = 2*n
• Thus, since s = a+b, 2*(a+b) = 2*a + 2*b
• We just continue this process of adding 1*(a+b) = 1*a + 1*b to the previous sums, ad infinitum ;i.e. invoke the axiom of induction

Bill Wvbailey (talk) 15:25, 27 May 2008 (UTC)

Oh, thanks, I see that now. I think an induction proof could be a little conciser (anchor at $k = 0$, then use the recursive definition of multiplication to get $k(a + b) = ka + kb \to (k + 1)(a + b) = k(a + b) + (a + b) = ka + kb + a + b = ka + a + kb + b = (ka + a) + (kb + b) = (k + 1)a + (k + 1)b$.) Still, I think that explanation helped me out. Eebster the Great (talk) 22:38, 27 May 2008 (UTC)

Redundancy of n*0=0

A comment regarding this reversion. I thought of reverting it myself, but held back because I agree that it is redundant. The reverted edit used cancellation (which is certainly a property of addition, proved using induction), but here is a more elementary proof (in Coq):

Lemma times_n_zero : forall n : nat, n * 0 = 0.
Proof.
induction n.
trivial.
simpl in |- *. trivial.
Qed.


The simpl step just rewrites (S n) * 0 to n * 0, which can be proved from the other axioms without induction. Of course the whole axiom is not derivable without the induction principle/schemata. Cursorily, it seems to be the only one in the system PA- not independent of the rest in the presence of induction. 13:22, 27 August 2008 (UTC)

I was possibly a bit quick to revert the removal of n*0=0, I thought it better to revert and then we could have a discussion here. You may well be right that it is not needed In the alternative axiomatizations its not clear that we have a successor operation, axiom 14 may help. Ideally we should refer to the source Kaye 1991 for whether the axiom is included or not. --Salix alba (talk) 16:22, 27 August 2008 (UTC)
I have just verified the axioms from Kaye 1991 pp. 16-18. Kaye's axiom 6 is as currently stated. The problem came from this edit [4] which didn't realize these axioms are taken directly from Kaye. I added a hidden note to the page source about it. — Carl (CBM · talk) 17:48, 27 August 2008 (UTC)
By the way, the successor operation is well defined in any model of PA-. If y > x, then there is a z s.t. x + z = y. Thus z > 0 (otherwise y = x), which means z ≥ 1, which means y = x + z ≥ x + 1. These steps correspond to various axioms of PA-. — Carl (CBM · talk) 18:09, 27 August 2008 (UTC)
I don't see how you can prove that 0*0 = 0 without n*0=0. --Raijinili (talk) 09:06, 6 November 2008 (UTC)
Well, you can with this particular set of axioms, but the axioms do include n*0 = 0 as well. Start with
0*0 = 0*(0+0) = 0*0 + 0*0
which corresponds to axioms 6 and 5. View this as being in the form
a = a + c   (1)
We're going to reason about c. If c is 0, then we're done. Otherwise c > 0, by the order axioms. But then a + 0 < a + c by axiom 11, which means a < a + c because a + 0 = a from axiom 6. But this means that a < a because a = a + c from (1). This contradicts axiom 9. — Carl (CBM · talk) 13:40, 6 November 2008 (UTC)
Oh. Never worked with order much before. --Raijinili (talk) 04:45, 7 November 2008 (UTC)

Axiom of induction

It's not just a method of reasoning. It also makes the set of natural numbers well-defined.

Say that I have the regular natural numbers, and I throw a new element in there, called $. We can take successors of$, and this new set of numbers generated by $and 0 can also be called "the natural numbers" by the first eight axioms. In fact, we can even throw in the inverse successors of$ with no issue (that is, x such that S(x) = $). The axiom of induction implies that, basically, since$ isn't guaranteed to be a natural number by induction, it's not a natural number. --Raijinili (talk) 08:54, 6 November 2008 (UTC)

The article says that the induction axiom is "a method of reasoning about all natural numbers" (emphasis mine). Indeed, as you point out, one shows that the natural numbers N satisfies:
$\forall n \in N.\ n = 0 \lor \exists m \in N.\ S m = n$
by using the predicative form of the axiom for the predicate $\phi$ defined as:
$\phi(n) \triangleq n = 0 \lor \exists m \in N.\ S m = n$.
I don't see what makes $\phi$ more special than any other inductive property of the naturals. The quoted sentence could perhaps be improved by replacing "all" with "the set of". 15:07, 6 November 2008 (UTC)
What's that triangle? --Raijinili (talk) 05:59, 7 November 2008 (UTC)
Some people use that to mean that the left side is being defined as the right side of the equation, sort of like := in some programming languages. — Carl (CBM · talk) 13:12, 8 November 2008 (UTC)
Well, my point was that without the axiom of induction, the set of natural numbers isn't well-defined up to isomorphism over the successor relation. --Raijinili (talk) 04:44, 12 November 2008 (UTC)

I agree that the "method of reasoning" phrase is misleading. My way of looking at the axioms has always been:

• 5 & 6 say that 0, S(0), S(S(0)), etc. exist.
• 7 & 8 say that 0, S(0), S(S(0)), etc. are distinct.
• 9 says that 0, S(0), S(S(0)), etc. are all there is (that is, they exhaust the natural numbers).

Thus, my interpretation of 9 isn't as some strange ethereal tool for reasoning about natural numbers, but as a basic combinatorial fact which gives us the sort of structure we want in which every natural number can be reached from 0 by applying the successor relation. Incidentally, the article confusingly implies that this fact follows from 5 & 6 when it says "in general, any natural number n is Sn(0)" after introducing these axioms. I hope these problems can be cleared up, though I feel unqualified to reorganize the entire discussion of the axioms myself. --kine (talk) 06:12, 12 November 2008 (UTC)

I don't think the interpretation of 9 is that thats all there is. Raijinili above shows an intuition of why, and also somewhere in the article is said that there are 'non-standard' models of the naturals (ie same axioms but different from the other natural numbers). On the other hand, given those axioms you allow for there to be more proofs than otherwise, and also, note that if you define proof as emanating from these axioms, you won't be able to say much about any element that is not 0 or S^n(0) for some n. It may be good to put this in the article, maybe, as a way to clarify what is meant by a non standard model. —Preceding unsigned comment added by 128.30.87.46 (talk) 22:44, 11 August 2009 (UTC)

I guess that two formulations of the axiom 9 are equivalent and share the same problem: They refer to something that wasn't defined - what does the "natural number" mean. Let's look to formalization of what the author said:

$(\varphi(0) \wedge \forall n ~ \varphi(n) \rightarrow \varphi(S(n))) \rightarrow (\forall n ~ \varphi(n) \rightarrow \mathcal{N}(n))$,

where predicate $\mathcal{N}$ (reading as "is the natural number") was mentioned, but wasn't defined.

Actually, I don't see any difference between $n \in K$ (in the first author's formulation of the axiom 9) and $\varphi(n)$ (in the second author's formulation of the axiom 9), though I've wrote the formula for the last case. But I see the common problem: Nobody knows what does the predicate $\mathcal{N}$ means.

I can propose the definition: $\forall n ~ \mathcal{N}(n) \leftrightarrow (n=0 \vee \exists m ~ \mathcal{N}(m) \wedge n=S(m))$, but it isn't the same that was written in formulations of the axiom 9...

--Eugepros (talk) 13:03, 10 September 2009 (UTC)

In any axiomatic framework, there are things that are not defined, the so-called primitive concepts. In plane geometry, these are "point" and "line". In Peano arithmetic, there is a single primitive concept: natural number. The Peano axioms do not define what natural numbers are, they instead describe certain properties of natural numbers that can be used to reason about natural numbers. However, in second-order logic there is only one model of the Peano axioms (up to isomorphism) and so the axioms do suffice to determine all properties of the natural numbers. One could say, informally, that the Peano axioms give an implicit definition of the natural numbers.
The most "natural" way to define the natural numbers is via an inductive definition:
1. 0 is a natural number
2. For any object x, if x is a natural number than so is S(x)
3. An object is only a natural number if it is forced to be one by rules #1 and #2
The difficulty here is that rule #3 is inherently second-order. The axiom of induction in Peano arithmetic is meant to agree with this inductive definition, in a certain way. But the inductive definition itself is not part of the Peano axioms; they simply take "natural number" to be an undefined concept. — Carl (CBM · talk) 14:11, 10 September 2009 (UTC)

Tnank you. I understand that there are primitive concepts. For example in set theory such a concept is "set". But formal theory doesn't refer to such a concept explicitly: In ZFC all objects are "sets" and we don't need to define predicate "is the set". But here the author formulates the axiom 9 by such a way that it refers to predicate "is the natural number" explicitly.

Вy the way, I've made a mistake, correct formalization shold look as:

$(\varphi(0) \wedge \forall n ~ \varphi(n) \rightarrow \varphi(S(n))) \rightarrow (\forall n ~ \mathcal{N}(n) \rightarrow \varphi(n))$.

If $K := \{n ~ : ~ \varphi(n)\}$, then it means exactly the same as the first author's formulation.

I understand that it's "second order", because first order predicate calculus cannot formalize the clause: "For any formula $\varphi$...". But there is a solution: It can be formilized in meta-theory. The meta-theory can assert, that: "For any formula of Peano arithmetic there is such an axiom...":

$(\forall \varphi \in PA) ~ PA \vdash (\varphi(0) \wedge \forall n ~ \varphi(n) \rightarrow \varphi(S(n))) \rightarrow \forall n ~ \varphi(n)$.

It's the definition of standard "schema of induction". But, as you can see, here we've lost part of the source sentence: $\dots \mathcal{N}(n) \rightarrow \dots$. It's obvious why: because the predicate $\mathcal{N}$ is not defined in the language of Peano arithmetic.

--Eugepros (talk) 06:15, 11 September 2009 (UTC)

But the axioms of ZFC, when written in English, do refer to the predicate "is a set". Compare the article ZFC, which has axioms such as "If x and y are sets, then there exists a set which contains x and y as elements.". This is just a façon de parler that is often employed in writing axioms.
The article here does not state a formula version of any of the axioms, only the English versions. The formula version of axiom 9 would be:
$\forall K ([0 \in K \land \forall n ( n \in K \to Sn \in K)] \to \forall n ( n \in K)).$
There is no need for a predicate $\mathcal{N}$ there. — Carl (CBM · talk) 11:43, 11 September 2009 (UTC)
Also: the second-order version is much stronger than the version, stated in the metalanguage, that says "for any formula φ". The second-order version quantifies over all subsets of the naturals, even subsets for which there is no defining formula. — Carl (CBM · talk) 12:23, 11 September 2009 (UTC)

OK, your last comment ansvers to my first question, that I wanted to ask. But I have the second question:

What is the theory, that can accept this axiom?

In the set theory it's obviously wrong: There are sets, those include all naturals ($\mathbb{N} \subseteq K$), but $\forall n (n \in K)$ is wrong for them. The last thing claims $K$ to include ALL objects of the theory. In the arithmetic this axiom cannot be expressed, because it knows nothing about sets...

--Eugepros (talk) 12:49, 11 September 2009 (UTC)

You're asking which theory has the axiom
$\forall K ([0 \in K \land \forall n ( n \in K \to Sn \in K)] \to \forall n ( n \in K))$
in its language? Answer: second-order arithmetic. Note that, because Peano arithmetic is just about numbers, the quantifier $\forall n$ does just quantify over numbers. The second-order quantifier $\forall K$ quantifies over sets of numbers. — Carl (CBM · talk) 13:04, 11 September 2009 (UTC)

Did I understand it correct, that the second order arithmetic cannot be expressed in first-order logic, because it uses special syntax: upper-case letter after a quantifier differs from lower-case? And this theory should know something about sets, but less than the set theory?

And why should we deal with all those matters, when there is the simplier way? This axiom:

$\forall K ([0 \in K \wedge \forall n ( n \in K \to S(n) \in K)] \to \forall n (n \in \mathbb{N} \to n \in K))$

can be added to ZFC with additional constant $\mathbb{N}$. Then we can prove, that $\mathbb{N}$ is the minimal inductive set and that it exists and unique. I note, that it's almost your formula, but with additional precondition "$\dots n \in \mathbb{N} \rightarrow \dots$" in the right part.

--Eugepros (talk) 15:28, 11 September 2009 (UTC)

Second-order arithmetic can be expressed in first-order logic, but its strength only comes when one uses second-order semantics. It does indeed know a little bit of set theory (basically, just sets of natural numbers), but is much weaker than set theory.
One does not need the Peano axioms in ZFC, since one can define the natural numbers there using just the ZFC axioms. The point of the Peano axioms is when you want to study arithmetic as its own theory, not inside set theory. One can verify in ZFC that the natural numbers do satisfy the Peano axioms, and thus the Peano axioms are consistent. But the point of the axioms is stand alone, just like a theory of geometry. — Carl (CBM · talk) 22:07, 11 September 2009 (UTC)

Carl, can I ask you one more stupid question? If we interpret arithmetic not in ZFC, but in General set theory (that's because I have doubts about existence of infinite sets), can we prove, that it's categorical theory? Assuming, that 9th axiom is given in second-order form.

--Eugepros (talk) 07:15, 21 October 2009 (UTC)

No. If you try to work semantically, GST does not prove there is any model of PA, much less a categorical one. Actually GST has the same proof theoretic strength as PA, which means that if if you work with PA syntactically inside GST, rather than semantically, GST will still not be able to prove that PA is consistent. Basically, GST and PA are two different ways of talking about finite sets: GST uses set-theoretic language while PA uses the language of natural numbers. — Carl (CBM · talk) 10:38, 21 October 2009 (UTC)

Does it mean, that our belief in existence of infinite sets is necessary to be sure, that aritmetics (in second order form) is categorical theory? And if I'm sceptical about infinities, then I won't be sure, that my comprehension of natural numbers is "standard"?

--Eugepros (talk) 13:42, 21 October 2009 (UTC)

If you do not believe in infinite sets, then you do not believe that there is a set containing all the natural numbers, in which case you have more serious problems to worry about than whether Peano arithmetic is a categorical theory. If you do not believe in infinite sets then there is no model at all of the Peano axioms. Of course, in a trivial sense, that means that every two models are isomorphic...
On the other hand, when we say "natural number" in real life, we know exactly what we mean, and we mean the standard type of natural number, not an element of a nonstandard model of Peano arithmetic. There is no danger of accidentally running into a nonstandard number in real life. — Carl (CBM · talk) 13:52, 21 October 2009 (UTC)
What exactly do you both mean by "infinite"? Are you speaking of a completed infinite or of an intuitionistic never-to-be completed infinite? Correct me if I'm wrong, but Peano induction fits nicely with either the intuitionistic or constructivist infinite or with Hilbert's axiomatic Formalism (in which he invokes the axiom). Via Peano induction the "infinite" is extensible ad nauseum, and this doesn't offend either the intuitionist/constructist, nor the Formalist. Eugepros can decline to believe in completed infinite sets e.g. symbolized by a symbol ω so one can talk about NOT-ω, but still believe ("intuitively") in an infinitely-extensible-but-never-to-be-completed set for which NOT-ω is meaningless. But now when Eugepros uses reductio ad absurdum he/she had better be cautious not to invoke a completed infinity.
(Here's an interesting (spooky) explanation of the metaphysics behind this. It has to do with assertions about completed past and completing present versus the uncompleted, unknowable future. The unknowable future leads some metaphysicans to argue against incorrect use the Law of Excluded Middle (LoEM) with respect to truth of hypotheticals such as Aristotle's example p: "There will be a naval battle tomorrow". For some metaphysicians application of the LoEM p V ~p to Aristotle's example is meaningless -- as p and ~p lie "uncompleted" in the future, neither p nor ~p have meaning. Thus the LoEM can be properly applied only to the completed past and the completing present, never to uncompleted hypotheticals. Andrews 1996 gives a closer-to-Peano-induction example p: "There is an uninterrupted run of 1000 nines in the decimal expansion of B" -- ~p is unprovable, no matter how far out your mu-operator cranks the computation, it may never terminate, so you may never know by (in-)exhaustive Peano-induction. cf User:Morton Shumway's discovery of Andrews' interesting paper: http://www2.swgc.mun.ca/animus/Articles/Volume%201/andrews.pdf). Bill Wvbailey (talk) 17:08, 21 October 2009 (UTC)
Sure, but if you want to talk about a theory being "categorical" then you have to actually have models of the theory, and in the case of the Peano axioms a model would be a completed infinity. This is why constructive results are often very syntactical, because constructivists can make perfect sense out of "Peano arithmetic is syntactically consistent" even if they do not believe there is a completed model of Peano arithmetic. Similarly they can prove "the product of two even numbers is always even" even if there is no set containing all the even numbers. A computer science way to look at this is to view the natural numbers as a type, rather than as a set. — Carl (CBM · talk) 17:38, 21 October 2009 (UTC)

Wvbailey, I meant by "infinity" the corresponding axiom of set theory: "There is such a set, that contains successors of all its elements". As far as I know, it means "completed" or "actual" infinity, but not "becoming" or "potential" one. I don't refuse that infinity categorically, but I'm sceptical about it (cannot accept the axiom). If I understand it right, the point of view: "don't refuse categorically, but sceptical" - ill conforms to the law of excluded middle. So, it means, that I should use intuitionistic predicate calculus. I would denote my position as "constructivism", if I haven't heard, that many constructivists unconditionally accepted axiom of infinity.

Carl, yes, I "do not believe that there is a set containing all the natural numbers". But I cannot assert, that "there is no model at all of the Peano axioms". I'm simply unaware of it. In real life I interpret "natural number" as a string of notches like this: "|||||||". But there is the danger to collide with nonstandard number "in real life", here is the example: The Goodstein's theorem will be provable in second-order arithmetic, if we can use infinit ordinal numbers. But there is contradictory example for first-order arithmetic. This contradictory example is a nonstandard number. I don't understand how this number can be written as a string of "|", therefore this example means nothing for me. But someone, who believes in infinities, would prove, that such a number "really exists". I would like to prove Goodstein's theorem without usage of infinities. Do I have a chance?

--Eugepros (talk) 09:59, 22 October 2009 (UTC)

No, someone who believes in infinitary methods would not believe such a number "exists" as a standard natural number. Nonstandard numbers arise because first-order Peano arithmetic is not capable of properly defining "finite", but this does not mean that we as human beings have any confusion about what a finite string is. Some models of Peano arithmetic have nonstandard numbers, but this only means those models are wrong about what the natural numbers are.
Usually, the term "provable without the usage of infinities" is made precise as "provable in primitive recursive arithmetic (PRA). Since PRA is weaker than Peano Arithmetic, and Goodstein's theorem is not provable in Peano Arithmetic, you will not be able to prove Goodstein's theorem in PRA. — Carl (CBM · talk) 11:15, 22 October 2009 (UTC)

It's very strange situation: To be capable of properly defining "finite", we have to believe that something "infinite" exists. Or is there another way? As far as I know, defining an impossible property usually is not a problem. Example: the property "to be set of all sets" is impossible - it's definable, but not existent. Why the property "infinite" must be existent to be definable? Or not?

Concerning proof without the usage of infinities: I don't understand where proofs in first-order PA (or in GST) use infinities. Why should we limit ourselves to PRA?

--Eugepros (talk) 13:42, 22 October 2009 (UTC)

It is not necessary to define "infinite" in order to define "finite". If you want to stop using set theory, you have to really stop using set theory. One way to define things without set theory is via inductive definitions, which are not read as definitions in set theory but simply as definitions in English. For example, a set is finite if it is empty, or if it is obtained by adding one element to some other finite set.
Peano arithmetic uses infinities in its proofs because the induction axioms can include quantifiers over the entire set of natural numbers. If one is going to deny that the set of natural numbers actually exists, one can hardly accept quantifying over this set. In primitive recursive arithmetic, the only induction that is present is for formulas that do not quantify over the natural numbers (in fact, primitive recursive arithmetic is a "quantifier free" theory of arithmetic).
I think that this conversation has become off-topic for this talk page, since we are not really talking at all about how to improve the article. You might want to ask any future questions at the math reference desk. Also, you will get a wider selection of answers there, rather than just my personal perspective. — Carl (CBM · talk) 13:51, 22 October 2009 (UTC)
It's on-topic, though, for the Law of Excluded Middle article, and probably the Laws of thought. W.r.t the LoEM and the infinite, User:Morton Shumway raised some questions concerning its metaphysical background (e.g. the philosopher Hegel disallowed the LoEM, for example); this sent me back to Aristotle and Plato and forward from there . . . the talk page there reflects some recent historical reference-research that I and Shumway have been slowly adding. I've also created a User:Wvbailey/Law of Excluded Middle collection-point that I'm fleshing out with every piece of history I can come up with. My assumption is that metaphysics of the infinite inform a person's mathematics-foundational outlook, but I am also discovering it has a (tacit) role in the Philosophy of mind, etc. etc. If either of you know of any good articles etc on either topic (law of excluded middle, laws of thought) please lemme know. Thanks, Bill Wvbailey (talk) 15:19, 22 October 2009 (UTC)
You don't need infinities to prove Goodstein's theorem, if you can accept the idea that there is a lexicographical ordering on finite trees, and that each move in the "hydra game" (repeatedly chopping off a branch from a tree and replacing it with branches closer to the root), changes the tree to one of lower lexicographical rank. This is equivalent to the statement that epsilon nought is well-ordered, and also allows a finitary proof of the consistency of PA (Gentzen's consistency proof). Note of course that this principle of induction on trees is strictly more powerful than PA's induction on natural numbers, and is itself not provable in PA. Gentzen's proof is mentioned in the article in terms of Turing machines but I find the hydra metaphor to be more intuitive. 66.127.55.192 (talk) 05:41, 23 January 2010 (UTC)

zero in axiom 7 and 9

I think it is not necessary to assume that the zero of axiom 7 and that of axiom 9 are the same natural number. Consider:

A1: for all n in N: Sn in N

A2: there is at least one e in N: for all n in N Sne

A3: for all n, m in N: if Sn=Sm then n=m

A4: there is at least ine e‘ in N: if [Pe‘ and (for all n in N: if Pn then PSn)] then for all n in N: Pn

It is not difficult to prove that an e‘ chosen from A4 also has the property of e of A2. After that is is not difficult to prove that e and e‘ are uniquely defined and e=e‘.

Although Peano did not express this, should this observation not be mentioned? Jos.koot (talk) 10:31, 14 April 2009 (UTC)

I don't see why this variation of the axioms would be worth mentioning, unless it has actually been studied and applied by someone. There are all sorts of minor variations that can be made to the axioms, but in general they aren't going to be of encyclopedic interest. — Carl (CBM · talk) 11:28, 14 April 2009 (UTC)
I find the idea interesting that the axioms can be replaced by seamingly weaker axioms without loosing strength. Jos.koot (talk) 15:13, 14 April 2009 (UTC)
If one removes 0 from the signature, then there are no longer any closed terms, which is a technical nuisance (for example, the diagonal lemma assumes that there is a closed term for each natural number). So people would immediately require a definitional extension to regain 0; but then they would be back at the commonly-used signature and axioms. So I don't see that there is really much mathematical interest in studying Peano arithmetic in a language that does not contain 0; can you point at any literature that discusses it? — Carl (CBM · talk) 17:34, 14 April 2009 (UTC)
The axioms of Peano do not imply 0 to represent zero. The meaning of 0 can be any natural number. A1..A4 do not remove 0 from the set. Jos.koot (talk) 15:16, 3 May 2009 (UTC)
However the term "0" does represent the least natural number in the model of Peano arithmetic at hand. As I was saying, without the symbol "0" there are no closed terms at all. But if one is going to include 0 in the signature, then there is no reason to beat around the bush with axioms that refer to it only indirectly. — Carl (CBM · talk) 15:18, 3 May 2009 (UTC)
Axioms A1..A4 do not remove the least natural number. It can be proven that the axioms allow to be proven the existence of one unique least natural number. Jos.koot (talk) 18:20, 3 May 2009 (UTC)
Sure. My point is that there are important reasons for having 0 in the signature. I noticed that the article was not explicit about the signature, so I added a sentence. — Carl (CBM · talk) 21:17, 3 May 2009 (UTC)
After proving that e and e' are unique and e=e', the signature is established. Jos.koot (talk) 16:06, 4 May 2009 (UTC)
See signature (mathematical logic). The ordinary signature for Peano arithmetic has a constant symbol "0", a unary function symbol "S", and the equality relation symbol. — Carl (CBM · talk) 16:50, 4 May 2009 (UTC)
Aside: That is for second-order Peano arithmetic. For the first-order system, one normally also includes binary function symbols "+" and "×" (since leaving them out gives you a much weaker system). Algebraist 17:02, 4 May 2009 (UTC)
First-order PA with only successor is able to define the addition and multiplication functions, and so one can make a definitional extension that includes them if one wants. So the axiom system in a signature with with only successor and 0 is just as strong as the semiring version, not weaker; there isn't any benefit in this context to second order PA. You're right that the semiring operations are included from the start in texts like Kaye's book. This is briefly discussed explained in the article in the section "equivalent axiomatizations". — Carl (CBM · talk) 17:23, 4 May 2009 (UTC)
First-order PA with only successor is able to do no such thing. It's just the theory of a set N equipped with a function S that is injective, takes every value except 0, and has no cycles (proof: all these statements are clearly true in (N,0,S) and the theory I've just described is categorical in uncountable cardinals, hence complete). Thus the disjoint union of the natural numbers with the integers is a model of first-order PA with only successor, but there's no way of defining + and × to make it into a model of first-order PA. Algebraist 17:32, 4 May 2009 (UTC)
You're certainly right that it isn't possible to define addition and multiplication to make that a model of first-order PA. However, I would say it's the induction, rather than the signature, that's the issue in your example. I am so used to the usual first-order PA that it takes me a while to even think about the idea of PA that starts without addition and multiplication. But I understand what you're saying in any case. By the time you add necessary induction I am thinking of you have either expanded the signature or have moved in spirit to second order logic. — Carl (CBM · talk) 00:36, 5 May 2009 (UTC)
Yes. The first-order language with just S and 0 is not very expressive (the theory we're talking about eliminates quantifiers in that language, and it's clear you can't say much with a quantifier-free formula), so the induction axioms it can state are not very strong. Even if you expand the signature by adding "+", the theory you get is pretty weak: you really do need both "+" and "×" to be able to state enough induction axioms to get anywhere. Algebraist 13:55, 5 May 2009 (UTC)
How does your A4 imply your A2? 17:47, 14 April 2009 (UTC)
See http://www.telefonica.net/web2/koot/Peano.mht Jos.koot (talk) 15:32, 3 May 2009 (UTC)
I can't open that file, and I doubt many other people can unless they happen to have a computer with internet explorer on it. Can you put it in an open format such as PDF? — Carl (CBM · talk) 16:58, 3 May 2009 (UTC)
Can you open http://www.telefonica.net/web2/koot/Peano.doc ? Jos.koot (talk) 18:16, 3 May 2009 (UTC)
Yes, fortunately openoffice can open that. PDF is really the way to go, though. — Carl (CBM · talk) 21:17, 3 May 2009 (UTC)
Your reasoning for your theorem 2 is circular. You suppose the negation of A2, and then conclude that A2 is contradicted.
I don't believe that the following proposition is true in pure classical second order logic with equality:
$\forall z \in N.\ (\forall P \in N \to o.\ P\,z \Rightarrow (\forall n \in N.\ P\,n \Rightarrow P(S\,n)) \Rightarrow \forall n \in N.\ P\,n) \Rightarrow \forall n \in N.\ S\,n \neq z$.
If this is not what you are proving, please restate what you want to prove more formally and unambiguously. 06:25, 6 May 2009 (UTC)
Here is a different exposition. — Carl (CBM · talk) 13:20, 6 May 2009 (UTC)

We work in second order logic. The signature has equality and a unary function symbol S. We take A1–A4 from above as the axioms. We want to show that all the Peano postulates hold. Looking at them, we need to show that 5 (which is trivial), 7, and 9 hold, because postulate 6 is trivial and 8 is our A3.

Begin by adding to the signature a constant symbol 0, and adding an axiom that says that 0 satisfies axiom A4:

$\forall P ([P0 \land \forall n (Pn \to PSn)] \to \forall n Pn)$ (A5)

This extended signature and theory is a definitional extension of the original and thus has exactly the same models. Moreover, axiom A5 is exactly Peano postulate 9, so only postulate 7 remains. So we must prove: There is no n with Sn = 0.

To prove this, suppose 0 = Sp for some p. Let P(n) be the formula $\exists x ( n = Sx)$. Then we have assumed that P(0) holds, and clearly P(Sm) holds for all m, so by axiom A5, we have $\forall n P(n)$, that is, $\forall n \exists x ( n = Sx)$. This contradicts axiom A2.

At this point, we have regained all the Peano postulates. The proof the 0 is the only element that is not a successor is then the same as in PA.

From Suppes 1957

Suppes 1957 indirectly deals with a uniqueness axiom for zero when (operationally) the notion of zero is applied to division. The first subchapter is §8.5 The Problem of Division by Zero. This he follows up with §8.6 Conditional Definitions (where he discusses "eliminating all the 'interesting' cases) and §8.7 Five approaches to Division by Zero. The following is from Suppes 1957:163-169:

§8.5 The Problem of Division by Zero.
"That everything is not for the best in this best of all possible words, even in mathematics, is well illustrated by the vexing problem of defining the operation of division in the elementary theory of arithmetic. If we introduce the definition:
(1) x/y=z if and only if x = y*z
"we realize immediately that (1) does not satisfy the fourth restriction for equivalences definition operation symbols. For we cannot prove that given any two numbers x and y there is a unique z such that x = y*z. For instance, there is no z such that 1 = 0*z; and any number z has the property that 0 = 0*z.)...
"In spite of the difficulties besetting us there is a formally satsifactory way of defining division by zero. It is a so-called axiom-free definition since it requires no previous theorem to justify it. It does require that when y = 0, then x/y=0. Because of the several quantifiers occurring in the definiens we use logical notation to state the definition:
" x/y = z ←→ (z')[z' = z ←→ x = y*z'] V [-(∃w)(z')(z' = w ←→ x = y*z') & z = 0]
[NOTE: This is a rather difficult definition in part because of Suppes's symbolism. Suppes is using the symbols as follows: ←→ means "if and only if" i.e. "is logically equivalent to", = means " identical to ", (z') means "for all (nowadays written ∀) numbers with the symbol z' ", " V " is logical inclusive OR, " - " is logical NOT, ∃ means "there exists at least one example of". The identity sign " = " is actually a predicate, a function that outputs { true, false }. So in words
"x/y is logically equivalent to EITHER OR BOTH of the following statements:
(a) For all numbers z', the notion " z' is identical to z " is logically equivalent to the notion " x is identical to y*x' "
OR (b) It's not the case that a number w exists such that, for all numbers z', the notion " z' is identical to w " is logically equivalent to the notion " x is identical to y*z' " AND at the same time the notion " z is identical to 0 ".]
"The complicated character of (5) argues strongly for some other solution, which we turn to in the next section. / Here it will suffice to say that there seems to be no method of handling division by zero which is uniformly satisfactory." (Suppes 1957:163-164)
"§8.7 Five approaches to Division by Zero [etc.]"

For a curious correspondent I typed in all of §8.7 at Talk:Division by zero. Bill Wvbailey (talk) 20:45, 14 April 2009 (UTC)

Successor is a function?

I've had a great deal of trouble proving that if x=y, then S(x)=S(y); i.e., S(x) is a function. This can be proved for specific, variable-free terms (e.g., if 0+0=0, then S(0+0)=S(0)), but as far as I can tell, not in general for terms with variables. Other lists of the axioms I've seen (e.g., Mendelson 1997) state this as an axiom. Is there something about the construction here I'm missing, or should the axiom be added?

It's important for proving associativity and commutativity of addition and multiplication. Krohneew (talk) 23:37, 11 June 2010 (UTC)

In Hilbert-style deduction, it's a logical axiom — because equality really means that two things are exactly the same, this implication is automatic, and does not say anything at all about S per se. Usually we enumerate only the non-logical axioms, the ones that put an actual restriction on what sorts of interpretation the symbols can have. --Trovatore (talk) 23:58, 11 June 2010 (UTC)
The semantics of first-order logic require that a function symbol ("S") has to be interpreted as a function. If you have Mendelson's 4th edition this is on page 57, as part of the definition of an "interpretation". So in every interpretation, if $x_1 = x_2$ then $S(x_1) = S(x_2)$ because of this definition. Moreover, because anything true in every interpretation is provable, under any complete set of proof rules, Mendelson's axiom S2 is already provable without assuming any axioms at all.
In order to create a complete proof system, most authors include the so-called "axioms of equality". One of these says that given any formula φ, if a second formula ψ is created by replacing zero or more free instances of a variable a in φ with the variable b then
$(a = b \land \phi) \vdash \psi$
In this case, if you let φ be $S(x_1) = S(x_1)$ and let ψ be $S(x_1) = S(x_2)$ then you can use the proof rule I just mentioned to prove Mendelson's axiom S2. So it is not necessary to assume S2 in any logic that includes the rules for equality.
Mendelson, for whatever reason, seems to include some of the axioms of equality as axioms of his theories. However, he discusses theories with equality on pp. 94–95. Most authors today simply take equality to be a "special" (i.e. logical) symbol, which is forced by definition to be interpreted as actual equality rather than by an arbitrary binary relation. — Carl (CBM · talk) 00:10, 12 June 2010 (UTC)
I'd be happy if this "axiom of equality" were included on the peano axiom page proper, and I would be happy with equality to be "special", i.e., logical. But if equality is special, what is the need for axioms 1, 2, and 3 here? If equality is not special, i.e., the underlying logic does not have equality, then the symbol '=' is merely a binary predicate mentioned in the axioms, and should not be invested with special meaning that does not derive directly from those axioms. Replace "x=y" with A(x,y) in axioms 1, 2, and 3 and you get that A is an equivalence relation on terms. If the logic itself does not have equality, there's no basis for saying that "0+0" and "0" are the same in any way; they just belong to the same equivalence class under A.Krohneew (talk) 17:55, 15 July 2010 (UTC)
You're right — I think we should drop axioms 1 through 4, which are just instances of logical axioms. Did Peano himself include them? If so, then we probably need to mention them, but in a "historical" context, rather than in presenting the way the Peano axioms are viewed today. --Trovatore (talk) 21:35, 15 July 2010 (UTC)
The original Peano axioms are 9 in number. But van Heijenoort 1967 recognizes that "axioms 2, 3, 4 and 5, which deal with identity, belong to the underlying logic. This leaves the 5 axioms that have become universally known as the 'Peano axioms' "(cf p. 83) [Axiom #1 in the original is: "1 is a number", Axiom #2 is: Given a is a number, a = a, etc]. As noted above, he does not consider 0, but rather 1 as the first element in the numbers as created by the "successor function". Bill Wvbailey (talk) 00:21, 16 July 2010 (UTC)
I favor keeping all the axioms, because this article is meant to cover not just Peano arithmetic but also the historical subject of the actual axioms proposed by Peano. This is why we already have footnote 7, for example. A reader should be able to come here and leave with a list of exactly the axioms Peano listed. — Carl (CBM · talk) 02:07, 16 July 2010 (UTC)
When I came to this page originally, I was hoping to work with the axioms, and wasn't interested in their history. Not that the history isn't interesting, but it wasn't my original intent. When I saw Axioms 1-4, I concluded that in this presentation, equality was not considered part of the underlying logic, and it caused me a lot of confusion. A note discussing the situation and then a presentation of Peano's original axioms would have worked just fine. I'm not wedded to Peano's original axioms, though, so I'd be equally satisfied with a "simplified" presentation of axioms along with extra notes indicating Peano's originals. Krohneew (talk) 08:30, 16 July 2010 (UTC)
I second Wvbailey in this. My experience is that the term "Peano's axioms" is used through out mathematics to mean "a set of axioms in the spirit of Peano but in a modern setting". Because that is the common meaning within the field that is the description that should go here. And that is what people will come here looking for. A historical section about the original axioms should be added.Liiiii (talk) 20:52, 24 October 2013 (UTC)

Order type of non-standard model - meaning of symbols

"It is natural to ask whether a countable nonstandard model can be explicitly constructed. It is possible to explicitly describe the order type of any countable nonstandard model: it is always ω + (ω* + ω)η".

• What is "η" and "ω*"? (I assume that η is a placeholder for any countable ordinal; how is "ω*" defined? (Is it supposed to mean ε0, or something else?) - Mike Rosoft (talk) 10:28, 30 June 2010 (UTC)
The meaning is glossed in the next sentence. ω* is the reverse of ω (so ω*+ω is the order-type of the integers) and η is the order-type of the rationals (or of any dense unbounded countable order). Algebraist 10:52, 30 June 2010 (UTC)
I tried to clarify that paragraph some. — Carl (CBM · talk) 11:29, 30 June 2010 (UTC)

Peano axioms vs. set theory axioms

Considering the article Set-theoretic definition of natural numbers, can one say that the Peano axioms are redundant/dispensable in set theory? Is there (still) a "need" to have Peano axioms when natural numbers can be defined from some apparently more general concept (i.e. set theory)? --Abdull (talk) 21:41, 6 September 2010 (UTC)

In most formulations of set theory (for example ZFC), the Peano axioms are simply theorems (once the natural numbers are defined as certain kinds of set). Not clear what you mean by "is there still a need to have [them]?". It is of interest to know what arithmetic propositions can be proved in (first-order) Peano arithmetic, and which ones require stronger techniques such as set theory. --Trovatore (talk) 00:52, 7 September 2010 (UTC)
Now you caught my interest. Do you have any exemplary arithmetic propositions at hand that can be proven in set theory but not with Peano axioms? --Abdull (talk) 18:37, 10 September 2010 (UTC)
The classic examples are the Paris–Harrington theorem, Goodstein's theorem, and (the formalized arithmetical version of) the statement that the Peano axioms are consistent. Algebraist 18:41, 10 September 2010 (UTC)

Notation and zero

User:Belnapj has been insisting in edit summaries that the notation W is standard for the "whole numbers", including zero.

This is simply false. It is true that some authors use the term natural number in a way that includes zero and some do not. However the W notation is very far from standard in research mathematics. In my experience it is used in primary and secondary mathematics education in the United States, but never at the university level. I am trying to avoid an edit war here, but the W notation is not acceptable, because it is not standard in serious mathematics. --Trovatore (talk) 09:25, 26 January 2012 (UTC)

Yes, you are right. I'm going to give Belnapj a little while to comment first, but I'll plan to change the article back later today. — Carl (CBM · talk) 10:04, 26 January 2012 (UTC)

Motivation for induction

The article currently states "Axioms 1, 6, 7 and 8 imply that the set of natural numbers is infinite, because it contains at least the infinite subset { 0, S(0), S(S(0)), … }, each element of which differs from the rest. To show that every natural number is included in this set requires an additional axiom, which is sometimes called the axiom of induction." Since N defined to be the set of natural numbers, shouldn't this be true without induction? The article essentially states (if I understand it correctly) "To show that every natural number is included in the set of natural numbers requires induction." But whatever the set of natural numbers contains, it must contain the natural numbers, and must contain all of them; else it would be called the set of some-of-the-natural-numbers. If there is a distinction between the intuitive-natural-numbers and the formal-natural-numbers, then this distinction is unclear in the article. In Tao's Analysis I, for example, the (informal) motivation for the induction axiom is that the set of natural numbers could contain unwanted elements ("rogue" elements as he calls them, which basically are elements that are not part of the intuitive-natural-numbers), and induction ensures that N is a subset of {0,1,2,3,...}. The article also does not give a proof that "every natural number is included", which might be adding to the confusion. Russell208 (talk) 00:07, 19 April 2012 (UTC)

The issue is whether there are "natural numbers" that are not in the set {0, S(0), S(S(0)), ...}. The axiom of induction implies that that set is exactly the set of natural numbers - that there are no natural numbers that are not in that set. Those would be the "rogue" numbers that Tao is talking about. I do agree that the part of the article you quoted might be written more clearly, though. — Carl (CBM · talk) 00:35, 19 April 2012 (UTC)

Thanks Carl. After coming back to this article, I now realize my confusion rested on the phrase "this set" in the second sentence I quoted above (I thought it referred to the "set of natural numbers", but apparently it refers to the set "{0,S(0),...}", as evident from your comment). If it's all right, I might try to reword that part to make it less confusing for me (and possibly others). Russell208 (talk) 04:10, 28 April 2012 (UTC)

Yes, please have at it. — Carl (CBM · talk) 11:28, 28 April 2012 (UTC)

First-order theory of arithmetic

Sorry for stupid question, but why don't I see among the axioms of first-order Peano arithmetic something about totality of increment function $S(x)$ : $\forall x \exists y~y= S(x)$ or so on? I understand, that it can be derived from $\exists y~y= S(0)$ by induction. But neither $\exists y~y= S(0)$ nor $\forall x ~ [\exists y~y= S(x) \to \exists y~y= S(S(x))]$ is among the axioms. Eugepros (talk) 07:21, 20 April 2012 (UTC)

As first-order logic is ordinarily formulated, that follows from the logical axioms, and doesn't need to be included among the mathematical axioms. --Trovatore (talk) 08:33, 20 April 2012 (UTC)

Can you explain, HOW does it follows? As far as I know, totality of $S(x)$ is nontrivial fact, connected with our unobvious ability to increment arbitrary large number. How can it be derivable from a "pure" propositional or first-order logic?Eugepros (talk) 10:21, 20 April 2012 (UTC)

Well, I'm not going to try to figure out the formal derivation using logical axioms + modus ponens; I'll just explain it semantically. A structure for a language in first-order logic includes an interpretation for every function symbol, which must be a total function. In particular, in every structure for the language of PA, the interpretation of S is a total function. By the completeness theorem, it follows that the totality of S can be proved without axioms. --Trovatore (talk) 21:36, 20 April 2012 (UTC)
One thing I should probably point out is that this fact in itself doesn't imply that you get arbitrarily large numbers and can keep incrementing them. For example, one structure for the language of PA has just a single element, 0. Then S(0)=0, because what else could it be? This structure does not satisfy all the PA axioms, of course, but it does satisfy "S is total", as does every first-order structure for the language. --Trovatore (talk) 01:10, 21 April 2012 (UTC)

Hmm, Trovatore, the more I think about it, the more strange this "semantic" explanation looks for me. You say: "A structure for a language in first-order logic includes an interpretation for every function symbol, which must be a total function". OK, let us extend the PA by the binary function symbol "/" (division) and the axiom: $\forall k,m,n ~ k = m / n \leftrightarrow k \times n = m$. Does it mean, that the function is total? --Eugepros (talk) 09:51, 22 May 2012 (UTC)

Yes, if you put another function symbol into the signature, that would always be interpreted as a total function. That's how things are set up. Of course the axiom that you give there would be inconsistent with the rest of PA, but you could change it to say $(\forall k,m,n)[n \not = 0 \to ( k = m/n \leftrightarrow k \times n = m)]$ and that would be fine. Then the / function would be able to do whatever it wants when the second argument is 0, but it would still have to do something. — Carl (CBM · talk) 11:19, 22 May 2012 (UTC)

Here is how to prove $(\forall x)(\exists y)[f(x) = y]$ in a deductive system for first-order logic. First, you start with $f(x) = f(x)$, which is a logical axiom. Then you use existential generalization to get $(\exists y)[f(x) = y]$. Then you use universal generalization to get $(\forall x)(\exists y)[f(x) = y]$. — Carl (CBM · talk) 11:19, 22 May 2012 (UTC)

Carl, it's VERY strange. As far as I know, integer division is NOT total function. And the problem is not only division by zero: there is no an integer number k=1/2. Adding the symbol "/" and the forementioned axiom to PA, we don't establish a concept of rational numbers, we just make possible to prove something like 6/3=2.

As for your proof of totality: I more or less can accept assertions like 1/2=1/2 as "logical axioms", regardless of non-existence of an object "1/2". But how can you substitute the term f(x), which contains the free variable x, for the statement of existence, when the formula contains the same variable in its other part? I consider it as an illegal trick. --Eugepros (talk) 07:49, 23 May 2012 (UTC)

Carl spoke too soon in suggesting his amended axiom. Right, that axiom doesn't work either. But that doesn't really change anything. Function symbols in first-order logic always represent total functions, period. Symbols for partial functions are fine in informal mathematics, and can be incorporated into variants of first-order logic with a little work, but in first-order logic strictly speaking, all function symbols are symbols for total functions. --Trovatore (talk) 08:41, 23 May 2012 (UTC)

Trovatore, I don't know what do you mean by "informal mathematics". Partial functions are extensively used in mathematics and it's obvious, that they can be formalized in first-order logic. The interpetation, that every non-closed term corresponds to a total function, looks very strange. Perhaps, it's an inherent part of "semantic" approach, but I see nothing in the syntax of first-order logic, which lead us to such an inference. It's obvious, that the additional axiom $n \ne 0 \to (k = m/n \leftrightarrow k \times n = m)$ doesn't introduce rational numbers into the theory of natural numbers, in spite of the fact, that formulas like k=1/2 can be written in the extended syntax. Because $\nexists k ~ k=1/2$ is the truth for the theory - every bit as $\nexists k ~ 2 \times k=1$ is the truth for the PA. --Eugepros (talk) 10:12, 23 May 2012 (UTC)

Certainly, partial functions can be formalized in first-order logic. Just not in a completely straightforward way by function symbols. You need to do a little extra work. This should not be particularly surprising — first-order logic by itself is very spare, and you need to do extra work to formalize a lot of things.
One way is to add a constant symbol, ⊥ for example, intended to be interpreted as "no value" (some fixed object outside the universe of discourse you really have in mind, though technically for any structure for your language, its interpretation will be in that structure's universe). Then you make all your partial functions total, by assigning the interpretation of ⊥ to the value of the function anywhere your intent is that the function not be defined.
Now for the case you're discussing, the axiom would become the following two axioms (hope I get this right; if not you can correct it as an exercise):
$\forall m \forall n\left([\exists k(m=k\cdot n)]\iff \frac{m}{n}\neq\perp\right)$
$\forall m \forall n\left(\frac{m}{n}\neq\perp\implies\frac{m}{n}\cdot n=m\right)$
--Trovatore (talk) 19:13, 23 May 2012 (UTC)
(Oh, and you'll also have to modify the rest of the axioms, exempting ⊥ from any of the other assumptions, and stipulating that the result of any term containing ⊥ is itself ⊥. For example S(⊥)=⊥, 5+⊥=⊥ 0⋅⊥=⊥ etc.) --Trovatore (talk) 19:21, 23 May 2012 (UTC)
(And you'll need to add axioms saying that all the functions are total in the appropriate sense, e.g.
$\forall n\forall m\left([n\neq\perp\land m\neq\perp]\implies m+n\neq\perp\right)$
)--Trovatore (talk) 19:39, 23 May 2012 (UTC)

Trovatore, I have two things to say about it:

1) Addition such a constant $\perp$ makes the theory inconsistent, because it's provable that $\perp \ne \perp$.

2) Such a distorsion of syntax is absolutely aimless: If we want to add subtraction to the arithmetic, we simply add the axiom: $\forall k,m,n ~ (k - m = n \leftrightarrow k = m + n)$. That's all: We already have the new theory with subtraction as a fact - in the sense of syntax. Now you can "semantically" think anything about the function "-", but it's the fact, that it is NOT total: The sentence $\nexists k ~ (k = 0 - 1)$ is provable. This fact is ensured by the syntax and none of "semantics" can change it. --Eugepros (talk) 07:13, 24 May 2012 (UTC)

Look, this is the standard setup. It's not handed down by God; there are alternative ways of formulating things that work just as well, and you might be able to come up with one. But if you want to understand the literature, then you need to understand the standard formulation. In the mean time we've gotten far afield from the purpose of article talk pages (see WP:TALK) — my fault as well, I confess.
If you have more questions about the standard setup or about possible variations to it, you can ask at WP:RD/Math. If you are out to reform mathematics, you need to look somewhere other than Wikipedia. --Trovatore (talk) 07:51, 24 May 2012 (UTC)

I only wanted to know why isn't there an axiom of totality of S(n) in "First-order theory" part of the article. I see such an axiom in the first part of the article - it has number 6. I was said, that every functional symbol in ANY first-order theory corresponds to a total function. But it's obviously wrong. That is not the case whether such an approach is "standard" or not, it's simply wrong: The totality of S(n) actually follows from nowhere, if there is no explicit axiom. --Eugepros (talk) 11:23, 24 May 2012 (UTC)

That is just not true, as has been explained to you. --Trovatore (talk) 03:11, 25 May 2012 (UTC)
Peano, himself, didn't have the advantage of modern logic (or logical notation). In modern logic, all function symbols represent total function. — Arthur Rubin (talk) 14:46, 24 May 2012 (UTC)

I'm used to think, that if an axiom isn't explicitly stated, then it doesn't exist. Perhaps the thing, which I know as "first-order predicate calculus", is not a "modern logic". But there is no axiom of totality for every function symbol there. And I know why: Because it would make theories with partial functions (like integer division) impossible. --Eugepros (talk) 16:15, 24 May 2012 (UTC)

Never mind; Carl said it above. It's a logical axiom, a consequence of the axiom of equality. — Arthur Rubin (talk) 17:13, 24 May 2012 (UTC)

Using inference $\exists y ~ f(0) = y$ from $f(0) = f(0)$? That is a wonderful way to prove someting like $\exists y ~ 0-1 = y$. Does it mean, that adding the axiom $\forall k,m,n ~ (k - m = n \leftrightarrow k = m + n)$ to PA makes it inconsistent? --Eugepros (talk) 08:51, 25 May 2012 (UTC)

Yes. --Trovatore (talk) 09:03, 25 May 2012 (UTC)

Thank you. This "modern logic" is a very strange thing: Someone tried hard to make it awkward. --Eugepros (talk) 11:00, 25 May 2012 (UTC)

Not at all; it's very convenient. You don't have to keep saying, "such and such a term, if defined, satisfies such and such a property". It does mean you need to do some extra work to formalize partial functions. --Trovatore (talk) 17:21, 25 May 2012 (UTC)

Non-uniqueness

Several months ago, while reading an old textbook that presented the usual Peano axioms as a "definition" of the natural numbers, I realized that although Russell et al. agreed that the Peano axioms captured what was "meant" by the natural numbers, they were simply wrong — the Peano axioms need to be supplemented if they are to to nail down precisely the set of natural numbers and nothing else. The simplest example I can give is that the same nine axioms apply to the set of even natural numbers. I.e. if you give me an ordered set {a,b,c,d,e,f,...} that you say exhibits the natural numbers specified by the Peano axioms, I can select a proper ordered subset {a,c,e,g,i,k,...} from it that obeys all the same axioms. Of course you can say that the two sets are "isomorphic," but that really means no more nor less than that, taken as wholes, they obey the same axioms. To fix this ambiguity, one needs something besides the uniformly-stepping "successor" notion. (I think that by the time you extend the set to a field, you obtain this due to the interaction between addition and multiplication.)

So far as I have been able to determine, this observation is new — at least, none of the references I consulted addressed it. For the benefit of any readers who are trying to puzzle out the details rather than taking it all on faith, the article would be improved by some mention of this issue. — DAGwyn (talk) 09:59, 29 April 2012 (UTC)

You may want to check out http://people.umass.edu/klement/imp/imp.html#chapter1. Towards the end of the chapter, Russell discusses this exact issue. Russell208 (talk) 05:12, 30 April 2012 (UTC)

Re Dagwyn: no set of logical axioms can determine what the actual objects are - you can always replace the objects with something else, keeping the same structure, and the axioms will still hold. So the best that can be hoped for is that all models of the axioms are isomorphic. None of the references would be likely to address this because they would not view it as worth mentioning, it affects all axioms systems, and really has nothing to do with Peano arithmetic. — Carl (CBM · talk) 11:03, 30 April 2012 (UTC)
My point is more subtle: The Peano axioms constitute an incomplete specification for the desired set of natural numbers, because if you answered a math teacher's question "What are the natural numbers?" with "Zero, two, four, six, eight, and so on," I'm sure that the teacher would refuse to accept that answer, although that set (along with the matching successor function) does satisfy all the Peano axioms. The answer that would be acceptable to the teacher will be uniquely determined only if some additional constraints are imposed beyond the Peano axioms. This is actually an important point, because presentations I've encountered state or strongly imply that the Peano axioms in themselves are sufficient to specify the usual set of natural numbers, which is not correct. The standard augmentation of simply defining "1" to designate S(0), "2" to designate S(1), etc. provides labels for the ordered-set members (instead of the {a,b,c,d,e,f,...} I used previously), but even using these labels, there are proper subsets such as {0,2,4,6,8,...} which can satisfy all the axioms (but not the nomenclature rule, within the second system). "Successor" in the second system designates a different operator than in the first, but within the context of the second system it has all the specified axiomatic properties. The labels don't follow the standard convention within the second system, but that convention is not contained within the axioms. So, to satisfy the aforementioned teacher, you need some additional requirement, such as that the standard nomenclature scheme also be used. The axioms in themselves do not achieve the original intent of capturing what we mean by the set of natural numbers. Actually, we care about more than just the set; we care about the successor operator and nomenclature also, and probably even more than that.
I appreciate the cited reference to Russell's Introduction to Mathematical Philosophy, which shows that this point was noted before. Russell provides more examples; indeed, any countably infinite set can have a suitable successor function imposed upon it to satisfy the Peano axioms. He agrees that the Peano axioms are unsatisfactory, if the goal is to specify natural numbers that have the "real-world" properties that we want them to have, and he states that additional rules of arithmetic are needed to accomplish that. That's pretty much what I meant earlier when I talked about extending to a field in order to ensure the desired properties. — DAGwyn (talk) 13:12, 30 April 2012 (UTC)
My guess is that the things you ahve read correctly say that the axioms determine the natural numbers "up to isomorphism". No set of axioms can ever dictate what the objects of discourse actually are, just how they behave. In any case this is not something that needs to be discussed in this article, for the same reason that it is not discussed in the sources.
Also, if the domain is {0, 2, 4, 6, 8, ...} then when talking about that domain we would still call 2 "1", and call 4 "2", and so on. It makes no difference whether S(0) is "really" "1", we always call it 1 in the context of that model. This is somewhat humorous and confusing when the domain is {0, 2, 4, ...} but it has no mathematical significance. It's no different than having two people named "President" and "Secretary" and electing "Secretary" as the president and "President" as the secretary. That doesn't mean that the laws are underspecified, because the elected title "president" has nothing to with whether the person is really named "President"... — Carl (CBM · talk) 13:39, 30 April 2012 (UTC)
Why are you guessing (incorrectly) about what I read? You needn't explain axiomatics and isomorphism to me; I aced graduate-level advanced algebra classes, probably before you were born. I have mentioned isomorphism (and labeling) all along, but there is more to my point. It would be nice if you tried harder to understand what I wrote previously. — DAGwyn (talk) 23:28, 2 May 2012 (UTC)

---

I suggest that mathematicians approach Russell's mathematics and his attempts to define the numbers with a "unit" with caution. I used Russell's 1919 extensively when I expanded Logicism; his 1919 is a companion work to PM, and it suffers all the defects of PM. By 1927 (2nd edition of PM) Russell had virtually given up his efforts at "logicising" mathematics. The problems actually appear as early as Russell 1903. And what is at the core of the problems? His definitions of the null class and the unit class. To avoid impredicativity (and therefore a "vicious circle") of the definition of the unit -- is it to be contained in the unit class too? -- he had to "fictionalize" the notion of class via his "no-class theory" (cf Goedel 1944:119 footnote in Russell's mathematical logic to be found, with commentary, in Kurt Goedel Collected Works Volume II, Oxford University Press, ISBN-13 978-0-15-514721-c (v. 2.pbk.) ).

Here's a bit from Goedel -- a difficult paper but very useful analysis of the failure of "logicism":

"Russell adduces two reasons against the extensional view of classes, namely the existence of (1) the null class, which cannot very well be a collection, and (2) the unit classes, which would have to be identical with their single elements. But it seems to me that these arguments could, if anything, at most prove that the null class and the unit classes (as distinct from their only element) are ficitions (introduced to simplify the calculus like the points at infinity in geometry), not that all classes are fictions.
"But in Russell the paradoxes had produced a pronounced tendency to build up logic as far as possible without the assumption of the objective existence of such entities as classes and concepts. This lead to the formulation of the aforementioned "no class theory" . . .
"This whole scheme of the no-class theory is of great interest as one of the few examples, carried out in detail of the tendency to eliminate assumptions about the existence of objects outside the "data" and to replace them by constructions on the basis of these data33 [33 The "data" are to be understood in a relative sense here; i.e., in our case as logic without the assumption of the existence of clases and concepts.] The result has been in this case essentially negative; i.e., the classes and concepts introduced in this way do not have all the properties required for their use in mathematics." (pages 131-132 in Volume II of Collected Works).

Early in the paper Goedel comments that there's something wrong with mathematical philosophy at a very deep level: "I cannot help feeling that the problem raised by Frege's puzzling conclusion [about the "True", all True sentences have the same signification, he compares it to the Eleatic doctrince of the "One" etc cf page 122] has only been evaded by Russell's theory of descriptions and that there is something behind it which is not yet completely understood" (p. 123).

Goedel ends with this interesting comment that reinforces his suspicion that something is flawed deep in the foundations:

"It seems reasonable to suspect that it is this incomplete understanding of the foundations which is responsible for the fact that mathematical logic has up to now remained so far behind the high expectations of Peano and others . . . For how can one expect to solve mathematical problems systematically by mere analysis of the concepts occurring if our analysis so far does not even suffice to set up the axioms?" (p. 140)

My reading of Goedel is this: because the Peano axioms do not explicitly define "the unit", they dodge the problem that caused Russell's logicism to crash on the rocks. But this allows the creation of "homomorphic" alternatives such as {0, 2, 4, . . .} etc. If Goedel is correct, only further foundations work will reveal whether this "difficulty" can be resolved so the axioms do indeed yield only the counting numbers as we know them: { 1, 2, 3, . . .}. Bill Wvbailey (talk) 15:41, 30 April 2012 (UTC)

Thanks for the additional discussion. Indeed, when I first encountered the "ramified theory of types" I had the impression that the logic had run off the rails, and you've noted additional examples. Perhaps the root problem is the attempt to synthesize mathematical systems out of (near-)nothingness (which we may call "floating abstractions") rather than abstracting from observables. It seems to be a matter of epistemology. — DAGwyn (talk) 23:28, 2 May 2012 (UTC)

Russell did not believe that the Peano axioms defined what we meant by natural numbers. His explicit statements on the subject in IMT and "The Theory of Relations" (the paper where he presented his more general version of the Frege/Russell definition of number as an extension of the Peano Symbolism to relations) state that he thinks the axioms characterize a set of relations which he refers to as "progressions". His explicit position is essentially that "The method of postulating what we want has many advantages, they are the same as those of theft over honest toil.". The fact that {<x,y>| x = y+1} is a progression over N is useful deductively, and thus he and Whitehead utilized the Peano definitions in the same vein as they used the Huntington axioms of set theory. He explicitly preferred the Frege-Russell definition of number in set theoretic terms, as it provided in addition for those aspects of number which could not be given soley by the assumption that *S( { {} } ) is a progression. Namely, what it means for a brace of pheasants to have the same number as a flock of geese or pack of wolves. The Peano axioms for instance do not allow for a proof that {x},{y}∈1 -> x=y, or for ~(x=y) -> {x}∪{y}∈2. More generally, I think his position might be best summed up as that definition 'up to an isomorphism' (as a special case Peano's definition by abstraction as he would have known it) was insufficient for conceptual analysis, but rather that an analysis of the concept of number must be characterized by a model in the universal science of logic (which would then include set/attribute theory).

In Sum: Russell thinks PA characterizes the set of progressions, not numbers. The fact that the ancestral of {(B,A)| B = {b|(Ex,a)(x∈b & a∈A & b-{x}=a) } is a progression is sufficient to generate many of its interesting properties, but not all of them. Just as the fact that George Bush is from Texas is sufficient to deduce that he is a Redneck, and many of his political positions, but not the fact that he enjoys painting naked portraits of himself. Hence, it would not be sufficient to define George Bush up to an isomorphism as a Texan, but would have to construct a model of him in some theory, where hopefully we can deduce his propensity to choking on peanuts. — Preceding unsigned comment added by 138.123.56.208 (talk) 19:01, 28 February 2013 (UTC)

I reverted your edit because for "editorial" reasons, not for factual reasons: The cite of Bertrand Russell is something definitive. You took issue with it, and that's fine, but you had something definitive to work with ("Bertrand Russell"), whereas the vagueness you left on the page will just incite me and others to hang a "who?" tag onto the remaining passive-voice vagueness. Improve the wording? Move your concerns to a footnote? You clearly know what you're talking about, so please make this definitive. We want documented facts. If there aren't any, then no facts are better than mistruths. Bill Wvbailey (talk) 23:55, 28 February 2013 (UTC)

Sadly, the reasons for my edit were purely negative, as was the edit itself. I do not know who it was that the original author might have been referring to. Dedekind, Peano, Tarski, and Hilbert all might have been likely suspects, but I simply have not yet encountered any definitive comments by any of these mathematicians on this particular reaction to Peano's axioms. All I do know with certainty is that this was most definitely not the position of Russell by any reasonably interpretation. Hence I removed the factually incorrect attribution (my reasons for not including citation in the article of course are that I have never yet seen citation provided for an omission), and hoped that someone who knew who the "and others" were would replace the vague residuum. All my knowledge in this particular case suffices for is the removal of an error, and regrettably it is currently not capable of furnishing an adequate replacement. -Cheers- — Preceding unsigned comment added by 138.123.84.57 (talk) 14:04, 8 April 2013 (UTC)

Dedekind's The Nature and Meaning of Numbers

That is the title given to Dedekind's Was sind und was sollen die Zahlen in the "Authorized Translation by Wooster Woodruff Beman, Late Professor of Mathematics, The University of Michigan" in the Dover 1963 "unabridged and unaltered republication of the English translation first published by The Open Court Publishing Company in 1901". This is corroborated by the paper "Notes on Richard Dedekind’s Was sind und was sollen die Zahlen?" David E. Joyce, Clark University, December 2005:

"Richard Dedekind (1831–1916) published in 1888 a paper entitled Was sind und was sollen die Zahlen? variously translated as What are numbers and what should they be? or, as Beman did, The Nature of Meaning of Numbers. Dedekind added a second preface to the second edition in 1893. The second edition was translated into English by Wooster Woodruff Beman in 1901.
"Much of Dedekind’s terminology and notation as translated by Beman differs from the modern standards, so I offer these notes, using current terminology and notation, to make his work more understandable." (http://aleph0.clarku.edu/~djoyce/numbers/dedekind.pdf)

I vote for "The Nature and Meaning of Numbers", with a footnote clarifying and presenting the alternate. The entire Open Court book of two papers can be found on line (at Project Gutenberg). BillWvbailey (talk) 19:39, 14 August 2012 (UTC)

Hmm, I tend to prefer the most literal translation that's actually in wide use. If Dedekind had wanted that title, he could have written Die Natur und die Bedeutung der Zahlen or some such (apologies if my German's a little off). --Trovatore (talk) 19:44, 14 August 2012 (UTC)

It would be interesting to know why Beman came up with what he did: Dedekind was alive and kicking in 1901, and the translation is "authorized" whatever that means. I failed in my efforts to look up the words sind and sollen. Maybe we should reverse the sense of the footnote and say it is also known by the title The Nature and Meaning of Numbers for example, see the citations in Richard Dedekind. The reason for the added clarification? Even I was uncertain as to whether or not there was yet another paper by Dedekind published in 1888; the Preface to the first edition is dated 1887, not 1888. You can buy the Dover book (I did), and nowhere except on the back coverpage, very last sentence is the German name mentioned. (There's no introduction by the translator, for instance). So it's very easy to get confused, as I was. BillWvbailey (talk) 20:17, 14 August 2012 (UTC)

sind is just the third-person plural present indicative of sein, "to be". Sollen is usually a modal verb, meaning "should" in the sense of "ought to" (sollen is both infinitive and third-person plural; I'm assuming in this case it's the second). So the weird thing about the title is that there's no main verb to go with sollen.
My guess is that that's either because sind is already there as a main verb, or because you don't really need a main verb if it's sein, but at this point I'm way out of my depth in German and just speculating. --Trovatore (talk) 20:27, 14 August 2012 (UTC)
the current translation is wrong:
What are numbers and what should they be (German: Was sind und was sollen die Zahlen)
better would be "What are numbers and what should they DO". --345Kai (talk) 17:06, 11 January 2013 (UTC)
I respectfully disagree. The construction was soll X without an infinitive complement does not assume the infinitive tun. Grimm offers several useful glosses in the article on sollen: wozu ist er gut, was ist er wert, often with the implicit suggestion that X is worth nothing (II 4 b); was soll X werden / was soll X sein / was soll X bedeuten (II 4 g). Beman's translation of Dedekind's title is a bit free, yes, but it does a better job of matching the sense of the German than the more literal translations suggested in this talk page, which make the mistake of trying to translate the words one by one, and not the title as a whole. C.M.Sperberg-McQueen (talk) 01:11, 4 October 2013 (UTC)

Pointed Unary Systems

In the subject section, it seems to me that C should be a category *with terminal object* 1_C, not initial object as stated. As there is always a unique arrow from an initial object to any specified object, it is not interesting to use such arrows as a way of specifying distinguished "elements". 96.57.52.138 (talk) 18:28, 24 August 2012 (UTC)

I believe you are right, I fixed it.—Emil J. 12:55, 27 August 2012 (UTC)
The Peano Axioms is few used. At Analysis is more used the axioms of de real numbers.--201.240.59.201 (talk) 23:08, 25 April 2013 (UTC)

PA– axiom 13

Axiom 13 in the "Equivalent Axiomatization" PA states as a consequence of x<y that \exists z. x+z=y. That consequence is also true when x=y. Is there a reason why this axiom is used, rather than the stronger claim that x<y iff \neg\exists z. x=y+z? -- 69.86.161.244 (talk) 10:59, 5 November 2013 (UTC)

You probably meant "the stronger claim ∀x,y∈N. x<y⇔∃z∈N. z≠0 ∧ x+z=y"? I think, this follows from (and is hence equivalent to) axiom 13 in the presence of the other axioms: If x<y, then x+z=y for some z∈N by the weak version of axiom 13; were z=0, then x=x+0=y by axiom 6, contradicting x<y. Conversely, if z≠0 ∧ x+z=y for some z, then 0<z by axiom 15, hence x = 0+x < z+x = y by axiom 11, using also commutativity (ax.2) and identity (ax.6). - Jochen Burghardt (talk) 12:07, 5 November 2013 (UTC)
That's a different definition of < often put forward; but I don't see why the one I stated is not also adequate (taking the relevant quantifiers, with restrictions if the domain might have non-numbers in it, as understood). I supposed that the weaker axiom in the text is equivalent to these stronger ones in the presence of the other axioms, is the reason it's used just that, on its own, it's strictly weaker and in the context of the others, is adequate? --69.86.161.244 (talk) 20:33, 9 November 2013 (UTC)

Addition and the cartesian product notation

I mistakenly made this edit yesterday, and looking at the history, I see that I wasn't the first. That indicates to me that perhaps the notation could use a little more glossing, for the non-technical reader. I propose this:

Addition is a function which maps a Cartesian product of N (a pair of natural numbers) onto another natural number: N × N N. Addition is denoted with the symbol +, and is defined recursively as: ...

Is it okay if I make this change? - Klortho 21:23, 23 June 2014‎