Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


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

Topic: Peano-like Axioms for the Integers in DC Proof
Replies: 11   Last Post: Mar 3, 2013 6:13 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Graham Cooper

Posts: 4,253
Registered: 5/20/10
Re: Peano-like Axioms for the Integers in DC Proof
Posted: Feb 24, 2013 5:39 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On Feb 25, 7:35 am, Dan Christensen <Dan_Christen...@sympatico.ca>
wrote:

> > How do you rate Peano's attempt?
>
> It was a real breakthrough in its day, but it was a essentially an exercise in pattern recognition: Here are some facts about the natural numbers from which it  may be possible to derive all others. What I have done differently is to derive these facts/axioms (including induction) starting with nothing more than assuming that there exists an injective fuction defined on a set



AND 2nd ORDER LOGIC!

[DAN] - I make no claim that it is first-order.

...

Sure, given ALL(X) ...formula..

it's so easy!

----------------------------

This just uses DOUBLE VARIABLE NAME COMPATIBLE BINDING

and THE COMPUTER SEARCHES for the Proofs using only 10 lines!

EG. Are all Nats Even?

nat(0).
nat(s(X)) :- nat(X).

even(0).
even(s(s(X))) :- even(X).

odd(s(0)).
odd(s(s(X))) :- odd(X).

e(A,nats) :- nat(A).
e(A,evens) :- even(A).
e(A,odds) :- odd(A).

insect(S1,S2) :- e(A,S1),e(A,S2).

**** QUERY NOT(ALL(NATS are EVEN)) ***

?- !(subset( nats , evens ))
>>!(!insect((nats, !(evens)).
>> insect(nats,odds).
>> TRUE



?- e(A,nats) , e(A,odds)

A = s(0)


The 10 lines of PROLOG can find the counterexample NUMBER 1!

This *pattern matching*

e(A,nats) :- nat(A).

is an INTERFACE from 4GL "WHAT IF" requests
to 3GL recursive programs in a set theoretic framework.

The SCOPE of syntactic proof checkers tends to be limited to meta-
facts about the theory itself.


Herc
--
www.BLoCKPROLOG.com




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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.