Scribd
Upload
94 views8 pages

Review 4: Gongjun Yan

This document contains 4 summaries of predicate logic proofs. Each proof uses premises (P1, P2, etc.) and rules of inference to derive a conclusion. The document also briefly explains key concepts in predicate logic, including predicates (statements about objects), quantification (there exists and for all), and domains (the set of objects).

Uploaded by

gbland
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
94 views8 pages

Review 4: Gongjun Yan

This document contains 4 summaries of predicate logic proofs. Each proof uses premises (P1, P2, etc.) and rules of inference to derive a conclusion. The document also briefly explains key concepts in predicate logic, including predicates (statements about objects), quantification (there exists and for all), and domains (the set of objects).

Uploaded by

gbland
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Review 4

Gongjun Yan
P1 p  q
P2 q  r
P3 ~p
 r

• P3^P1 ~p ^(Pvq)  q
• P2 qr
•  r
P1 p ^ q
P2 p  s
P3 ~r  ~q
 s^r
• P1a P
• P1b q
• P1a ^ p2 p^(p  s)  s
• P1b ^ p3 q ^ (~r  ~q)  r
•  s^r
P1 pq
P2 ~(q  r)
P3 p  (m  r)
 ~m
• P2 ~(q  r)  ~q ^ ~r
• P2a ~q
• P2b ~r
• P1 (p v q)  ~~p v q  ~p  q
• P1^p2a (~p  q) ^ (~q)  p
• (P1^p2a) ^p3 p ^(p  (m  r))  (m  r)
• P2b ~r
•  ~m
P1 pq
P2 ~(~q  r)
P3 m  ~p
 ~m ^ ~r
• P2 ~(~q  r)  ~(q v r)  ~q v ~r
• P2a ~q
• P2b ~r
• P2a ^ p3 ~q ^ (m  ~p)  ~m
• P2b ^ (P2a ^ p3) ~r ^ ~m
Predicate Calculus
• P(x)
• P means this predicate
• X: Applied to the object represented by x
• P(x) = X went to the store
• P(John) = John went to the store
• P(Tome) = Tom went to the store
• P(Kate) = Kate went to the store
Quantification
• x – There exists an x (at least one, some)
• x – For all x’s
• Domain – set where these subjects come from
• Let P(x) be “x ≥ 0”
• x  D, such that P(x)
– xP(x)=?
– D = {1,2,3,4,5,6}
– D = negative R
– D=Z
Concepts
• Rules of Inference
• Predicate Calculus
• Quantification

You might also like