Why Learning Logic? Logic. Propositional Logic. Compound Propositions
|
|
- Jeffery Patrick
- 5 years ago
- Views:
Transcription
1 Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional logic Predicates and quantifiers Valid arguments Rules of inference Reference: 1.1, 1.2, 1.3, 1.4, 1.5, 1.6 Why Learning Logic? Logic has broad applications to mathematics, philosophy, engineering, law, and other fields. Logic is the basis of all mathematical reasoning and of all automated reasoning. Reasoning is the essential ability to infer what is unknown from what is known. It has practical applications to computer hardware design, system specification, computer programming, artificial intelligence, and other areas of CS. 1 2 Propositional Logic A proposition is a declarative sentence that is either true or false. Ex Are the following propositions? 1) Guelph is a city of Ontario. 2) The Earth rotates around the Moon. 3) Who authored the book On the Origin of Species? 4) Please write a Java program to sort integers. 5) 3 7 = 20. 6) 5 + y = 15. Denote propositional variables (PVs) by letters p, q, r, s,, and truth values by T and F. Compound Propositions A compound proposition (CP) is formed from existing propositions using logical operators. Negation of proposition p is p. Truth table of negation Conjunction of p and q: p q Ex p: John played well in the tennis game. q: John lost the game. Disjunction of p and q: p q Ex Take Tylenol when you have headache or body pain. Ex All entrees served with soup or salad. Exclusive or of p and q: p q 3 4 1
2 Compound Proposition: Implication Conditional p q (implication) Common expressions p implies q if p, then q p is sufficient for q p only if q q whenever p q follows from p p: hypothesis, antecedent or premise q: conclusion or consequence Ex p: You take a vacation ; q: You are energized. Causal relation between p and q is not required. Do not confuse p q with if then statement in programming languages. Other conditional statements related to p q 1) Converse q p 2) Contrapositive q p 3) Inverse p q 5 Compound Proposition: Biconditional Biconditional p q Common expressions if p then q, and vice versa p if and only if q p is necessary and sufficient for q p iff q Ex p: Zoe can visit CN Tower ; q: Zoe buys ticket. p q is true when exactly both p q and q pare true. In natural language, a biconditional may be stated as if it is an implication. Ex If you finish the homework, then you can play. 6 Truth Table of Compound Proposition Truth tables of logic operators p q p p q p q p q p q q p p q T T F T T F T T T T F F F T T F T F F T T F T T T F F F F T F F F T T T The truth value of any compound proposition can be determined using truth tables of logic operators. Ex Determine truth table for p (( q) (p q)) Ex What is the truth table for p q p q? Precedence of logic operators (highest),,,,, (lowest) Application of Propositional Logic (PL) Logic has applications in mathematics, philosophy, computer science, engineering, and many other areas. Expressing English Sentences English sentences may be ambiguous while the meaning of logic sentences are precise. Once information in English is translated into logic expressions, they can be used in automated reasoning by artificial intelligence systems. Ex Engine cannot start if battery is dead or there is no gas or electrical cable is broken. In each row of truth table where CP = T, PV values convey the meaning of English sentence
3 Application of PL: Bit Operation Inside computers, information is encoded by bits. A bit is a symbol with values 0 or 1. Parallel to propositional logic Logic F/T PV Bit Op 0/1 Boolean variable NOT AND OR XOR A bit string is a sequence of zero or more bits. The length of a bit string is its number of bits. Ex Determine if a message bit string from network is intended for the computer of address String where bit locations 7 to 12 form the destination address Application of PL: Boolean Searches Logical operators are commonly used for searching large collections of information. Ex Implicit AND in Google Search terms are connected automatically by AND. Ex Case insensitivity by implicit OR Automatically use disjunction of alternative cases Ex Explicit OR in Google Disjunction of terms is specified by OR or Application of PL: Logic Circuits Logic circuits in computer hardware and many control systems are based on propositional logic. Basic units of logic circuits are inverter, AND gate and OR gate, where each input or output signal is a bit. p p p p q p q q p q Combinatorial circuit can be constructed from gates, which can implement a compound proposition. p q r r p q r p (q r) 11 Logical Equivalence: Intuition A key step in any rigorous argument is to replace one statement with another of the same truth value. Ex Persecution claims that the suspect was motivated to commit the crime and was in the crime scene. Defence argues that the suspect was either not motivated for the crime or not in crime scene, or both. Does the argument of defence negate the persecution statement? 12 3
4 Logical Equivalence A tautology is a CP that is always true. A contradiction is a CP that is always false. A contingency is a CP that is neither of the above. Ex Tautology, contradiction, and contingency CPs p and q are logically equivalent, denoted p q, if p q is a tautology. Ex Are p q and q p logically equivalent? Ex Does p (q r) (p q) (p r) hold? Truth table of a CP of n PVs has 2 n rows. Ex Application of De Morgan law Important Equivalences (1) 1. Identity: p T p p F p 2. Domination: p T T p F F 3. Idempotent: p p p p p p 4. Double negation: ( p) p 5. Commutative: p q q p p q q p 6. Associative: (p q) r p (q r) (p q) r p (q r) 7. Distributive: p (q r) (p q) (p r) p (q r) (p q) (p r) 8. De Morgan: (p q) p q (p q) p q Important Equivalences (2) 9. Absorption: p (p q) p p (p q) p 10. Negation: p p T p p F 11. Contraposition: p q q p 12. Implication elimination: p q p q 13. Biconditional elimination: p q (p q) (q p) Constructing New Equivalences There are infinitely many logical equivalences. How do we obtain one when we need it? 1) Verify by truth tables. 2) Construct from known equivalences. Transitivity: If p q and q r, then p r. A proposition u in a CP r can be replaced by a logically equivalent CP v without changing the truth value of r. Ex Show (p q) p q
5 Satisfiability A CP is satisfiable if there is an assignment of truth values to its PVs that makes it true. The assignment is a solution to the satisfiability problem. A CP is unsatisfiable iff it is a contradiction. A CP is unsatisfiable iff its negation is a tautology. How can satisfiability of a CP be determined? Ex Determine satisfiability for each CP below. 1) (p q) (q r) (r p) 2) (p q r) ( p q r) 3) (p q) (q r) (r p) (p q r) ( p q r) Application of PL: System Specifications Ex Decide if the system specs are consistent. 1) Either device x is installed or device y is installed. 2) Device y is not installed. 3) If device y is installed, then device x is installed. Solution method a) Determine PVs. b) Express each system spec as a CP. c) Express the collection of system specs as a conjunction q. d) Determine satisfiability of q. e) The system specs are consistent iff q is satisfiable Application of PL: Logic Puzzles Logic puzzles are fun activities to practice logic and are often used to demo automated reasoning systems. Ex Dad lets kids John and Mary to play outside, and both get mud on foreheads. When they return, dad says At least one of you has a muddy forehead. He then asks kids to answer the question Do you know whether you have a muddy forehead? by Yes or No. He asked twice. What is the answer of each kid at each time? Assumptions 1) A kid can see the other forehead but not his or her own. 2) Both kids answer each question simultaneously. Why Learning Predicate logic Propositional logic cannot adequately support certain expressions and reasoning patterns. Ex From a) and b), we should be able to conclude c). a) Every Canadian province has a capital city. b) Ontario is a Canadian province. c) Ontario has a capital city. Predicate logic is a more powerful type of logic. It is also called first order logic (FL)
6 Predicates Ex A statement with variable ``x is an even number The statement can be expressed in FL by P(x). P denotes predicate is an even number. x is the variable. Statement P(x) is the value of propositional function P at x. Once a value is assigned to x, statement P(x) becomes a proposition and has a truth value. Ex Denote ``Province x has the capital city y by C(x, y). What is the truth value of C(Ontario, Guelph)? A statement P(x 1,,x n ) is the value of propositional function P at n tuple (x 1,,x n ), and P is a n ary predicate. Application of FL: Program Verification The functionality of a program can be stated by a pair of precondition and postcondition. Predicates can be used to specify preconditions and postconditions. Correctness of program is established by showing that whenever the input satisfies precondition, the output will satisfy postcondition. Ex Program to swap values of variables x and y 1. temp := x; 2. x := y; 3. y := temp; The Universal Quantifier We often express that a predicate is true over a range of objects. This is quantification. We do so with words all, many, some, few, one, none, etc. A domain refers to all possible values of one variable. Universal quantification of P(x) is the statement P(x) for all values of x in the domain, and is denoted x P(x). Ex Let P(x) denote x/2 < x. What is the truth value of x P(x), where the domain of x is all positive reals? Ex Answer the above question for the domain of reals. A value x s.t. P(x) is false is a counterexample of x P(x). If the domain is empty, x P(x) is true. The Existential Quantifier Existential quantification of P(x) is the statement There exists a value in the domain s.t P(x), denoted x P(x). Ex Let P(x) denote x/2 < x. What is the truth value of statement x P(x), where the domain is all reals? What if the domain is all negative reals? If the domain is empty, x P(x) is false. When the domain is finite, the quantification x P(x) is equivalent to a disjunction. To decide the truth value for x P(x), loop through each x. If a value is found where P(x) is true, then x P(x) is true. Otherwise, x P(x) is false. For a finite domain, the quantification x P(x) is equivalent to a conjunction, and a similar procedure can be used to decide its truth value
7 Variable Bounding Quantifiers and have higher precedence than logical operators,,,,. Ex x P(x) Q(x) When a quantifier is applied to a variable x, this occurrence of x is bound. If x is neither bound, nor set to a particular value, then x is free. To turn a propositional function into a proposition, all its variables must be bound or set to particular values. The part of a logic expression to which a quantifier is applied is the scope of the quantifier. Logical Equivalences Involving Quantifiers Statements S and T with predicates and quantifiers are logically equivalent, denoted S T, iff they have the same truth value no matter which predicates are substituted into them and which domain is used for their variables. Ex Determine equivalence. S: x P(x). T: x P(x). De Morgan s laws for quantifiers 1) x P(x) x P(x) 2) x P(x) x P(x) Ex Negation of x (x 2 <x) Nested Quantifiers Ex x y (x * y = y * x), where x and y are reals. Everything in the scope of a quantifier can be viewed as a propositional function. View x y P(x,y) as x Q(x), where Q(x) = y P(x,y). Ex Every computer has a CPU. Think nested quantifiers through nested loops. Ex Determine the truth of x y (2x + y = 10), where x is from {1,2,3} and y is from {1, 2,, 10}. Unless all quantifiers are identical, the order of quantifiers is important. 27 Valid Arguments in PL Ex Is the following a valid argument? 1) If the output of the program is wrong, then it is buggy. 2) The output of the program is wrong. 3) Therefore, the program is buggy. A. An argument in PL is a sequence of propositions with the last being conclusion and the rest being premises. B. An argument is valid if the truth of its premises implies the truth of the conclusion. C. An argument form (AF) in PL is a sequence of CPs. D. An AF is valid, if no matter which particular propositions substitute PVs in its premises, the conclusion is true whenever the premises are all true. 28 7
8 Rule of Inference for PL Why do we study the validity of AFs? With a valid AF, if we substitute its PVs with particular propositions, we always obtain a valid argument. An AF with premises p 1, p 2,, p n and conclusion q is valid when (p 1 p 2 p n ) q is a tautology. How do we verify that an AF is valid? What is the limitation of the method? A rule of inference is a simple AF. The alternative Establish the validity of some rules of inference. Use the rules to construct more sophisticated (valid) AFs. 29 Commonly Used Rules of Inference 1. Modus ponens 2. Modus tollens 3. Hypothetical syllogism 4. Disjunctive syllogism 5. Addition 6. Symplification 7. Conjunction 8. Resolution 30 Build Argument by Rules of Inference Ex Show that premises A through D lead to E. A. It s not sunny this afternoon and it s colder than yesterday. B. We will go swimming only if it is sunny. C. If we do not go swimming, then we will take a canoe trip. D. If we take a canoe trip, then we will be home by sunset. E. We will be home by sunset. General procedure to show validity of an argument a) Determine PVs. b) Translate each premise as a CP. c) Derive new CPs and justify each derivation. d) Terminate when the conclusion is derived. If a truth table is used, how many rows are needed? Incorrect Reasoning Ex Are following arguments valid? A. If 3, then 3. We know that 3. Consequently, 3 3 =. B. If I have the flu, then I have fever. I do have fever. Therefore, I have the flu. Summary A valid AF does not ensure the truth of conclusion, if some premises are false. Fallacies resemble rules of inference, but are based on contingencies rather than tautologies
9 Rules of Inference for Quantified Statements 9. Universal instantiation From x P(x), we conclude that P(c) is true, where c is a particular member of the domain. 10. Existential generalization When P(c) is known to be true for a particular member c, we conclude x P(x). 11. Existential instantiation If we know that x P(x) is true, we conclude that there is a member c in the domain for which P(c) is true. We may not know what c is, only that it exists. 12. Universal generalization From the premise that P(c) is true for an arbitrary member c in the domain, we conclude that x P(x) is true Universal instantiation Common Rules of Inference for Quantified Statements 10. Existential generalization 11. Existential instantiation 12. Universal generalization 13. Universal modus ponens 14. Universal modus tollens 34 Examples for Rules of Inference with Quantifiers Ex Show that premises A and B imply conclusion C. A. A sentence in this article is incorrect and B. The article passed proofreading C. Some sentence that passed proofreading is incorrect. Ex The statement D is know to be true. D. For all positive integers n, if n > 4, then n 2 < 2 n. Show < from D. 35 9
3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
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 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 informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
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 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 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 informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
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 informationChapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.
Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)
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 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 informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
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 informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
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, 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 informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary! Propositional Logic! The Language of Propositions! Applications! Logical Equivalences! Predicate Logic! The Language
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 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 informationIntroduction Logic Inference. Discrete Mathematics Andrei Bulatov
Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid
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 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 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 informationHW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall
CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate
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 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 informationPropositional Logic 1
Propositional Logic 1 Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth Tables 2 Propositions A proposition is
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
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 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 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 informationThe Foundations: Logic and Proofs. Part I
The Foundations: Logic and Proofs Part I Chapter Summary Propositional Logic n The Language of Propositions n Applications n Logical Equivalences Predicate Logic n The Language of Quantifiers n Logical
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 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 / 26 Why Study 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 informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
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 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 informationMethods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures
Methods of Proof CSE0 Discrete Computational Structures Lecture 4 When is a mathematical argument correct? What methods can be used to construct mathematical arguments? Important in many computer science
More informationCHAPTER 1 - LOGIC OF COMPOUND STATEMENTS
CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement
More information10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference
Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system
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 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 informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationAnnouncements CompSci 102 Discrete Math for Computer Science
Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most
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 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 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 informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
More informationTautologies, Contradictions, and Contingencies
Section 1.3 Tautologies, Contradictions, and Contingencies A tautology is a proposition which is always true. Example: p p A contradiction is a proposition which is always false. Example: p p A contingency
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 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 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 informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationCSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 February 5, 2015 2 Announcements Homework 1 is due now. Homework 2 will be posted on the web site today. It is due Thursday, Feb. 12 at 10am in class.
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 informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationAnnouncements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication
Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before
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 informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
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 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 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 informationChapter 1, Section 1.1 Propositional Logic
Discrete Structures Chapter 1, Section 1.1 Propositional Logic These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6 th ed., by Kenneth H. Rosen, published
More informationMathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC
I. BASICS OF PROPOSITIONAL LOGIC George Boole (1815-1864) developed logic as an abstract mathematical system consisting of propositions, operations (conjunction, disjunction, and negation), and rules for
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 informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More information2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.
Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS Propositional Logic Logical Operations Equivalences Predicate Logic CS160 - Spring Semester 2014 2 What
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 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 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 informationMath.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference
Math.3336: Discrete Mathematics Nested Quantifiers/Rules of Inference Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
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 informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
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 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 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 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 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 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 informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More information2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?
Logic: Truth Tables CS160 Rosen Chapter 1 Logic? 1 What is logic? Logic is a truth-preserving system of inference Truth-preserving: If the initial statements are true, the inferred statements will be true
More informationSec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional
Section 1.1 Sec$on Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional ruth ables 2 Proposi$ons A proposition is a declarative
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 informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationAn Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04
An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:
More informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
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 informationOutline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline
Outline s Discrete Mathematics I MATH/COSC 1056E Julien Dompierre Department of Mathematics and Computer Science Laurentian University Sudbury, August 6, 2008 Using to Build Arguments and Quantifiers Outline
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 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 informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
More informationThe Logic of Compound Statements cont.
The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :
More information