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 5, 2012 2:39 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

> I worked out an inference rule that works with Modus Ponens that
> performs pseudo-resolution
> or(X,Y)  :-  or(X,C) , or(Y,not(C).
> Are there rules like the above format that does cut-elimination?

I worked out (half way) how to do CUTS with first principles modus

you can cut A
to get (D or V)

r -> (a or d)
(p & a) -> v
(p & r) -> (d or v)


(p & r) -> (p & (a or d))

(p & (a or d)) -> (p & a) or (p & d)

(p & r) -> (p & (a or d)) -> v or (p & d)

(p & r) -> v
(p & r) -> (p & d)

(p & r) -> v
(p & r) -> d

(p & r) -> (v or d)


OK 1st step

r -> (a or d)
(p & r) -> ?

To get:
(p & r) -> (p & (a or d))

Z=(a or d)

and(P,Z) :- and(P,R) , if(R,Z)



So, resolution, binary MP, and cuts etc.
can all be worked out with the right inference rules and naked PROLOG
UNIFY (or Modus Ponens as a separate control and if rules as facts.)

OLD and [OLD->NEW] -> NEW

is all you need to imply *ANY* create|check formula system

or(X,Y)  :-  or(X,C) , or(Y,not(C). RESOLUTION
and(P,Z) :- and(P,R) , if(R,Z) CUT

Depth Limiting or Smart Control Logic Required!

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.