Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

The Conditional Statement and Circuits - Outlines | MATH 1630, Study notes of Mathematics

Material Type: Notes; Professor: Smith; Class: Finite Mathematics; Subject: Mathematics; University: Nashville State Technical Community College; Term: Unknown 1989;

Typology: Study notes

Pre 2010

Uploaded on 08/19/2009

koofers-user-qf1
koofers-user-qf1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
MATH 1630 – Outline for 3.3
3.3 – The Conditional Statement and Circuits
Definition:
Conditional Statement – If p, then q
(p = antecedent, q = consequent)
I. Truth Table for p
q
p q p
q
T T T
T F F
F T T
F F T
II. Determine the truth value of a compound statement using all 4 connectives (And,
Or, Not, If…then)
a.)
qrp
)~(
b.) )()( qprq
III. Build truth tables for compound statements using all 4 connectives and be able
to determine a tautology
a.) pqp
)~ (
b.) )()( qpqp
IV. Negation of p
q (this is the third type of negation that we will cover)
qpqp ~)(~
Note: the negation of If p, then q becomes p AND not q
V. Circuits
Key: Determine all of the paths through which electricity can flow, combine them
into a compound statement, and then simplify (see table on p.119).

Partial preview of the text

Download The Conditional Statement and Circuits - Outlines | MATH 1630 and more Study notes Mathematics in PDF only on Docsity!

MATH 1630 – Outline for 3.

3.3 – The Conditional Statement and Circuits

Definition:

Conditional Statement – If p, then q (p = antecedent, q = consequent)

I. Truth Table for p → q

p q p → q T T T T F F F T T F F T

II. Determine the truth value of a compound statement using all 4 connectives (And, Or, Not, If…then) a.) ( p ∧ ~ r )→ q

b.) ( qr )→( pq )

III. Build truth tables for compound statements using all 4 connectives and be able to determine a tautology a.) ( p → ~ q )→ p

b.) ( pq )→( pq )

IV. Negation of p → q (this is the third type of negation that we will cover)

~ ( pq )≡ p ∧~ q

Note: the negation of If p, then q becomes p AND not q

V. Circuits

Key: Determine all of the paths through which electricity can flow, combine them into a compound statement, and then simplify (see table on p.119).