Scribd
Upload
93 views2 pages

6.042 Midterm 1

The document defines key logical and mathematical terms including: - Axiom, contrapositive, corollary, DeMorgan's Law, implication, lemma, literal, logical deductions, modus ponens, predicate, proposition, prime factorization theorem, satisfiability, soundness, theorem, well-ordering principle It also outlines common proof techniques such as: - Proof by implication, proving the contrapositive, proving an if and only if statement, proof by contradiction, proof by cases Finally, it discusses truth tables, proof by well-ordering principle, irrational proofs, conjunctive and disjunctive normal forms, and equivalences.

Uploaded by

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

6.042 Midterm 1

The document defines key logical and mathematical terms including: - Axiom, contrapositive, corollary, DeMorgan's Law, implication, lemma, literal, logical deductions, modus ponens, predicate, proposition, prime factorization theorem, satisfiability, soundness, theorem, well-ordering principle It also outlines common proof techniques such as: - Proof by implication, proving the contrapositive, proving an if and only if statement, proof by contradiction, proof by cases Finally, it discusses truth tables, proof by well-ordering principle, irrational proofs, conjunctive and disjunctive normal forms, and equivalences.

Uploaded by

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

- Axiom: proposition accepted as true

- Contrapositive: P implies Q à NOT (Q) implies NOT (P)


- Corollary: proposition that follows in few logical steps from theorem
- DeMorgan’s Law: NOT(A AND/OR B) ó NOT(A) OR/AND NOT(B)
- Implies: True exactly when if-part is false or then-part is true.
- Lemma: preliminary proposition to prove later propositions
- Literal: propositional variable or its negation
- Logical deductions/inference rules: used to prove new propositions using prev. proved ones.
- Modus Poenus: (top = antecedent, bottom= conclusion/consequent), used to prove new proposition
using previously proved ones. Proof of P with proof of P implies Q is a proof of Q.
- Predicate: proposition whose truth depends on value of variables
- Proposition: statement that is true or false
- Prime Factorization Theorem: Every positive integer > 1à factored as product of primes.
- Satisfiable (vs. valid): Formula is sometimes true (vs. always true)
- Soundness: System for proving formulas is sound when every provable formula is valid
- Theorem: important true proposition
- Well-Ordering Principle: Every nonempty set of nonnegative integers has a smallest element.
- ::= equal by definition, = for all, = there exists

PROOF BY IMPLICATION (P implies Q)


1. Assume P. Show that Q logically follows.

PROVE THE CONTRAPOSITIVE


1. We prove the contrapositive. State it.
2. Assume if statement.
3. Show statement logically follows.

PROVING AN IF AND ONLY IF (IFF)


1. Method 1: Prove each statement implies each other.
a. P iff Q is equivalent to P implies Q and Q implies P.
b. We prove that P implies Q and vice-versa (show both situations)
2. Method 2: Construct a chain of iff’s.
a. “We construct a chain of iff implications.” Prove P is equivalent to statement until Q is reached.

PROOF BY CONTRADICITION (indirect proof)


1. We use proof by contraction.
2. Suppose P is false.
3. Deduce something known to be false.
4. This is a contradiction.
5. Therefore, P must be true.

PROOF BY CASES
1. Proof by case analysis. Let x denote…. There are certain # of cases.
2. Case #1: (have). Case #2: (have not).

TRUTH TABLES:
PROOF BY WOP
1. Define set C of counterexamples to being true. Specifically:
2. For proof by contradiction, assume C is nonempty.
3. By WOP, there will be a smallest element n in C.
4. Reach a contradiction: show P(n) is true or another element of C is smaller than n.
5. Conclude that C must be empty. That is, no counterexamples exist.

IRRATIONAL PROOF

MAKEABLE PROOF

CONJUNCTIVE + DISJUNCTIVE NORMAL FORMS


- Normal form = each product contains all variables.
- CONJUNCTIVE: (A or B) AND (B or C) AND (C or D) à “and of or’s”
o Rows with value F (i.e. if A=T, B=F, C = F in truth table, express as NOT(A) OR B OR C).
- DISJUNCTIVE: (A and B) OR (B and C) OR (C and D) à “or of and’s”
o Rows with value T (i.e. take exactly from truth table)

EQUIVALENCES:

You might also like