Propositional Logic. Spring Propositional Logic Spring / 32
|
|
- Stewart Lawson
- 6 years ago
- Views:
Transcription
1 Propositional Logic Spring 2016 Propositional Logic Spring / 32
2 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements of propositional logic: statements and operations, including implication, and its converse, inverse, and negation. Translate English expressions into logical statements. Use both truth tables and derivations to demonstrate equivalence of logical statements. Define common tautologies, contradictions, and equivalences. Recognize and employ modus ponens and modus tollens and other forms of valid argumentation. Propositional Logic Spring / 32
3 Introduction Learning Outcomes for this Presentation It s difficult, and possibly counterproductive, to provide a concise description of logic... What is logic? Why is it important? How will we use it in this class? Propositional Logic Spring / 32
4 Introduction Learning Outcomes for this Presentation It s difficult, and possibly counterproductive, to provide a concise description of logic... What is logic? A formal system for expressing truth and falsity. Why is it important? How will we use it in this class? Propositional Logic Spring / 32
5 Introduction Learning Outcomes for this Presentation It s difficult, and possibly counterproductive, to provide a concise description of logic... What is logic? A formal system for expressing truth and falsity. Why is it important? Provides a method of reasoning from given truths (called axioms) to new truths (called propositions or theorems). How will we use it in this class? Propositional Logic Spring / 32
6 Introduction Learning Outcomes for this Presentation It s difficult, and possibly counterproductive, to provide a concise description of logic... What is logic? A formal system for expressing truth and falsity. Why is it important? Provides a method of reasoning from given truths (called axioms) to new truths (called propositions or theorems). How will we use it in this class? Logic is the skeleton that supports mathematical truth-making, i.e., proof-reading and proof-writing. Propositional Logic Spring / 32
7 Introduction Learning Outcomes for this Presentation It s difficult, and possibly counterproductive, to provide a concise description of logic... What is logic? A formal system for expressing truth and falsity. Why is it important? Provides a method of reasoning from given truths (called axioms) to new truths (called propositions or theorems). How will we use it in this class? Logic is the skeleton that supports mathematical truth-making, i.e., proof-reading and proof-writing. Logic is the glue that holds computers and programs together. Propositional Logic Spring / 32
8 Definitions Statements Propositional statements Definition A statement is a declaration in a language that is either true or false. Example It is raining is an atomic statement, as is The sun in shining. Two compound statements can for formed from these: (1) It is raining or the sun is shining ; and (2) It is raining and the sun is shining. Propositional Logic Spring / 32
9 Definitions Logical connectives Making new statements by connecting propositions Three fundamental operators are adequate to create the spectrum of logical possibilities. Operator And (conjunction) Or (disjunction) Negation Description Written s t: true when s and t are true. Written s t: true when s or t are true. Written s (or sometimes s): true only when s is false, and vice versa. Keep in mind that s and t may be atomic or compound propositions themselves! Propositional Logic Spring / 32
10 Definitions Logical connectives Truth tables... The meaning of a logical operation can be expressed as its truth table. Construct the truth-table for conjunction: Construct the truth-table for disjunction; Construct the truth-table for negation. Do in class Propositional Logic Spring / 32
11 Definitions Interpretations, contexts,... Truth, falsity, and interpretations Example The truth or falsity of any statement depends upon its context. Context can be visualized as the values that are associated with each variable in a statement. Is a b true? Well, if either a = true or b = true, then the statement a b is true. Ask now if a b is true, and you will see that it is true, but under fewer interpretations or, its context is different. Propositional Logic Spring / 32
12 Definitions Logically equivalent statements Logical equivalences How could we show if two logical statements are equivalent? Construct truth tables for each. We will demonstrate other methods shortly but these methods depend upon the truth tables of the underlying operations. Propositional Logic Spring / 32
13 Definitions Logically equivalent statements A worked example Example Let s be The sun is shining and t be It is raining. Join these into the compound statement: ( s t) t. 1 Try to phrase the compound statement in English: 2 Construct the truth table for ( s t) t Example to be done in class. Propositional Logic Spring / 32
14 Definitions Logically equivalent statements Using a truth table to illustrate a common usage... The word or is often used to mean one or the other, but this is not the same meaning of or in logic! Definition The exclusive-or of two statements p and q (written p q), is true only when either p is true or q is true, but not both. Use instead: (p q) (p q) p q and (p q) (q p) p q Show in class Propositional Logic Spring / 32
15 Definitions Logically equivalent statements De Morgan s laws... A well-known and often-used pair of laws based upon the distributive and the negation properties from your text: Definition De Morgan s Laws state that for any statements p and q: (p q) p q (p q) p q. and De Morgan s laws simplify computer programs. De Morgan s laws simplify circuit designs. Propositional Logic Spring / 32
16 Definitions Logically equivalent statements Because it s that important! How do we know that DeMorgan s laws (or any laws) are valid? Thought experiment: Apart from the truth table just constructed, can you think of any other mathematically sound way to prove or show that De Morgan s laws are always valid? Propositional Logic Spring / 32
17 Definitions Logically equivalent statements Because it s that important! How do we know that DeMorgan s laws (or any laws) are valid? Construct the truth-tables and verify on your own! Thought experiment: Apart from the truth table just constructed, can you think of any other mathematically sound way to prove or show that De Morgan s laws are always valid? Propositional Logic Spring / 32
18 Logical implication Introducing logical implication Example Arguably, logical implication is the most useful operator in predicate logic. Logical implication is expressible using only two of the operators introduced in the last slide. Implication captures the notion of an action depending upon the success (or failure) of another action. Unlike primitive connectors, implication is directional! If it rains, then Richard brings an umbrella. We would like a way of assigning truth or falsity to these kinds of statements. Propositional Logic Spring / 32
19 Logical implication Implication, cont d. Examine the truth table for the implication a b: a b a b T T T F T T T F F F F T Note two important qualities of implication: 1 We see only one case where the implication is false. 2 Compare rows 2 and 3: implication is sensitive to direction!. Propositional Logic Spring / 32
20 Logical implication Implications of implication... Everything to the left of the implication symbol is called either the antecedent, or the hypothesis. Everything to the right of the implication symbol is called the consequent, or the conclusion, Propositional Logic Spring / 32
21 Logical implication Implications of implication... Everything to the left of the implication symbol is called either the antecedent, or the hypothesis. Everything to the right of the implication symbol is called the consequent, or the conclusion, Unlike in common speech, no relationship need exist between the hypothesis and the conclusion. 1 If the sky is blue then 5 is prime 2 If the moon is made of cheese, then then 5 is prime. and, 3 If the moon is made of cheese, then 5 is not prime. Propositional Logic Spring / 32
22 Logical implication Trying on a few implications... See how well you do with these: Identify the hypotheses and the conclusions. State under which circumstances these implications are true and under which they are false: 1 If oxygen is present, then rust will form. 2 Only if I study hard will I pass this course. (Read this as p, only if q.) 3 If f (x) = f (y) then x = y. 4 If x y then f (x) f (y). Propositional Logic Spring / 32
23 Logical implication Variations on implication Some important variations of implications We will consider the following variations of implication: Define the negation of an implication: Define the converse of an implication. Define the inverse of an implication. Define the contrapositive. Example We will use this statement for all of our examples: If I live in College Park, then I live in Maryland. Propositional Logic Spring / 32
24 Logical implication Variations on implication Negating an implication Definition The negation of an implication p q is obtained by negating it. Example Given p q, its negation is p q. The negation of an implication is not another implication. Show this now. Propositional Logic Spring / 32
25 Logical implication Variations on implication The converse of an implication Definition The converse of an implication is obtained by transposing its conclusion with its premise. Example Given p q, its converse is q p. Propositional Logic Spring / 32
26 Logical implication Variations on implication The inverse of an implication Definition The inverse of an implication is obtained by negating both its premise and its conclusion. Example Given p q, its inverse is ( p) ( q). (Parentheses added for emphasis.) Propositional Logic Spring / 32
27 Logical implication Variations on implication The Contrapositive form of an implication Definition The contrapositive is formed by inverting its converse. Given p q, form its contrapositive as q p. Do in class Propositional Logic Spring / 32
28 Bidirectional implication Bidirectional implication Definition The biconditional statement is an implication that is true only when its antecedent and its consequent have the same truth values; it is false otherwise. In symbols, p q is true only when p q and q p. p q p q T T T T F F F T F F F T Propositional Logic Spring / 32
29 Bidirectional implication Experimenting with bi-conditionals... The bi-conditional, arguably, corresponds to the common use of the word if in English sentences. The bi-conditional sometimes appears in scientific or technical text as iff or as a necessary and sufficient condition. What do the converse, inverse, and negations of a bi-conditional look like? What is the relationship between the exclusive-or (discussed above) and the bi-conditional? Propositional Logic Spring / 32
30 Valid and Invalid Arguments Definition Validity, as a matter of form. Definition An argument is a sequence of statements terminating with a conclusion. Validity is based upon formal properties, not content. Mastery of logical argumentation translates into a deeper understanding of, and facility for, constructing mathematical proof. Propositional Logic Spring / 32
31 Forms of Argumentation Truth in logic... What does it mean for the logical statements that interest this class to be true? Example If the sum the digits of a number is divisible by 3, then the number itself is divisible by 3. For the moment: we will restrict our attention to propositional logic. We have a method for determining the truth of these kinds of propositional statements. Propositional Logic Spring / 32
32 Forms of Argumentation Truth in logic... Example What does it mean for the logical statements that interest this class to be true? They commonly appear as a set of assumptions (hypotheses) and a conclusion that we wish to show follows from these. If the sum the digits of a number is divisible by 3, then the number itself is divisible by 3. For the moment: we will restrict our attention to propositional logic. We have a method for determining the truth of these kinds of propositional statements. Propositional Logic Spring / 32
33 Forms of Argumentation A complete example Valid Statement : If p q, p r, and q r then p. p q r p q p r q r p T T T T T T T T T F T T F T T F T T T T T T F F T T T T F T T T F T F F T F T T F F F F T F F T F F F F F T T F Propositional Logic Spring / 32
34 Forms of Argumentation Slightly modified... Invalid Statement : If p q, p r, and q r then r. p q r p q p r q r r T T T T T T T T T F T T F F T F T T T T T T F F T T T F F T T T F T T F T F T T F F F F T F F T T F F F F T T F Propositional Logic Spring / 32
35 Forms of Argumentation Common forms of argument Proofs: Using inference... Here are some common patterns from your text: Modus ponens (To prove by asserting.) p q, p. q p q, q Modus tollens (To prove by denying.). p p q, q p q, p Disjunctive syllogism ; likewise. p q Rule of contradiction Let c be a contradiction: p c. p The remaining rules can be derived by systematically applying the rules above with the basic properties of a boolean algebra, i.e., associativity, commutativity, idempotence, etc. Propositional Logic Spring / 32
36 Forms of Argumentation Common forms of argument General Laws of Propositional Statements Given any statement variables p, q, and r, a tautology t and a contradiction c, the following logical equivalences hold: 1. Commutative laws: p q q p p q q p 2. Associative laws: (p q) r p (q r) (p q) r p (q r) 3. Distributive laws: p (q r) (p q) (p r) p (q r) (p q) (p r) 4. Identity laws: p t p p c p 5. Negation laws: p p t p p c 6. Double Negative law: ( p) p 7. Idempotent laws: p p p p p p 8. DeMorgan s laws: (p q) p q (p q) p q 9. Universal bounds laws: p t t p c c 10. Absorption laws: p (p q) p p (p q) p 11. Negations of t and c: t c c t Propositional Logic Spring / 32
37 Forms of Argumentation Common forms of argument Common forms of argumentation Modus Ponens Modus Tollens Disjunctive p q p q p q p q Syllogism q p p q Therefore p Therefore q Therefore q Therefore p Conjunctive p Hypothetical p q Addition q Syllogism q r Therefore p q Therefore p r Disjunctive p q Dilemma: p q Addition Therefore p q Therefore p q Proof by p r Division q r into Cases Therefore r Conjunctive p q p q Rule of p c Simplification Therefore p Therefore q Contradiction Therefore p Closing C.W. p Assumed Closing C.W. p Assumed without q derived with x x derived contradiction Therefore p q contradiction Therefore p Propositional Logic Spring / 32
38 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Propositional Logic Spring / 32
39 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Statements are combined by logical operators: three primitive operators are negation, disjunction, and conjunction. Propositional Logic Spring / 32
40 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Statements are combined by logical operators: three primitive operators are negation, disjunction, and conjunction. These operators have certain properties: they are commutative, associative,..., directionless. Propositional Logic Spring / 32
41 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Statements are combined by logical operators: three primitive operators are negation, disjunction, and conjunction. These operators have certain properties: they are commutative, associative,..., directionless. Logical implication is constructed. Unlike its components, implications have direction. Propositional Logic Spring / 32
42 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Statements are combined by logical operators: three primitive operators are negation, disjunction, and conjunction. These operators have certain properties: they are commutative, associative,..., directionless. Logical implication is constructed. Unlike its components, implications have direction. Arguments are patterns of reasoning that incorporate these operators over a particular domain of discourse, e.g., numbers, objects, etc. Propositional Logic Spring / 32
43 Summary & Moving Forward Reviewing & moving forward Statements may be atomic or compound. Their syntax is unambiguous. Statements are combined by logical operators: three primitive operators are negation, disjunction, and conjunction. These operators have certain properties: they are commutative, associative,..., directionless. Logical implication is constructed. Unlike its components, implications have direction. Arguments are patterns of reasoning that incorporate these operators over a particular domain of discourse, e.g., numbers, objects, etc. Most importantly: truth is formal in these sytems. Propositional Logic Spring / 32
44 Summary & Moving Forward Applications of logic Logic is everywhere. Shortly, we will examine how logic is used in several areas relevant to computer science. Logical primitives & switching circuits. Logical statements & sequential circuits. Later in this semester, perhaps Logical constructions in combinatorial circuits. Propositional Logic Spring / 32
Propositional 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 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 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 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 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 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 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 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 informationPropositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38
Propositional Logic Jason Filippou CMSC250 @ UMCP 05-31-2016 ason Filippou (CMSC250 @ UMCP) Propositional Logic 05-31-2016 1 / 38 Outline 1 Syntax 2 Semantics Truth Tables Simplifying expressions 3 Inference
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 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 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 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 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 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 informationNatural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)
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 Structures & Algorithms. Propositional Logic EECE 320 // UBC
Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake
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 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 1.2: Propositional Logic
Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.
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 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 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 information3/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 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 informationPropositional Equivalence
Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:
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 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 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 informationToday s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)
Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.
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 information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
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 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 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 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 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 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 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 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 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 informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
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 informationEquivalence and Implication
Equivalence and Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 7 8, 2018 Alice E. Fischer Laws of Logic... 1/33 1 Logical Equivalence Contradictions and Tautologies 2 3 4 Necessary
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 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 informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
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 informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More informationProposition logic and argument. CISC2100, Spring 2017 X.Zhang
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationWhere are my glasses?
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
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 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 propostions p, q, r, s, T: true
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 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 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 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 informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
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 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 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 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 informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
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 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 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 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 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 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 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 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 / 12 Using the laws
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationKnowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.
Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes
More informationProposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators
Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables
More informationMath.3336: Discrete Mathematics. Propositional Equivalences
Math.3336: Discrete Mathematics Propositional Equivalences Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationBoolean Logic. CS 231 Dianna Xu
Boolean Logic CS 231 Dianna Xu 1 Proposition/Statement A proposition is either true or false but not both The sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 2 Boolean variables
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 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 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 informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
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 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 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 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 informationPropositional logic ( ): Review from Mat 1348
CSI 2101 / Winter 2008: Discrete Structures. Propositional logic ( 1.1-1.2): Review from Mat 1348 Dr. Nejib Zaguia - Winter 2008 1 Propositional logic: Review Mathematical Logic is a tool for working with
More informationIt rains now. (true) The followings are not propositions.
Chapter 8 Fuzzy Logic Formal language is a language in which the syntax is precisely given and thus is different from informal language like English and French. The study of the formal languages is the
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
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 informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
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 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 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 informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationPropositional natural deduction
Propositional natural deduction COMP2600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2016 Major proof techniques 1 / 25 Three major styles of proof in logic and mathematics Model
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 information