
Re: LOGICAL NEGATION working in PROLOG! <<Using Peano Arithmetic>>
Posted:
Dec 4, 2012 7:44 PM


[JAN]
> > 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!
[JAN]
> > Then you should be able to prove: > > > p, p > q, p > r, q&r > s  s >
p>q / \ p s \ / p>r
Hence the D.A.G. instead of the traditional linear proof meta predicate introduced by Godel.
Herc  E(Y) Y={xP(x)} <> DERIVE( E(Y) Y={xP(x)} ) DERIVE(T) <> DERIVE(a) ^ DERIVE(b) ^ (a^b)>T

