Talk:Proof: Difference between revisions

Content added Content deleted

Inline

Revision as of 20:19, 13 May 2012 (view source) Rdm (talk \| contribs) (→‎Quantifiers) ← Older edit		Revision as of 20:41, 13 May 2012 (view source) rosettacode>Ruud Koot (→‎Quantifiers: re) Newer edit →
Line 184:		Line 184:

	: Put differently: the task asks for a countable set of natural numbers. This would be trivial, except that the peano postulates do not hold for a countable set. --[[User:Rdm\|Rdm]] 20:19, 13 May 2012 (UTC)		: Put differently: the task asks for a countable set of natural numbers. This would be trivial, except that the peano postulates do not hold for a countable set. --[[User:Rdm\|Rdm]] 20:19, 13 May 2012 (UTC)

			: The set of natural numbers is countably infinite. They are defined by a finite formal systems (the Peano axioms). A proof about a property holding for all natural numbers can be given in a finite form (using induction). You may indeed not be familiar with these facts, but they are most certainly not novel. —''[[User:Ruud Koot\|Ruud]]'' 20:41, 13 May 2012 (UTC)