Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Two Finite Arithmetics
Replies: 19   Last Post: Apr 9, 2014 9:27 PM

 Search Thread: Advanced Search

 Messages: [ Previous | Next ]
 William Elliot Posts: 2,637 Registered: 1/8/12
Re: Two Finite Arithmetics
Posted: Apr 9, 2014 4:41 AM
 Plain Text Reply

On Tue, 8 Apr 2014, Dan Christensen wrote:

>> We have a finite succession of objects with a beginning and an end. The
>> first element, by definition has no predecessor. The last element, by
>> definition has no successor. I'd say your work-around isn't up to spec.

That's your unworkable criteria.
All of the difficultiest that you haven't been able
to resolved are smmothly handled by allowing Sm.

My version is done can complete. Yours, which I see
no point in persuing, has problems that you haven't.
The worse being the complexity of describing the
partiality of addistion.

BTW, just as I told you, in naive finite arithmatic
it's a theorem, ie provalbe, that for all x /= m,
x /= Sx
by induction over the equivalent statement
P(x) when x = m or x /= Sx.

© The Math Forum at NCTM 1994-2018. All Rights Reserved.