Scribd
Upload
33 views10 pages

Lecture 2

This document discusses propositional logic, including logical connectives like negation, conjunction, disjunction, and implication. It provides examples of determining the truth value of compound propositions using truth tables. The document also demonstrates how to translate English sentences into logical propositions using elementary statements and logical connectives.

Uploaded by

mimin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
33 views10 pages

Lecture 2

This document discusses propositional logic, including logical connectives like negation, conjunction, disjunction, and implication. It provides examples of determining the truth value of compound propositions using truth tables. The document also demonstrates how to translate English sentences into logical propositions using elementary statements and logical connectives.

Uploaded by

mimin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

 

 
 
 
 

CSC510
Discrete Structures
Propositional Logic

Lecture 2: Propositional Logic


Review

 • Propositional logic: a formal language for making logical inferences


 • A proposition is a statement that is either true or false.
 • A compound proposition can be created from other propositions using logical
connectives
 • The truth of a compound proposition is defined by truth values of elementary
propositions and the meaning of connectives.
 • The truth table for a compound proposition: table with entries (rows) for all possible
combinations of truth values of elementary propositions.
Compound propositions

 More complex propositional statements can be build from the elementary statements using
logical connectives.
 
• Logical connectives:
 – Negation
 – Conjunction
 – Disjunction
 – Exclusive or
 – Implication
 – Biconditional
Compound propositions (cont.)

Let p: 2 is a prime ….. T


q: 6 is a prime ….. F
• Determine the truth value of the following statements:
 ¬ p: F
 p∧q:F
 p ∧ ¬q: T
 p∨q:T
 p ⊕ q: T
 p → q: F
 q → p: T
Constructing the truth table

•Examples: Construct the truth table for


 (p → q) ∧ (¬p ↔ q)
p q (¬p p→q ¬p ↔ q (p → q) ∧ (¬p ↔ q)

1 1
1 0
0 1
0 0
Constructing the truth table (cont.)

•Examples: Construct the truth table for


 (p → q) ∧ (¬p ↔ q)
p q ¬p p→q ¬p ↔ q (p → q) ∧ (¬p ↔ q)
(i) (ii) (i) ∧ (ii)
1 1 0 1 0 0
1 0 0 0 1 0
0 1 1 1 1 1
0 0 1 1 0 0
Translation

Logic helps us to define the meaning of statements: Mathematical or English statements.


• How to translate an English sentence to the logic?
• Assume a sentence:
– If you are older than 13 or you are with your parents then you can attend a PG-13 movie.
 Parse:
• If ( you are older than 13 or you are with your parents ) then ( you can attend a PG-13 movie)
– A= you are older than 13
– B= you are with your parents
– C=you can attend a PG-13 movie
 • Translation: A ∨ B → C
Translation (cont.)

 General rule for translation.


 – Look for patterns corresponding to logical connectives in the sentence and use them to
define elementary propositions.
Translation (cont.)

• Assume two elementary statements:


p: you drive over 65 mph
q: you get a speeding ticket
 • Translate each of these sentences to logic
 i. you do not drive over 65 mph.
 ii. you drive over 65 mph, but you don't get a speeding ticket.
 iii. you will get a speeding ticket if you drive over 65 mph.
 iv. if you do not drive over 65 mph then you will not get a speeding ticket.
 v. driving over 65 mph is sufficient for getting a speeding ticket.
 vi. you get a speeding ticket, but you do not drive over 65 mph.
Translation (cont.)

• Assume two elementary statements:


p: you drive over 65 mph
q: you get a speeding ticket
 • Translate each of these sentences to logic
 i. you do not drive over 65 mph. (¬p)
 ii. you drive over 65 mph, but you don't get a speeding ticket. (p ∧ ¬q)
 iii. you will get a speeding ticket if you drive over 65 mph. (p → q)
 iv. if you do not drive over 65 mph then you will not get a speeding ticket.(¬p → ¬q)
 v. driving over 65 mph is sufficient for getting a speeding ticket. (p → q)
 vi. you get a speeding ticket, but you do not drive over 65 mph. (q ∧ ¬p)

You might also like