Exam (elaborations)
D420 Discrete Math_ Logic _ 2024 Questions & Answers Already Passed!!.pdf
- Course
- Institution
D420 Discrete Math_ Logic _ 2024 Questions & Answers Already Passed!!.pdf
[Show more]
Seller
Follow
Content preview
8/31/24, 5:46 PMD420 Discrete Math: Logic
Jeremiah
Terms in this set (111)
proposition a statement that is either true or false
and
^
or
v
¬ negation
conditional operation, "if p, then q"
→
If p, q
q, if p
Equivalent English expressions that mean "if p implies q
p, then q" p only if q
p is sufficient for q
q is necessary for p
in a conditional proposition "→" p is the _______ p is the hypothesis and q is the conclusion
and q is the __________
The converse is the opposite of the For example, the converse of p → q (if p then q) is q → p (if q then p). If p → q is true, it
conditional statement does NOT guarantee that q → p is true
The inverse is the negation of the conditional For example, the inverse of p → q (if p then q) is ¬p → ¬q (if not p then not q). If p → q
statement is true, it does NOT guarantee that ¬p → ¬q is true
The contrapositive is the opposite and For example, the contrapositive of p → q (if p then q) is ¬q → ¬p (if not q then not p). If
negative of the conditional statement p → q is true, it DOES guarantee that ¬q → ¬p is true
1/7
, 8/31/24, 5:46 PM
is read "p is necessary and sufficient for q" or "if p
then q, and conversely" or "p if and only if q"
biconditional operation
Two compound propositions are logically equivalent if they have the same truth value.
Logical equivalence p ≡ q That is, the truth value in the final column in a truth table is the same for both
compound propositions
tautology If the compound propositions is always true. For example, p∨¬p.
contradiction if the compound proposition is always false. For example, p∧¬p.
logical equivalences that show how to correctly distribute a negation operation inside a
parenthesized expression containing the disjunction or conjunction operator.
De Morgan's Law
¬(p ∨ q) = (¬p ∧ ¬q)
¬(p ∧ q) = (¬p ∨ ¬q)
p ∨ (p ∧ q) ≡ p
Absorption laws
p ∧ (p ∨ q) ≡ p
(p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
Associative laws
(p ∧ q) ∧ r ≡ p ∧ (q ∧ r)
p∨q≡q∨p
Commutative laws
p∧q≡q∧p
p ∧ ¬p ≡ F
¬T ≡ F
Complement laws
p ∨ ¬p ≡ T
¬F ≡ T
p → q ≡ ¬p ∨ q
Conditional identities
p↔q≡(p→q)∧(q→p)
p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Distributive laws
p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r)
p ∨T≡T
Domination laws
p ∧F ≡F
Double negation law ¬(¬p) ≡ p
p∨p≡p
idempotent laws
p∧p≡p
p ∧T≡ p
identity laws
p ∨F ≡p
predicate a logical statement whose truth value is a function of one or more variables
domain of the predicate the set of all possible x values for P(x) is called the domain of the predicate
universal quantifier "for all x", is denoted ∀x, P(x). This means that for all values of x in the domain of P(x),
the predicate is true.
D420 Discrete Math: Logic
2/7
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Denyss. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $7.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
73314 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now