The Math Forum

Search All of the Math Forum:

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

Math Forum » Discussions » sci.math.* » sci.math

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
William Elliot

Posts: 2,637
Registered: 1/8/12
Re: Two Finite Arithmetics
Posted: Apr 9, 2014 4:52 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Tue, 8 Apr 2014, Dan Christensen wrote:
> > > Here, I have translated your axioms into DC Proof format. Download my
> > > software, enter these axioms (the "@" is mapped to epsilon) and see what
> > > you can do with them. You have to construct your own proofs one line at
> > > a time, but the software will not let you make mistakes. Instant
> > > feedback is provided with each line you enter it. You might start by
> > > proving the associativity and commutativity of + and * as you have
> > > defined them. You can get started using with the tutorial or user
> > > manual.

> > I will not.
> Here's your big chance to test your theory, William!
> Oh, well.

I can do better proving the theormes myself than to
rely upon software of a bumbling mathmatician.

For example, for all x /= m, x /= Sx
Don't take my advise. Choose instead,
to let me scoop your ideas first.

Any other theorems you or your unreknown software,
can't prove in naive finite arithmetic? Wake up,
some of them are going to be different than the
theorems for Peano's Axioms.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

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