Normal Forms Note: all ppts about normal forms are skipped.
|
|
- Albert Stevens
- 6 years ago
- Views:
Transcription
1 Normal Forms Note: all ppts about normal forms are skipped. Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper manner. E.g. ((p q) ( p r)) p q r is a disjunction expression, and p q r is a conjunction expression. Product for conjunction, sum for disjunction. An elementary product is a conjunction of literals. An elementary sum is a disjunction of literals. A variable of the negation of a variable is called a literal. 1
2 Disjunction/Conjunction Normal Form Disjunctive normal form (DNF) a formula which is equivalent to a given formula and consists of a sum of elementary products E.g. (p q) q ( p q) (q q), that is ( p q), which is in DNF. Conjunctive normal form (CNF) - a formula which is equivalent to a given formula and consists of a product of elementary sums E.g (p q) q ( p q) q is in CNF. 2
3 Sufficient and Necessary Condition A necessary and sufficient condition for an elementary product to be false it contains at least one pair of literals in which one is the negation of the other. A necessary and sufficient condition for an elementary sum to be true it contains at least one pair of liters in which one is the negation of the other. p p F = F p p T = T 3
4 Fallacy or Tautology A given formula is identically false (a contradiction), if every elementary product appearing in its disjunctive normal form is identically false. A given formula in a given formula is identically true (a tautology), if every elementary sum appearing in the formula has at least two literals, of which one is the negation of the other. 4
5 Principal Disjunctive Normal Form Minterms of p and q p q, p q, p q, p q each variable occurs either negated or nonnegated but not both occur together in the conjunction. Principal disjunctive normal form for a given formula, an equivalent formula consisting of disjunctions of minterms only, also called sum of products canonical form. p q = p q = (p q) ( p q) ( p q) What is the principal disjunctive normal form for (p q) ( p r) (q r)? (see example 4) 5
6 Examples of PDNF p q = p q = ( p ( p q)) ((p ( p q)) = ( p) ( p q) ( p p) (p q) =( p ( q q)) (p q) ( p q) =( p q) (p q) ( p q) What is the principal disjunctive normal form for (p q) ( p r) (q r)? (see example 4) (p q)=(p q) (r r)=(p q r) (p q r) ( p r)=( p r q) ( p r q) (q r)=(p q r) ( p q r) Hence, (p q r) (p q r) ( p q r) ( p r q) 6
7 Principal Conjunctive Normal Form Maxterms of p and q p q, p q, p q, p q each variable occurs either negated or nonnegated but not both, appears only once. Principal conjunctive normal form for a given formula, an equivalent formula consisting of disjunctions of maxterms only, also called product-of-sums canonical form. p q = p q is in PCNF. What is the principal conjunctive normal form for [(p q) p q]? (see example 6) 7
8 Examples of PDNF & PCNF p q = (p q) ( p q) in PDNF. p q = [p (q q)] [ q (p p)] = (p q) (p q) ( q p) ( q p) = (p q) (p q) ( p q) in PDNF p q = ( p q) ( q p) in PCNF (p q) (q p) = ( p q) ( q p) = ( p q) ( q p) = = (p q) in PCNF 8
9 Notations of Σ and Π (mutually exclusive) maxterms of p and q p q, p q, p q, p q represented by 00, 10, 01, 11, or Π 0, Π 2, Π 1, Π 3 Minterms of p and q p q, p q, p q, p q represented by 11, 01, 10, 00, or Σ 3, Σ 1, Σ 2, Σ 0 [(p q) p q] =[(p p ) (q p)] q =(q p) q = (q p) q = q p q = p q = Π 1 (p q) (q p) =( p q ) ( q p) = ( p q ) ( q p) =(p q) ( q (p p)) (p (q q)) =(p q) (p q) ( p q) = Σ0,2,3 = Π 1 ( 兩者互補 ) 9
10 First Order Logic Clause form statements whose elementary components are connected by the operator OR ( ) Any statement expressed in the first-order logic can be expressed in clause form. Briefly speaking, each component of a first-order logic expression is expressed by using or or not operators and the whole expression is depicted without implications. 10
11 Prenex Normal Forms (1/2) A formula F is called a Prenex normal form iff F is a first order logic and is in the form of (Q 1 x 1,, Q n x n )(M) where every (Q i x i ), i=1,,n is either ( x i ) or ( x i ) and M is a formula containing no quantifiers. (Q 1 x 1,, Q n x n ) is called the prefix, and M is called the matrix of F. 11
12 Prenex Normal Forms (2/2) Convert a first order logic into prenex normal form 1. Replace and using,, 2. Use double negation and De Morgan s law repeatedly 3. Rename the variables if necessary 4. Use rules of (i) distributes over, distributes over (ii) doesn t distribute over, doesn t distribute over and bring the quantifiers to the left. 12
13 Examples of Prenex Normal Forms (1/2) There are 4 rules which are frequently used: x P(x) x P(x) x P(x) x P(x) 3. (Qx) F(x) G Qx (F(x) G), if G doesn t contain x 4. (Qx) F(x) G Qx (F(x) G), if G doesn t contain x 13
14 Examples of Prenex Normal Forms (2/2) E.g. 1 x P(x) x Q(x) sol: ( x P(x)) x Q(x) x P(x) x Q(x) x ( P(x) Q(x)) E.g. 2 x y ( z (P(x,z) P(y,z)) uq(x,y,u) sol: x y z(p(x,z) P(y,z)) uq(x,y,u) x y ( z P(x,z) P(y,z)) uq(x,y,u) x y z u (( P(x,z) P(y,z)) Q(x,y,u)) x y z u ( P(x,z) P(x,z) Q(x,y,u)) 14
15 Terminology for Proof Axioms statements we assume to be true Proposition, Lemma, Theorem statement that can be shown to be true. Corollary theorem that can be established directly from a proven theorem Conjecture statement that is being proposed to be a true statement, usually based on the basis of some partial evidence, a heuristic argument, or an intuition of an expert. 15
16 Why Proof? Introduction to Proofs. What is a (valid) proof? Why are proofs necessary? 16
17 Introduction to Proof techniques In a proof, one uses axioms/definitions, premises and proven theorems Proof methods: direct, indirect, trivial, contradiction, proof by cases (exhaustive proof), proof of equivalence, existence proofs (constructive or non-constructive), proof by counterexamples, backward/forward reasoning Open Problems famous unsolved problems 17
18 Direct/Indirect Proof A direct proof of a conditional statement p q is constructed when the first step is the assumption that p is true, subsequent steps using rules of inference, with the final step showing q must also be true. Indirect proof if we prove the theorem without starting with the premises and end with the conclusion. E.g. If n is an odd integer, then n 2 is odd. E.g. If n is an integer and 3n+2 is odd, then n is odd. (using indirect proof) 18
19 Proof by Contraposition If (pq) (p+q)/2, then p q Direct proof?? (not trivial) Contrapositive: If p = q, then (pq) = (p+q)/2 It follows by: (pq) = (pp) = (p 2 ) = p (p+p)/2 = (p+q)/2 = p. 19
20 Vacuous and Trivial Proof Vacuous proof in p q, if we know p is false already, the conditional statement must be true. Trivial proof in p q, if we know q is already true. E.g. P(n) is if n > 1, then n 2 > n. Prove P(0) is true. E.g. P(n) is If a and b are positive integers with a b, then a n b n. Prove P(0) is true. 20
21 Proof by cases If n is an integer, then n(n+1)/2 is an integer Case 1: n is even. or n = 2a, for some integer a So n(n+1)/2 = 2a*(n+1)/2 = a*(n+1), which is an integer. Case 2: n is odd. n+1 is even, or n+1 = 2a, for an integer a So n(n+1)/2 = n*2a/2 = n*a, which is an integer. 21
22 Proof by Contradiction 2 is irrational Suppose 2 is rational. Then 2 = p/q, such that p, q have no common factors. Squaring and transposing, p 2 = 2q 2 (even number) So, p is even (if x 2 is even, then x is even) that is, p = 2x for some integer x hence, 4x 2 = 2q 2 or q 2 = 2x 2 So, q is even (if x 2 is even, then x is even) So, p,q are both even they have a common factor of 2. CONTRADICTION. So 2 is NOT rational. Q.E.D. 22
23 Indirect or Contradiction If n is an integer and n 3 +5 is odd, then n is an even Indirect proof (contrapositive) : Let n= k+1, n 3 +5 = 2(4k 3 +6k 2 +3k+3) Proof by Contradiction: Suppose that n 3 +5 is odd and n is odd 5 = (n 3 +5) - n 3 should be even, because of the difference of two odds, but it is an odd. p q: p and q are true, leading to a contradiction. 23
24 Existence Proofs (1/2) E.g.1 There exists (distinct) integers x,y,z satisfying x 2 +y 2 = z 2 Proof: x = 3, y = 4, z = 5. (by constructive existence proof) E.g.2 There is a positive integer that can be written as the sum of cubes of positive integers in two different ways. Proof: 1729 = =
25 Existence Proofs (2/2) There exists irrational b,c, such that b c is rational By nonconstructive proof: Consider 2 2. Two cases are possible: Case 1: 2 2 is rational DONE (b = c = 2). Case 2: 2 2 is irrational Let b = 2 2, c = 2. Then b c = ( 2 2 ) 2 = ( 2) 2* 2 = ( 2) 2 = 2 25
26 The Use of Counterexamples EX1. All prime numbers are odd (false) Proof: 2 is an even number and a prime. EX2. Every prime number can be written as the difference of two squares, i.e. a 2 b 2. Proof: 2 can t be written as a 2 b 2 26
27 Proof by Equivalence n is even iff n 2 is even Proof (by equivalence) Let P be n is even, Q be n 2 is even P and Q are equivalence can be proven by P Q and Q P 27
28 Proofs by Exhaustion Prove that (n+1) 3 3 n if n is a positive integer with n 4 Prove that the only consecutive positive integers not exceeding 100 that are perfect powers are 8 and 9. Show that there are no solutions in integers x and y of x 2 + 3y 2 = 8 Note that: x is perfect power if x = n a, a is a positive integer. 28
29 What is wrong with the proof? If n 2 is positive, then n is positive. Proof: Suppose that n 2 is positive. Because the conditional statement If n is positive, then n 2 is positive is true, hence we can conclude that n is positive. (fallacy of affirming the conclusion) If n is not positive, then n 2 is not positive. Proof: Suppose that n is not positive. Because the conditional statement If n is positive, then n 2 is positive is true, hence we conclude that n 2 is not positive. (fallacy of denying the hypothesis) 29
30 What is wrong with the proof? n is an even integer whenever n 2 is an even integer. Proof: Suppose that n 2 is even. Then n 2 =2k fro some integer k. Let n = 2l for some integer l. This shows that n is even. (fallacy of circular reasoning) Hint: Let n = 2l for some integer l is invalid, since no argument has been given to show that n can be written as 2l for some integer l. 30
31 Conjectures Fermat s Last Theorem x n + y n = z n has no solution in (positive) integers x,y,z with xyz =! 0 whenever n is an integer and is greater than 2. x, y, z, n such that x n + y n = z n? domain of x, y, and z is Z +, domain of n is {x\x > 2, x Z} 31
32 The 3X + 1 Conjecture 3x+1 conjecture Game: Start from a given integer n. If n is even, replace n by n/2. If n is odd, replace n with 3n+1. Keep doing this until you hit 1. e.g. n= Q: Does this game terminate for all n? 32
33 Which Mean? For two positive real numbers x and y, Arithmetic mean Is (x+y)/2 Geometric mean Is Sqrt(xy) (which is less than A-mean) Harmonic mean (G 2 = HA) Is 2/(1/x + 1/y)= 2xy/(x+y) Quadratic mean Is Sqrt((x 2 + y 2 )/2) 33
34 MEMO Read the sections of 1.7 and 1.8. Get familiar with terminology of theorem proving Be familiar with proof methods of contrapositive, counterexample, exhaustive, and existence What is the Fermat s last theorem? HW #13-15,17-19 of 1.7, #13-14,23-24,29-30 of
Disjunction/Conjunction Normal Form
Normal Forms Well formed formula (wff) also called formula, is a string consists of propositional variables, connectives, and parenthesis used in the proper manner. E.g. ((p q) ( p r)) pq r is a disjunction
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationExample ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.
Announcements CS311H: Discrete Mathematics More Logic Intro to Proof Techniques Homework due next lecture Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mathematics More Logic Intro
More informationSec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs
Section 1.7 Sec$on Summary Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction 2 Proofs of Mathema$cal Statements
More informationIntroduction to proofs. Niloufar Shafiei
Introduction to proofs Niloufar Shafiei proofs Proofs are essential in mathematics and computer science. Some applications of proof methods Proving mathematical theorems Designing algorithms and proving
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationFirst order Logic ( Predicate Logic) and Methods of Proof
First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Rules of Inference Section 1.6 Section Summary Valid Arguments
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More informationPropositional Calculus
CHAPTER - 1 Propositional Calculus Introduction Logic means reasoning. One of the important aims of logic is to provide rules through which one can determine the validity of any particular argument. Logic
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationUnit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics
Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction
More informationMath.3336: Discrete Mathematics. Proof Methods and Strategy
Math.3336: Discrete Mathematics Proof Methods and Strategy Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationEquivalence of Propositions
Equivalence of Propositions 1. Truth tables: two same columns 2. Sequence of logical equivalences: from one to the other using equivalence laws 1 Equivalence laws Table 6 & 7 in 1.2, some often used: Associative:
More informationDiscrete Mathematics
Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 9, 2009 Overview of ( 1.5-1.7, ~2 hours) Methods of mathematical argument (i.e., proof methods) can be formalized
More informationCh 3.2: Direct proofs
Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations
More informationFull file at
Transparencies to accompany Rosen, Discrete Mathematics and Its Applications Introduction Chapter 1 - Introduction Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationLecture 2: Proof Techniques Lecturer: Lale Özkahya
BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 2: Proof Techniques Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete Mathematics and App. cs.colostate.edu/
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationHomework 3: Solutions
Homework 3: Solutions ECS 20 (Fall 2014) Patrice Koehl koehl@cs.ucdavis.edu October 16, 2014 Exercise 1 Show that this implication is a tautology, by using a table of truth: [(p q) (p r) (q r)] r. p q
More information1.7 Proof Methods and Strategy
1.7 Proof Methods and Strategy Introduction We will introduce several other important proof methods: Proofs where we consider different cases separately, Proofs where we prove the existence of objects
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationProof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:
Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 32 Proofs Proofs
More informationCITS2211 Discrete Structures Proofs
CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics
More informationChapter 2 Section 2.1: Proofs Proof Techniques. CS 130 Discrete Structures
Chapter 2 Section 2.1: Proofs Proof Techniques CS 130 Discrete Structures Some Terminologies Axioms: Statements that are always true. Example: Given two distinct points, there is exactly one line that
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs
More information9/5/17. Fermat s last theorem. CS 220: Discrete Structures and their Applications. Proofs sections in zybooks. Proofs.
Fermat s last theorem CS 220: Discrete Structures and their Applications Theorem: For every integer n > 2 there is no solution to the equation a n + b n = c n where a,b, and c are positive integers Proofs
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationMidterm Exam Solution
Midterm Exam Solution Name PID Honor Code Pledge: I certify that I am aware of the Honor Code in effect in this course and observed the Honor Code in the completion of this exam. Signature Notes: 1. This
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationLogic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form.
Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form. Valentin Stockholm University October 2016 Revision: CNF and DNF of propositional
More informationECOM Discrete Mathematics
ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional
More informationProofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.
Section 1.7 Proofs of Mathema-cal Statements A proof is a valid argument that establishes the truth of a statement. Terminology A theorem is a statement that can be shown to be true using: definitions
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More informationMaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS
DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationWith Question/Answer Animations. Chapter 1, Part III: Proofs
With Question/Answer Animations Chapter 1, Part III: Proofs Summary Valid Arguments and Rules of Inference Proof Methods Proof Strategies Section 1.6 Section Summary Valid Arguments Inference Rules for
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationProofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.
Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only
More informationCSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication
CSE20: Discrete Mathematics for Computer Science Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication Disjunctive normal form Example: Let f (x, y, z) =xy z. Write this function in DNF. Minterm
More informationSome Review Problems for Exam 1: Solutions
Math 3355 Fall 2018 Some Review Problems for Exam 1: Solutions Here is my quick review of proof techniques. I will focus exclusively on propositions of the form p q, or more properly, x P (x) Q(x) or x
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationSteinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)
Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement
More information2. Prove that there are no positive perfect cubes less than 1000 that are the sum of the cubes of two positive integers.
Page 108 Exercises 1. Prove that n2 + 1 2n when n is a positive integer with 1 n 4. 2. Prove that there are no positive perfect cubes less than 1000 that are the sum of the cubes of two positive integers.
More informationFoundation of proofs. Jim Hefferon.
Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are
More informationCSC 125 :: Final Exam May 3 & 5, 2010
CSC 125 :: Final Exam May 3 & 5, 2010 Name KEY (1 5) Complete the truth tables below: p Q p q p q p q p q p q T T T T F T T T F F T T F F F T F T T T F F F F F F T T 6-15. Match the following logical equivalences
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationCS206 Lecture 03. Propositional Logic Proofs. Plan for Lecture 03. Axioms. Normal Forms
CS206 Lecture 03 Propositional Logic Proofs G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 12 Fri, Jan 03, 2003 Plan for Lecture 03 Axioms
More information1.1 Language and Logic
c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationHandout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte
Handout on Logic, Axiomatic Methods, and Proofs MATH 3181 001 Spring 1999 David C. Royster UNC Charlotte January 18, 1999 Chapter 1 Logic and the Axiomatic Method 1.1 Introduction Mathematicians use a
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationWhat is Logic? Introduction to Logic. Simple Statements. Which one is statement?
What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo
More informationDiscrete Mathematical Structures: Theory and Applications
Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with
More informationLogic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.
Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationIn Exercises 1 12, list the all of the elements of the given set. 2. The set of all positive integers whose square roots are less than or equal to 3
APPENDIX A EXERCISES In Exercises 1 12, list the all of the elements of the given set. 1. The set of all prime numbers less than 20 2. The set of all positive integers whose square roots are less than
More informationStatements, Implication, Equivalence
Part 1: Formal Logic Statements, Implication, Equivalence Martin Licht, Ph.D. January 10, 2018 UC San Diego Department of Mathematics Math 109 A statement is either true or false. We also call true or
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationSection 3.1: Direct Proof and Counterexample 1
Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion
More informationPropositional Resolution
Artificial Intelligence Propositional Resolution Marco Piastra Propositional Resolution 1] Deductive systems and automation Is problem decidible? A deductive system a la Hilbert (i.e. derivation using
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationDiscrete Mathematics Basic Proof Methods
Discrete Mathematics 1-2. Basic Proof Methods Nature & Importance of Proofs In mathematics, a proof is: a correct(well-reasoned, logically valid) and complete (clear, detailed) argument that rigorously
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationAnnouncements. Exam 1 Review
Announcements Quiz today Exam Monday! You are allowed one 8.5 x 11 in cheat sheet of handwritten notes for the exam (front and back of 8.5 x 11 in paper) Handwritten means you must write them by hand,
More information