Lecture 8: Predicate Logic Proofs - University of Washington
[Pages:36]CSE 311: Foundations of Computing
Lecture 8: Predicate Logic Proofs
Last class: Propositional Inference Rules
Two inference rules per binary connective, one to eliminate it and one to introduce it
Elim A B A, B
A ; B
Intro
AB
Elim A B ; ?A B
A
x
Intro
A B, B A
Modus Ponens A ; A B B
A B Direct Proof Rule A B
Not like other rules
Last class: Example
Prove: ((p q) (q r)) (p r)
1.1. ( ) Assumption
1.2.
Elim: 1.1
1.3.
Elim: 1.1
1.4.1.
Assumption
1.4.2.
MP: 1.2, 1.4.1
1.4.3.
MP: 1.3, 1.4.2
1.4.
Direct Proof Rule
1.
( ) Direct Proof Rule
One General Proof Strategy
1. Look at the rules for introducing connectives to see how you would build up the formula you want to prove from pieces of what is given
2. Use the rules for eliminating connectives to break down the given formulas so that you get the pieces you need to do 1.
3. Write the proof beginning with what you figured out for 2 followed by 1.
Inference Rules for Quantifiers: First look
P(c) for some c
Intro
x P(x)
x P(x)
Elim
P(a) for any a
Intro "Let a be arbitrary*"...P(a)
x P(x)
* in the domain of P
Elim
x P(x)
P(c) for some special** c
** By special, we mean that c is a name for a value where P(c) is true. We can't use anything else about that value, so c has to be a NEW name!
Predicate Logic Proofs
? Can use
? Predicate logic inference rules
whole formulas only
? Predicate logic equivalences (De Morgan's)
even on subformulas
? Propositional logic inference rules
whole formulas only
? Propositional logic equivalences
even on subformulas
My First Predicate Logic Proof Prove x P(x) x P(x)
The main connective is implication
5.
()
so Direct Proof Rule seems good
My First Predicate Logic Proof Prove x P(x) x P(x)
1.1.
1.5. 1.
Assumption
We need an we don't have so "intro " rule makes sense
Direct Proof Rule
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- formal proofs and boolean logic ii extending f with rules for
- formal verification of a modern sat solver
- a circuit based sat solver for logic synthesis
- logic and proof university of cambridge
- logic and proof lean
- formal and informal proofs university of pittsburgh
- lecture 8 predicate logic proofs university of washington
- formal veri cation with smt solvers why and how
- formal methods first order logic 3 3 proofs johns hopkins university
- chapter 8 hilbert proof systems formal proofs deduction theorem
Related searches
- university of washington hr jobs
- university of washington jobs listing
- university of washington human resources
- university of washington human resources dept
- university of washington baseball roster
- university of washington product management
- university of washington online mba
- university of washington printable map
- university of washington opioid taper
- university of washington opioid calculator
- university of washington program management
- university of washington graduate programs