rules for predicate logic

18
Rules for Predicate Logic The system for predicate logic in this course is quite simple. We will learn 3 rules which can be used for proof and also with trees.

Upload: fern

Post on 05-Feb-2016

68 views

Category:

Documents


0 download

DESCRIPTION

Rules for Predicate Logic. The system for predicate logic in this course is quite simple. We will learn 3 rules which can be used for proofs and also with trees. Rules for Predicate Logic. The system for predicate logic in this course is quite simple. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: Rules for Predicate Logic

Rules for Predicate Logic

The system for predicate logic in this courseis quite simple.

We will learn 3 rules which can be used for proofsand also with trees.

Page 2: Rules for Predicate Logic

Rules for Predicate Logic

The system for predicate logic in this courseis quite simple.

We will learn 3 rules which can be used for proofsand also with trees.

$O Universal Out#O Existential Out

QE Quantifier Exchange

There are no quantifier In rules.

Page 3: Rules for Predicate Logic

Taking an Instance

$x(Px>Qx)

Page 4: Rules for Predicate Logic

Taking an Instance

$x(Px>Qx)

Pa>Qa

Page 5: Rules for Predicate Logic

Taking an Instance

$x(Px>Qx)

Pa>Qa

To take an instance:1. Remove the quantifier.

Px>Qx2. Substitute the same name (a-w) for each occurrence of the variable.

Pa>Qa

Page 6: Rules for Predicate Logic

Taking an Instance

$x(Px>Qx)

Pa>Qa

To take an instance:1. Remove the quantifier.

Px>Qx2. Substitute the same name (a-w) for each occurrence of the variable.

Pa>Qa

Pa>Qx WRONGPa>Qb WRONGPb>Qb RIGHT

Page 7: Rules for Predicate Logic

Taking an Instance

$x(Px>Qx)

Pa>Qa

To take an instance:1. Remove the quantifier.

Px>Qx2. Substitute the same name (a-w) for each occurrence of the variable.

Pa>QaThis should be familiar from algebra. x+7=7+x

3+7=7+3 RIGHT3+7=7+4 WRONG

Page 8: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A

-$x(Dx>-Bx) GOAL

Page 9: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A3) $x(Dx>-Bx) PA

?&-? ?,? &I -$x(Dx>-Bx) 3-? -I

Page 10: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A3) $x(Dx>-Bx) PA4) Da>-Ba 3 $O

?&-? ?,? &I -$x(Dx>-Bx) 3-? -I

Page 11: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A3) $x(Dx>-Bx) PA4) Da>-Ba 3 $O

?&-? ?,? &I -$x(Dx>-Bx) 3-? -I

$O Rule

$xAxAn

Page 12: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A3) $x(Dx>-Bx) PA4) Da>-Ba 3 $O5) -Ba 4,2 >O ?&-? ?,? &I -$x(Dx>-Bx) 3-? -I

Page 13: Rules for Predicate Logic

Universal Out

1) Ba A2) Da A3) $x(Dx>-Bx) PA4) Da>-Ba 3 $O5) -Ba 4,2 >O6) Ba&-Ba 1,5 &I7) -$x(Dx>-Bx) 3-6 -I

Page 14: Rules for Predicate Logic

Universal Out

1) Gj A2) $x(Gx>Rx) A3) $x(Rx>Ux) A

Uj GOAL

Page 15: Rules for Predicate Logic

Universal Out

1) Gj A2) $x(Gx>Rx) A3) $x(Rx>Ux) A4) Gj>Rj 2 $O

Uj GOAL

Page 16: Rules for Predicate Logic

Universal Out

1) Gj A2) $x(Gx>Rx) A3) $x(Rx>Ux) A4) Gj>Rj 2 $O5) Rj>Uj 3 $O

Uj GOAL

Page 17: Rules for Predicate Logic

Universal Out

1) Gj A2) $x(Gx>Rx) A3) $x(Rx>Ux) A4) Gj>Rj 2 $O5) Rj>Uj 3 $O6) Rj 4,1 >O Uj GOAL

Page 18: Rules for Predicate Logic

Universal Out

1) Gj A2) $x(Gx>Rx) A3) $x(Rx>Ux) A4) Gj>Rj 2 $O5) Rj>Uj 3 $O6) Rj 4,1 >O7) Uj 5,6 >O

For more click here