26 Complete Inference Rules

# 26 Complete Inference Rules - A xP(x P(a Elim Universal...

This preview shows pages 1–2. Sign up to view the full content.

Handout #26 CS103A Feb. 8, 2008 Robert Plummer Complete Inference Rules = Elim = Intro ^ Elim ^ Intro P(n) P1 ^ P2 P1 a = a n = m P 1 P 2 P 2 P ( m ) P 1 ^ P 2 v Intro v Elim ¬ Elim ¬ Intro P P1 v P2 ¬¬ P P P1 P P v Q S ¬ P P2 S S Intro Elim Intro Elim P P P Q (or Q P) ¬ P P Q P Q Q P P Q Intro Elim P Q P P Q Q P Q

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Rules for Quantifiers Universal Elimination
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A xP(x) . . . P(a) Elim Universal Introduction a xP(x) . . . P(a) Intro General Conditional Proof a x(P(x) → Q(x)) . . . Q(a) Intro P(a) Existential Elimination a . . . Q P(a) Existential Introduction P(a) . . . E xP(x) Intro xP(x) Q does not contain a Q Elim Remember that boxed constants cannot occur outside their subproofs....
View Full Document

## This note was uploaded on 10/01/2011 for the course CS 103A taught by Professor Plummer,r during the Winter '07 term at Stanford.

### Page1 / 2

26 Complete Inference Rules - A xP(x P(a Elim Universal...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online