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: LOGICAL NEGATION working in PROLOG! <<Using Peano Arithmetic>>
Replies: 6   Last Post: Dec 5, 2012 2:39 AM

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,495
Registered: 5/20/10
Re: LOGICAL NEGATION working in PROLOG! <<Using Peano Arithmetic>>
Posted: Dec 4, 2012 7:44 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


> >      thm(C) :- if((A,B),C), thm(A), thm(B).
> This is my whole proof ideology!
> To construct a Directed Acyclic Graph from the Theorem back to axioms,
> I call it binary modus ponens.

or Dual Tail End Recursion!


> > Then you should be able to prove:
> >        p, p -> q, p -> r, q&r -> s |- s

/ \
p s
\ /

Hence the D.A.G. instead of the traditional linear proof meta-
predicate introduced by Godel.

E(Y) Y={x|P(x)} <-> DERIVE( E(Y) Y={x|P(x)} )
DERIVE(T) <-> DERIVE(a) ^ DERIVE(b) ^ (a^b)->T

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.