Scribd
Upload
49 views

Quiz On Section 1.2 Today Recall We Finished Section 1.2 Propositions and Started Section 1.3 Conditional Propositions

This document contains notes from a mathematics class covering propositional logic. It discusses the following key points: 1) There will be a quiz today covering section 1.2 on propositions and truth tables. 2) It reviews how to combine different types of propositions using operators like negation, conjunction, disjunction, etc. 3) It covers conditional and bi-conditional propositions, and explains the difference between sufficient and necessary conditions. 4) It discusses quantifiers and propositional functions, where a function takes variables as inputs and produces true or false propositions based on the variable values.

Uploaded by

goflux pwns
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views

Quiz On Section 1.2 Today Recall We Finished Section 1.2 Propositions and Started Section 1.3 Conditional Propositions

This document contains notes from a mathematics class covering propositional logic. It discusses the following key points: 1) There will be a quiz today covering section 1.2 on propositions and truth tables. 2) It reviews how to combine different types of propositions using operators like negation, conjunction, disjunction, etc. 3) It covers conditional and bi-conditional propositions, and explains the difference between sufficient and necessary conditions. 4) It discusses quantifiers and propositional functions, where a function takes variables as inputs and produces true or false propositions based on the variable values.

Uploaded by

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

MAT214A

Wednesday 1/23 10:55 – 12:05 pm


SSU Spring 2019

Quiz on Section 1.2 Today

Recall
We finished Section 1.2 Propositions and started Section 1.3 Conditional Propositions
Truth Tables - use truth tables to determine the truth of statements

We added to the list of how to combine propositions :


1. Negation ¬p = “not p”
2. Conjunction p ∧ q .
3. Disjunction p ∨ q
4. Exclusive “or” p ⨁ q
5. Conditional proposition or implication: if p then q. We can write this as “ p  q”
6. Bi-conditional proposition or equivalence: If p only if q. We can write this as “p⟷q”

Order of operations for propositional statements:


1. Parentheses ( )
2. Negation¬
3. Conjunction ∧
4. Disjunction ∨ or Exclusive disjunction ⨁ – no priority left to right
5. Conditional proposition “if then” 
6. Bi-conditional propositions “if and only if” ↔
Today:
A) Finish Section1.3
#26 on HW answer key – incorrect. Work through this one.

1. Writing “unless” statements in p q form


The statement will have two parts: “a unless b”.
Pick either part, put it first (after the IF) and negate it.
Take the other part and write after “then”.

Example: You cannot fly unless you have wings


Part 1 you cannot fly, part 2 you have wings
Then write: if [¬part 1], then [part 2]
If can fly, then have wings

2. Logically equivalent
Two statement forms are logically equivalent if, and only if, their resulting truth tables are identical for each
variation of statement variables. If two statements A and B are logically equivalent, we write A ≡B

Show that ¬(p ∨q) ≡ ¬p ∧¬q

p q ¬(p ∨q) ¬p ∧¬q


T T F F
T F F F
F T F F
F F T T

3. Bi- conditional statements


“p if and only if q” is a bi-conditional statement and is denoted p ↔ q and often written p iff q.
p ↔ q is true when both p and q have the same truth values
p ↔ q is logically equivalent to the statement (p q) ∧ (q  p)

p q p q qp (p q) ∧ (q  p) p ↔q
T T T T T T
T F F T F F
F T T F F F
F F T T T T

Example:
A triangle is an isosceles if and only if it has 2 congruent sides.
You pass the test if and only if you score 65% or higher
4. Converse
The converse of p  q is q p
A conditional statement and its converse are not logically equivalent see truth table for bi-conditional
above.
pq
If a polygon is a square then it is a quadrilateral True
q p
If a polygon is a quadrilateral then it is a square False

6. Contrapositive
The contrapositive of a conditional statement p  q is ¬q  ¬p.
A conditional statement and its contrapositive are logically equivalent.
Example:
p  q: If I attend SSU, then I am a college student
¬q  ¬p: If I am not a college student, then I do not attend SSU

p q p q ¬q  ¬p
T T T T
T F F F
F T T T
F F T T

5. Necessary condition vs. sufficient condition for “if p then q”


If p and q are propositions:

The sufficient condition is the part that immediately follows “if.” (also follows words like “when”,
“whenever”)
p is a sufficient condition for q means "if p then q."

“Sufficient” means “enough,” and the “p” part of a conditional statement is sufficient—it’s enough—to imply
the “q” part.

Example:
If I am in New York then I am in the United States.
Being in NY is sufficient condition – to imply you are in US

If the lawnmower starts, then the key is in the ignition.


The lawnmower starting is sufficient condition - it implies the key is in the ignition
The necessary condition is the part that immediately follows the “then.” (also follows words like “must”, “is
required”)
q is a necessary condition for p means "if not q then not p." Recall that we have shown that ¬q  ¬p ≡ p→ q
“Necessary” means “required,” and this “q” part is required whenever the “p” part is true

Example:
If I am in New York then I am in the United States ≡ If I am not in the US, then I am not in NY
Being in the United States is a necessary condition—it is required if you’re in New York.

If the lawnmower starts, then the key is in the ignition. ≡ If the key is not in the ignition, then the
lawnmower will not start.
The key being in the ignition is a necessary condition – whenever the engine starts.

    
In the case of the bi-conditional p ↔q, p is a necessary and sufficient condition for q means "p if, and only if,
q."

#4 is incorrect on answer key. Work through this one.

B) Section 1.5 Quantifiers


Most of mathematics uses variables and now we need to extend the propositional logic from sections 1.2, 1.3
to include statements with variables.
Example:
p: 6 is a multiple of 3
This is a proposition and it is true, 6 is a multiple of 3
p: x is a multiple of 3
This is not a proposition because whether this is true or false depends on x.

1. Propositional Function (or predicate)


Let P(x) be a statement involving the variable x.
Let D be the domain or set of possible inputs for P(x)

A propositional function P(x) is true or false for each x∈ D. It represents a class of propositions - one for each
x input in the domain.

Example: P(x): multiple of 3, Domain is the set of integers .


.
P(-1) = not a multiple of 3 F
P(0) = multiple of 3 T
P(1) = not a multiple of 3 F
P(2) = not a multiple of 3 F
P(3) = multiple of 3 T
etc.

For each integer we can produce a proposition, this is a propositional function.

-------------------------stopped here ------------------------------

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy