


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Logic notes in discrete mathematics
Typology: Lecture notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!
Propositions : A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. We say that the truth value of a proposition is either true (T or 1) or false ( F or 0). New propositions, called compound propositions, are formed from existing propo- sitions using logical operators.
Logical Operators : Let p,q be two propositions, (a) negation: “not p”, ¬p, ∼ p, p′, ¯p (b) conjunction: “p and q”, p ∧ q, pq (c) disjunction: “p or q”, p ∨ q, p + q (d) exclusive or: “exactly one of p or q”, “p xor q”, p ⊕ q. (e) implication: “if p then q”, p → q. (f) biconditional: “p if and only if q”, p ↔ q, p iff q
Truth Table :
p q ¬p p ∧ q p ∨ q p ⊕ q p → q p ↔ q F F T F F F T T F T T F T T T F T F F F T T F F T T F T T F T T
Implication Operator : This is one of the most important operator in logic. Let p, q be two propositions. We say ”if p then q ”, written as p → q, is False only when p is true and q is false, otherwise true. p → q is true when either p is false or q is true. p → q ≡ p′^ + q
p → q can also be expressed as following :
For the compound statement p → q,
Precedence of Logical Operators :
¬ > ∧ > ∨ > → > ↔
Tautology, Contradiction, Contingency, Satisfiability : A compound proposition that is always true is called a tautology. A compound proposition that is always false is called a contradiction. A compound proposition that is neither a tautology nor a contradiction is called a contingency. A compound proposition that is either a tautology or a contingency is called Satisfiable. A compound proposition that is a contradiction, is called unsatisfi- able.
Propositional Equivalences : Compound propositions that have the same truth values in all possible cases are called logically equivalent. The compound propositions p and q are called logically equivalent, denoted by p ≡ q, if p ↔ q is a tautology, i.e. p → q and p ← q.
Some laws in logic :
Let p,q,r be any three propositions.
Existential quantifier : Let Q(x) be a predicate and D the domain of x. An existential statement is a statement of the form “∃x ∈ D such that Q(x).” It is defined to be true if, and only if, Q(x) is true for at least one x in D. It is false if, and only if, Q(x) is false for all x in D. Here ∃ is called the existential quantifier.
Negating Quantified Expressions : ¬∀xF ≡ ∃x¬F ¬∃xF ≡ ∀x¬F
Nested Quantifiers : Let Q(x, y) be some predicate where domain for variable x, y is D.