Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site utastro.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!seismo!ut-sally!utastro!bill
From: bill@utastro.UUCP (William H. Jefferys)
Newsgroups: net.math
Subject: Re: Pedantic Question - (nf)
Message-ID: <140@utastro.UUCP>
Date: Wed, 22-Feb-84 10:18:48 EST
Article-I.D.: utastro.140
Posted: Wed Feb 22 10:18:48 1984
Date-Received: Thu, 23-Feb-84 06:07:01 EST
References: <5777@uiucdcs.UUCP>
Organization: UTexas Astronomy Dept., Austin, Texas
Lines: 12

How do the Peano axioms guarantee a finite number of digits?  The
axiom of induction would guarantee this once you establish the
proposition that (n has a finite number of digits) --> (successor(n)
has a finite number of digits).  I don't know if the latter is really
"in" the Peano system or not since it is more a matter of representation
than existence.  
-- 

	Bill Jefferys  8-%
	Astronomy Dept, University of Texas, Austin TX 78712   (USnail)
	{ihnp4,kpno,ctvax}!ut-sally!utastro!bill   (uucp)
	utastro!bill@ut-ngp			   (ARPANET)