Conjunction: 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.
|
|
- Leona Boone
- 5 years ago
- Views:
Transcription
1 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 a property that a variable (or a list of variables) might have; a predicate in the variables x 1,..., x n returns a value T or F for each choice of values of x 1,..., x n. Example. Let φ(n) denote n is prime. Then φ is a predicate; φ(17) is a true sentence and φ(4) is a false sentence. Also, if n is an integer, then φ(n) is a false sentence. Definitions. A predicate is said to be a compound sentence if the variables of the predicate are propositions. Given a compound sentence, all possible truth inputs can be inserted, and the corresponding truth outcomes listed. Such a list is known as a truth table. 1.2 Logical Connectives Let p and q be sentences. The following definitions are made. Disjunction: p q is true if at least one of p, q is true, and false if both p, q are false. The truth table for disjunction is as follows. p q p q T T T T F T F T T F F F Conjunction: 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. p q p q T T T F F F Negation: p is false if p is true, and true if p is false. The truth table for negation is as follows. p p T F F T 3
2 Implication: p q means ( p) q. The truth table for implication is as follows. Note that q p is the same as p q. p q p ( p) q T T F T F F T T T F F T T Equivalence: p q means (p q) (q p), p if and only if q. The truth table for equivalence is as follows. p q p q q p p q T T T T T T F F T F F T T T Examples. Let p and q be sentences. 1. Consider the compound sentence p (p ( q)). The truth table is as follows. Hence, this compound sentence is always true. p q q p ( q) p (p ( q)) T T T F T T T T T F F T T T 2. Consider the compound sentence p (q (p q)). The truth table is as follows. p q p q q (p q) p (q (p q)) T T T T T T F T T T F T T T F F F, whence p (q (p q)) has the same outcomes as p. Definitions. Two compound sentences, P and Q, are said to be logically equivalent if P and Q have the same truth tables, written P Q. A compound sentence that is true for all values of the inputs is called a tautology. A compound sentence that is always false is called a contradiction. Examples. Let p and q be sentences 1. As above, p (p ( q)) is a tautology. 2. Also from above, p (q (p q)) p. 3. Let p and q be sentences and consider the compound sentence p (p q). The truth table is as follows. p q p q p (p q) T T T T T F T T T F F T T Hence, p (p q) is a tautology. 4
3 4. Consider the compound sentence p ( p). The truth table is as follows. Hence, p ( p) is a tautology. p p p ( p) 5. Consider the compound sentence p ( p). The truth table is as follows. Hence, p ( p) is a contradiction. p p p ( p) 6. Consider the compound sentence p ( p). The truth table is as follows. p p p ( p) F T T 7. Finally, consider the compound sentence p (p q). The truth table is as follows. Hence, p (p q) is a tautology. p q p q p (p q) T T T T T F T T F T T T F F F T Definitions. Let p and q be sentences. The following terminology is used: 1. if p then q means p q; 2. q if p means p q; 3. p is a sufficient condition for q means p q; 4. p is a necessary condition for q means q p; 5. p unless q means ( p) q, that is, p q; 6. either p or q means (p q) ( (p q)) known as exclusive or. Remark. In common usage, either... or is often used for emphasis, when inclusive or is intended. Definitions. A definition is an agreement to assign a certain name to those x that make a certain predicate true (the if is a definition is really an if and only if sometimes written in short form as iff ). An axiom is an agreement to make a certain statement true. Theorem. Let P and Q be compound sentences. Then P Q if and only if P Q is a tautology. Proof. Assume firstly that P Q. Then for any truth inputs, P and Q are both true or both false, so P Q is true, so P Q is a tautology. Conversely, assume that P Q is a tautology. Then, for any inputs, P Q is true, so P and Q are both true or both false, so P and Q have the same truth table, so P Q. Lemma. For any sentence p, ( p) p. Proof. Consider the following truth table. p p ( p) T F T The first and third columns agree, so ( p) p as required. 5
4 1.3 De Morgan s Laws and the Distributive Laws Theorem (De Morgan s Laws). Let p, q and r be sentences. Then De Morgan s laws state that (p q) ( p) ( q); (p q) ( p) ( q). Proof. For the first law, consider the following truth table. p q p q (p q) p q ( p) ( q) T T F F T F T F F T T F F F F T T T T Hence (p q) and ( p) ( q) have the same truth table, so (p q) ( p) ( q), as required. The second law may be deduced from the first law. If p P and q Q are substituted into the first law, then (( P ) ( Q)) P Q. Negating this equivalence and using ( r) r now gives as required. ( P ) ( Q) (P Q), Theorem (The Distributive Laws for Propositions). Let p, q and r be propositions. Then, the distributive laws state that p (q r) (p q) (p r); p (q r) (p q) (p r). Proof. The first law can be proved by considering the following truth table. p q r q r p (q r) p q p r (p q) (p r) T T T T T T T T T T F T T T F T T F T T T F T T F T T F F F F T F F F F F F F F F F F F F F F F F The second law may also be proved by means of a truth table. Alternatively, forming the negation of each side of the first law, and using De Morgan s laws, gives (p (q r)) ((p q) (p r)) ( p) ( (q r)) ( (p q)) ( (p r)) ( p) (( q) ( r)) (( p) ( q)) (( p) ( r)). Replacing p by P, q by Q and r by R now gives P (Q R) (P Q) (P R), and since p, q and r were arbitrary sentences, the second law follows as required. Example. For sentences p and q, (p q) (( p) q) ( p) ( q) p ( q). 6
5 Remark. Suppose that p(x) and q(x) are predicates. Then, p(x) q(x) should mean that for all x such that p(x) is true, q(x) is also true. If p(x) q(x) is false, then there are some instances of p(x) being true but q(x) being false, that is, there exists an x for which p(x) ( q(x)). Remark. It is possible to call the truth values 0 (for false) and 1 (for true). If this convention is adopted, then makes 1 into 0, and 0 into 1, so p is 1 Truth(p). p q means that q is at least as true as p or Truth(q) Truth(p). p q has truth value min(truth(p), Truth(q)), or even just Truth(p). Truth(q). p q has truth value max(truth(p), Truth(q)) or even Truth(p) + Truth(q), but = 1 in this case. This makes the system of truth values into what is called a Boolean Algebra. This actually proves that the propositional calculus is complete; that is, given a phrase X in propositional calculus it is always possible to answer the question is X a tautology? by writing out truth tables. 1.4 Standard Methods of Argument Let p and q be sentences. The following are some standard methods of argument. Proof. Reductio ad absurdum: (( p) q) ( q)) p is a tautology. Proof by Contraposition: (p q) ( q) ( p) Modus Ponens (Method of Placing): (p (p q)) q is a tautology. Recall that p q ( p) q. Hence, (( p) q) ( q)) p ((( p) q) ( q)) p Thus, (( p) q) ( q)) p is a tautology. ((p q) ( q)) p ((p ( q)) (p ( q))) p (p ( q)) p ( p) q p T. In this case, ( q) ( p) ( q) ( p) q ( p) ( p q p q. In this case, (p (p q)) q (p (p q)) q (p ( p q)) q ((p ( p) (p q)) q (p q) q ( p) ( q) q T. Hence, (p (p q)) q is a tautology, as required. 7
6 Remarks. The first method above is argument by contradiction. q p is sometimes easier to prove than p q. Since ( p) p, in order to prove p, it is sometimes easier to disprove p. Definitions. Suppose that φ is a predicate in one variable. Then x φ(x) means φ(x) is true for every value of the variable x, and x φ(x) means φ(x) is true for some value of the variable x. The symbol is called the universal quantifier, and the symbol is called the existential quantifier. Example. If ψ is a predicate in three variables, then x y zψ(x, y, x) is a proposition and x yψ(x, y, z) is now a predicate in one variable. Definition. In an example such as the above, the variables preceded by a quantifier are known as bound variables and the other variables are known as free variables. Remark. To disprove x φ(x) it is just necessary to find (at least) one x for which φ(x) is false; such an x is called a counterexample. 1.5 Forming the Negation of a Statement Lemma. Let φ be a predicate in one variable. Then, ( x φ(x)) ( x φ(x)); ( x φ(x)) ( x φ(x)). Proof. Firstly, ( x φ(x)) is true if and only if there is a counterexample, that is, if and only if x φ(x). Similarly, ( x φ(x)) is true if and only if φ(x) is never true, that is, if and only if x φ(x). Remarks. 1. The notation is sometimes used to mean, but the notation is seldom seen. 2. If an expression contains several quantifiers, then in general their order is important. However, two consecutive universal quantifiers may be interchanged, as may two consecutive existential quantifiers can be interchanged. For example, x y φ(x, y) y x φ(x, y); x y φ(x, y) y x φ(x, y); x y φ(x, y) y x φ(x, y); y x φ(x, y) x y φ(x, y), but generally, one cannot write in the last two expressions. Examples. Let m, n be integer variables and let φ(m, n) be the predicate m = 1+n 2. Then n mφ(m, n) is true and m n φ(m, n) is false; m = 3 gives a counterexample. Also, m n φ(m, n) is false; whatever m is, the equation m = 1 + n 2 has at most 2 solutions n. Two or More Quantifiers Consider the following illustrative examples ( x y φ(x, y)) x ( y φ(x, y)) x y φ(x, y) ( x y φ(x, y)) x ( y φ(x, y)) x y φ(x, y) 8
7 3. Let f : R R be a function, and a R. The statement f is continuous at a means ɛ > 0 δ > 0 x R ( x a < δ f(x) f(a) < ɛ). By negation, the statement f is not continuous at a may be formulated. Then, f is discontinuous at a if and only if ( ɛ > 0 δ > 0 x R ( x a < δ f(x) f(a) < ɛ)) ɛ > 0 ( δ > 0 x R ( x a < δ f(x) f(a) < ɛ)) ɛ > 0 δ > 0 ( x R ( x a < δ f(x) f(a) < ɛ)) ɛ > 0 δ > 0 x R ( x a < δ f(x) f(a) < ɛ) ɛ > 0 δ > 0 x R ( ( x a < δ) ( f(x) f(a) < ɛ) ɛ > 0 δ > 0 x R ( x a < δ f(x) f(a) ɛ). 9
COMP 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 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 information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
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 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 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 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 information2-4: The Use of Quantifiers
2-4: The Use of Quantifiers The number x + 2 is an even integer is not a statement. When x is replaced by 1, 3 or 5 the resulting statement is false. However, when x is replaced by 2, 4 or 6 the resulting
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
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 informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
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 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 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 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 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 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 information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
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 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 informationLogical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional
Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p
More informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
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 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 informationPROPOSITIONAL CALCULUS
PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and
More informationA. Propositional Logic
CmSc 175 Discrete Mathematics A. Propositional Logic 1. Statements (Propositions ): Statements are sentences that claim certain things. Can be either true or false, but not both. Propositional logic deals
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
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 information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationcse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference
cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference quantifiers x P(x) P(x) is true for every x in the domain read as for all x, P of x x P x There is an x in the
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 Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
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 informationToday. Proof using contrapositive. Compound Propositions. Manipulating Propositions. Tautology
1 Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta datta@cs.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cs.yorku.ca/course/1019
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 informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationPredicate Calculus lecture 1
Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE
More informationBasic Logic and Proof Techniques
Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More informationn logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
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 informationIntroduction to Decision Sciences Lecture 2
Introduction to Decision Sciences Lecture 2 Andrew Nobel August 24, 2017 Compound Proposition A compound proposition is a combination of propositions using the basic operations. For example (p q) ( p)
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationCSE 20: Discrete Mathematics
Spring 2018 Summary Last time: Today: Logical connectives: not, and, or, implies Using Turth Tables to define logical connectives Logical equivalences, tautologies Some applications Proofs in propositional
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination I (Spring 2008) Problem 1: Suppose A, B, C and D are arbitrary sets.
More informationMATH 2001 MIDTERM EXAM 1 SOLUTION
MATH 2001 MIDTERM EXAM 1 SOLUTION FALL 2015 - MOON Do not abbreviate your answer. Write everything in full sentences. Except calculators, any electronic devices including laptops and cell phones are not
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
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 informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationReview. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.
Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,
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 informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationMathematical Reasoning (Part I) 1
c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither
More informationCHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic
CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design
More informationWhat is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.
Question 1. [10 marks] Part (a) [2 marks] What is the decimal (base 10) representation of the binary number 110101? Show your work and place your final answer in the box. 2 0 + 2 2 + 2 4 + 2 5 = 1 + 4
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
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 informationGlossary of Logical Terms
Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
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 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 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 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 informationA Guide to Proof-Writing
A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationAMTH140 Lecture 8. Symbolic Logic
AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning
More informationLogic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:
Logic Logic is a discipline that studies the principles and methods used in correct reasoning It includes: A formal language for expressing statements. An inference mechanism (a collection of rules) to
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
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 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 informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationLogic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014
John Nachbar Washington University December 26, 2014 Logic and Proofs 1 1 Overview. These notes provide an informal introduction to some basic concepts in logic. For a careful exposition, see, for example,
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationSection 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
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 informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationLECTURE 1. Logic and Proofs
LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and
More information