Mathematical Logic Part One

Size: px
Start display at page:

Download "Mathematical Logic Part One"

Transcription

1 Mathematical Logic Part One

2 An Important Question How do we formalize the logic we've been using in our proofs?

3 Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical equivalences. irst-order Logic (oday/riday) Reasoning about properties of multiple objects.

4 Propositional Logic

5 A proposition is a statement that is, by itself, either true or false.

6 Some Sample Propositions Puppies are cuter than kittens. Kittens are cuter than puppies. Usain Bolt can outrun everyone in this room. CS103 is useful for cocktail parties. his is the last entry on this list.

7 More Propositions I came in like a wrecking ball. I am a champion. You're going to hear me roar. We all just entertainers.

8 hings hat Aren't Propositions Commands Commands cannot cannot be be true true or or false. false.

9 hings hat Aren't Propositions Questions Questions cannot cannot be be true true or or false. false.

10 hings hat Aren't Propositions he he first first half half is is a a valid valid proposition. proposition. I am the walrus, goo goo g'joob Jibberish Jibberish cannot cannot be be true true or or false. false.

11 Propositional Logic Propositional logic is a mathematical system for reasoning about propositions and how they relate to one another. Every statement in propositional logic consists of propositional variables combined via logical connectives. Each variable represents some proposition, such as You liked it or You should have put a ring on it. Connectives encode how propositions are related, such as If you liked it, then you should have put a ring on it.

12 Propositional Variables Each proposition will be represented by a propositional variable. Propositional variables are usually represented as lower-case letters, such as p, q, r, s, etc. Each variable can take one one of two values: true or false.

13 Logical Connectives Logical NO: p Read not p p is true if and only if p is false. Also called logical negation. Logical AND: p q Read p and q. p q is true if both p and q are true. Also called logical conjunction. Logical OR: p q Read p or q. p q is true if at least one of p or q are true (inclusive OR) Also called logical disjunction.

14 ruth ables p q p q

15 ruth ables p q p q If If p is is false false and and q is is false, false, then then both both p and and q q is is false. false.

16 ruth ables p q p q

17 ruth ables p q p q

18 ruth ables p q p q

19 ruth ables p q p q Both Both p and and q q is is true true only only when when both both p and and q are are true. true.

20 ruth ables

21 ruth ables p q p q

22 ruth ables p q p q his his or or is is an an inclusive inclusive or. or.

23 ruth ables p p

24 ruth able for Implication p q p q

25 ruth able for Implication p q p q

26 ruth able for Implication p q p q In In both both of of these these cases, cases, p is is false, false, so so the the statement statement if if p, p, then then q q is is vacuously vacuously true. true.

27 ruth able for Implication p q p q In In both both of of these these cases, cases, p is is false, false, so so the the statement statement if if p, p, then then q q is is vacuously vacuously true. true.

28 ruth able for Implication p q p q

29 ruth able for Implication p q p q p q should should mean mean when when p is is true, true, q is is true true as as well. well. But But here here p is is true true and and q is is false! false!

30 ruth able for Implication p q p q p q should should mean mean when when p is is true, true, q is is true true as as well. well. But But here here p is is true true and and q is is false! false!

31 ruth able for Implication p q p q

32 ruth able for Implication p q p q p q means means that that if if we we ever ever find find that that p is is true, true, we'll we'll find find that that q is is true true as as well. well.

33 ruth able for Implication p q p q p q means means that that if if we we ever ever find find that that p is is true, true, we'll we'll find find that that q is is true true as as well. well.

34 ruth able for Implication p q p q

35 ruth able for Implication p q p q he he only only way way for for p q to to be be false false is is for for p to to be be true true and and q to to be be false. false.

36 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

37 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

38 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q One One of of p or or q is is true true without without the the other. other.

39 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q One One of of p or or q is is true true without without the the other. other.

40 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

41 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

42 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

43 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q Both Both p and and q are are false false here, here, so so the the statement statement p p if if and and only only if if q q is is true. true.

44 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q Both Both p and and q are are false false here, here, so so the the statement statement p p if if and and only only if if q q is is true. true.

45 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q

46 he Biconditional he biconditional connective p q is read p if and only if q. Intuitively, either both p and q are true, or neither of them are. p q p q One One interpretation interpretation of of is is to to think think of of it it as as equality: equality: the the two two propositions propositions must must have have equal equal truth truth values. values.

47 rue and alse here are two more connectives to speak of: true and false. he symbol is a value that is always true. he symbol is value that is always false. hese are often called connectives, though they don't connect anything. (Or rather, they connect zero things.)

48 Operator Precedence How do we parse this statement? x y z x y z Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

49 Operator Precedence How do we parse this statement? x y z x y z Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

50 Operator Precedence How do we parse this statement? ( x) y z x y z Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

51 Operator Precedence How do we parse this statement? ( x) y z x y z Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

52 Operator Precedence How do we parse this statement? ( x) y z x (y z) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

53 Operator Precedence How do we parse this statement? ( x) y z x (y z) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

54 Operator Precedence How do we parse this statement? ( x) (y z) (x (y z)) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

55 Operator Precedence How do we parse this statement? ( x) (y z) (x (y z)) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

56 Operator Precedence How do we parse this statement? ( x) ((y z) (x (y z))) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

57 Operator Precedence How do we parse this statement? ( x) ((y z) (x (y z))) Operator precedence for propositional logic: All operators are right-associative. We can use parentheses to disambiguate.

58 Recap So ar A propositional variable is a variable that is either true or false. he logical connectives are Negation: p Conjunction: p q Disjunction: p q Implication: p q Biconditional: p q rue: alse:

59 ranslating into Propositional Logic

60 Some Sample Propositions a: here is a velociraptor outside my apartment. b: Velociraptors can open windows. c: I am in my apartment right now. d: My apartment has windows. e: I am going to be eaten by a velociraptor I won't be eaten by a velociraptor if there isn't a velociraptor outside my apartment. a e

61 p if q translates to q p It does not translate to p q

62 Some Sample Propositions a: here is a velociraptor outside my apartment. b: Velociraptors can open windows. c: I am in my apartment right now. d: My apartment has windows. e: I am going to be eaten by a velociraptor If there is a velociraptor outside my apartment, but velociraptors can't open windows, I am not going to be eaten by a velociraptor. a b e

63 p, but q translates to p q

64 he akeaway Point When translating into or out of propositional logic, be very careful not to get tripped up by nuances of the English language. In fact, this is one of the reasons we have a symbolic notation in the first place! Many prepositional phrases lead to counterintuitive translations; make sure to double-check yourself!

65 More Elaborate ruth ables p q p (p q)

66 More Elaborate ruth ables We can't evaluate this until we have a value for p q. p q p (p q)

67 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

68 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

69 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

70 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

71 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

72 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

73 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

74 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

75 More Elaborate ruth ables So let's start by evaluating this. p q p (p q)

76 More Elaborate ruth ables p q p (p q)

77 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

78 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

79 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

80 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

81 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

82 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

83 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

84 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

85 More Elaborate ruth ables Now we can go evaluate this. p q p (p q)

86 More Elaborate ruth ables p q p (p q)

87 More Elaborate ruth ables his gives the final truth value for the expression. p q p (p q)

88 Logical Equivalence

89 Negations p q is false if and only if (p q) is true. Intuitively, this is only possible if either p is false or q is false (or both!) In propositional logic, we can write this as p q. How would we prove that (p q) and p q are equivalent? Idea: Build truth tables for both expressions and confirm that they always agree.

90 Negating AND p q (p q)

91 Negating AND p q (p q)

92 Negating AND p q (p q)

93 Negating AND p q (p q)

94 Negating AND p q (p q) p q p q

95 Negating AND p q (p q) p q p q

96 Negating AND p q (p q) p q p q

97 Negating AND p q (p q) p q p q

98 Negating AND p q (p q) p q p q

99 Negating AND p q (p q) p q p q hese two statements are always the same! hese two statements are always the same!

100 Logical Equivalence If two propositional logic statements φ and ψ always have the same truth values as one another, they are called logically equivalent. We denote this by φ ψ. is not a connective. It is a statement used to describe propositional formulas. φ ψ is a propositional statement that can take on different truth values based on how φ and ψ evaluate. hink of it as a function of φ and ψ. φ ψ is an assertion that the formulas always take on the same values. It is either true or it isn't.

101 De Morgan's Laws Using truth tables, we concluded that (p q) p q We can also use truth tables to show that (p q) p q hese two equivalences are called De Morgan's Laws.

102 Another Important Equivalence When is p q false? Answer: p must be true and q must be false. In propositional logic: p q Is the following true? (p q) p q

103 Negating Implications

104 Negating Implications p q (p q)

105 Negating Implications p q (p q)

106 Negating Implications p q (p q)

107 Negating Implications p q (p q)

108 Negating Implications p q (p q) p q p q

109 Negating Implications p q (p q) p q p q

110 Negating Implications p q (p q) p q p q

111 Negating Implications p q (p q) p q p q

112 Negating Implications p q (p q) p q p q

113 Negating Implications p q (p q) p q p q (p q) p q

114 An Important Observation We have just proven that (p q) p q If we negate both sides, we get that p q (p q) By De Morgan's laws: p q (p q) p q p q p q p q hus p q p q

115 An Important Observation We have just proven that (p q) p q If we negate both sides, we get that p q (p q) By De Morgan's laws: p q (p q) p q p q p q p q hus p q p q If If p is is false, false, the the whole whole thing thing is is true true and and we we gain gain no no information. information. If If p is is true, true, then then q has has to to be be true true for for the the whole whole expression expression to to be be true. true.

116 Why his Matters Understanding these equivalences helps justify how proofs work and what to prove. Unsure what to prove? ry translating it into logic first and see what happens.

117 Announcements!

118 Problem Set hree Checkpoint Problem Set hree checkpoints graded and solutions are released. Please review the feedback and solution set. Parts (ii) and (iv) are trickier than they might seem. On-time Problem Set wo's should be graded and returned by tomorrow at noon in the homework return bin. Please keep everything sorted! Please don't leave papers sitting out!

119 A Note on Induction In an inductive proof, P(n) must be a statement that is either true or false for a particular choice of n. Examples: P(n) = aₙ = 2n. P(n) = any tournament with n players has a winner. Non-examples: P(n) = a game of Nim with n stones in each pile P(n) = for any n N, aₙ = 2n.

120 Your Questions

121 What are some practical applications of cardinality? Why is it useful?

122 irst-order Logic

123 What is irst-order Logic? irst-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional logic with predicates that describe properties of objects, and functions that map objects to one another, quantifiers that allow us to reason about multiple objects simultaneously.

124 he Universe of Propositional Logic

125 he Universe of Propositional Logic p q r s

126 he Universe of Propositional Logic p q r s RUE ALSE

127 he Universe of Propositional Logic p q r s p r q s RUE ALSE

128 he Universe of Propositional Logic p q r s s r q p RUE ALSE

129 Propositional Logic In propositional logic, each variable represents a proposition, which is either true or false. We can directly apply connectives to propositions: p q p q he truth of a statement can be determined by plugging in the truth values for the input propositions and computing the result. We can see all possible truth values for a statement by checking all possible truth assignments to its variables.

130 he Universe of irst-order Logic he Sun Venus he Morning Star he Moon he Evening Star

131 irst-order Logic In first-order logic, each variable refers to some object in a set called the domain of discourse. Some objects may have multiple names. Some objects may have no name at all. Venus he Morning Star he Evening Star

132 irst-order Logic In first-order logic, each variable refers to some object in a set called the domain of discourse. Some objects may have multiple names. Some objects may have no name at all. Venus he Morning Star he Evening Star

133 Propositional vs. irst-order Logic Because propositional variables are either true or false, we can directly apply connectives to them. p q p q r Because first-order variables refer to arbitrary objects, it does not make sense to apply connectives to them. Venus Sun his is not C!

134 Reasoning about Objects o reason about objects, first-order logic uses predicates. Examples: ExtremelyCute(Quokka) DeadlockEachOther(House, Senate) Predicates can take any number of arguments, but each predicate has a fixed number of arguments (called its arity) Applying a predicate to arguments produces a proposition, which is either true or false.

135 irst-order Sentences Sentences in first-order logic can be constructed from predicates applied to objects: LikesoEat(V, M) Near(V, M) WillEat(V, M) Cute(t) Dikdik(t) Kitty(t) Puppy(t) x < 8 x < 137 he he notation notation x x < 8 is is just just a a shorthand shorthand for for something something like like Lesshan(x, Lesshan(x, 8). 8). Binary Binary predicates predicates in in math math are are often often written written like like this, this, but but symbols symbols like like < are are not not a a part part of of first-order first-order logic. logic.

136 Equality irst-order logic is equipped with a special predicate = that says whether two objects are equal to one another. Equality is a part of first-order logic, just as and are. Examples: MorningStar = EveningStar Glinda = GoodWitchOfheNorth Equality can only be applied to objects; to see if propositions are equal, use.

137 or notational simplicity, define as x y (x = y)

138 Next ime irst-order Logic II unctions and quantifiers. How do we translate statements into first-order logic? Why does any of this matter?

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Announcements Problem Session tonight from 7:00 7:50 in 380-380X. Optional, but highly recommended! Problem Set 3 Checkpoint due right now. 2 Handouts Problem Set 3 Checkpoint

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Announcements Problem Set 3 checkpoint due right now. Problem Set 2 due now with a late day. Solutions distributed at end of lecture. One inal Note on the Pigeonhole Principle

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

Mathematical Logic Part Two

Mathematical Logic Part Two Mathematical Logic Part Two Outline for Today Recap from Last Time The Contrapositive Using Propositional Logic First-Order Logic First-Order Translations Recap from Last Time Recap So Far A propositional

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical

More information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part hree riday our Square! oday at 4:15PM, Outside Gates Announcements Problem Set 3 due right now. Problem Set 4 goes out today. Checkpoint due Monday, October 22. Remainder due riday,

More information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part Three Recap from Last Time What is First-Order Logic? First-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional

More information

Mathematical Logic Part One

Mathematical Logic Part One Mathematical Logic Part One Question: How do we formalize the defnitions and reasoning we use in our proofs? Where We're Going Propositional Logic (Today) Basic logical connectives. Truth tables. Logical

More information

Discrete Mathematics and Applications COT3100

Discrete Mathematics and Applications COT3100 Discrete Mathematics and Applications CO3100 Dr. Ungor Sources: Slides are based on Dr. G. Bebis material. uesday, January 7, 2014 oundations of Logic: Overview Propositional logic: (Sections 1.1-1.3)

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

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 information

A statement is a sentence that is definitely either true or false but not both.

A 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 information

13.3 Truth Tables for the Conditional and the Biconditional

13.3 Truth Tables for the Conditional and the Biconditional ruthablesconditionalbiconditional.nb 1 13.3 ruth ables for the Conditional and the Biconditional Conditional Earlier, we mentioned that the statement preceding the conditional symbol is called the antecedent

More information

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Proposition/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 information

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

CS100: 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 information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form

More information

CSC Discrete Math I, Spring Propositional Logic

CSC 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 information

Section 1.1: Logical Form and Logical Equivalence

Section 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 information

A Little Deductive Logic

A 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 information

The Inductive Proof Template

The Inductive Proof Template CS103 Handout 24 Winter 2016 February 5, 2016 Guide to Inductive Proofs Induction gives a new way to prove results about natural numbers and discrete structures like games, puzzles, and graphs. All of

More information

A Little Deductive Logic

A 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 information

Logic. 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: 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 information

Propositional logic ( ): Review from Mat 1348

Propositional 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 information

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Example. 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 information

Chapter 1 Elementary Logic

Chapter 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 information

EECS 1028 M: Discrete Mathematics for Engineers

EECS 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 information

DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )

DeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations ) DeMorgan s aws and the Biconditional Philosophy and ogic Sections 2.3, 2.4 ( Some difficult combinations ) Some difficult combinations Not both p and q = ~(p & q) We won t both sing and dance. A negation

More information

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate

More information

Formal Logic. Critical Thinking

Formal Logic. Critical Thinking ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete 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 information

Truth-Functional Logic

Truth-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 information

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPTER 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 information

Lecture 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) 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 information

Logic and Truth Tables

Logic and Truth Tables Logic and ruth ables What is a ruth able? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. here are five basic operations

More information

Propositional Logic Not Enough

Propositional 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 information

Predicates, Quantifiers and Nested Quantifiers

Predicates, Quantifiers and Nested Quantifiers Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x

More information

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.

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. 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 information

Definition 2. Conjunction of p and q

Definition 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 information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part Three The Aristotelian Forms All As are Bs x. (A(x B(x Some As are Bs x. (A(x B(x No As are Bs x. (A(x B(x Some As aren t Bs x. (A(x B(x It It is is worth worth committing committing

More information

Sec$on Summary. Propositions Connectives. Truth Tables. Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional

Sec$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 information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/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 information

Introduction to Sets and Logic (MATH 1190)

Introduction 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 information

Mat 243 Exam 1 Review

Mat 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 information

Section Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier

Section 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 information

PHIL12A Section answers, 16 February 2011

PHIL12A Section answers, 16 February 2011 PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F

More information

Foundation of proofs. Jim Hefferon.

Foundation of proofs. Jim Hefferon. Foundation of proofs Jim Hefferon http://joshua.smcvt.edu/proofs The need to prove In Mathematics we prove things To a person with a mathematical turn of mind, the base angles of an isoceles triangle are

More information

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula: Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and

More information

DISCRETE STRUCTURES WEEK5 LECTURE1

DISCRETE STRUCTURES WEEK5 LECTURE1 DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing

More information

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Chapter 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 information

Propositional Logic. Fall () Propositional Logic Fall / 30

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 information

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y

Functions. Lecture 4: Truth functions, evaluating compound statements. Arithmetic Functions. x y x+y Lecture 4: ruth functions, evaluating compound statements 1. unctions, arithmetic functions, and truth functions 2. Definitions of truth functions unctions A function is something that takes inputs and

More information

CSE 240 Logic and Discrete Mathematics

CSE 240 Logic and Discrete Mathematics CSE 240 Logic and Discrete Mathematics Instructor: odd Sproull Department of Computer Science and Engineering Washington University in St. Louis 1Extensible - CSE 240 Logic Networking and Discrete Platform

More information

Predicate Logic. Predicates. Math 173 February 9, 2010

Predicate Logic. Predicates. Math 173 February 9, 2010 Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables

More information

PHIL 422 Advanced Logic Inductive Proof

PHIL 422 Advanced Logic Inductive Proof PHIL 422 Advanced Logic Inductive Proof 1. Preamble: One of the most powerful tools in your meta-logical toolkit will be proof by induction. Just about every significant meta-logical result relies upon

More information

HW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall

HW1 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 information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n 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 information

Numbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:

Numbers 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 information

Section 1.1 Propositions

Section 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 information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part Three Recap from Last Time What is First-Order Logic? First-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional

More information

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Deduction by Daniel Bonevac. Chapter 3 Truth Trees Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties

More information

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.

CS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning. 3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on

More information

Mathematical Logic Part Three

Mathematical Logic Part Three Mathematical Logic Part Three Recap from Last Time What is First-Order Logic? First-order logic is a logical system for reasoning about properties of objects. Augments the logical connectives from propositional

More information

Announcements. Problem Set 1 out. Checkpoint due Monday, September 30. Remaining problems due Friday, October 4.

Announcements. Problem Set 1 out. Checkpoint due Monday, September 30. Remaining problems due Friday, October 4. Indirect Proofs Announcements Problem Set 1 out. Checkpoint due Monday, September 30. Grade determined by attempt rather than accuracy. It's okay to make mistakes we want you to give it your best effort,

More information

Propositional Logic. Spring Propositional Logic Spring / 32

Propositional 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 information

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd: GEOMERY Chapter 2: LOGIC Name: eacher: Pd: able of Contents DAY 1: SWBA: Identify, write and analyze the different types of logical statements. Pgs: 2-8 Homework: Pgs 6 8 (EVEN ONLY) DAY 2: SWBA: Write

More information

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods

TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are

More information

Proofs. Joe Patten August 10, 2018

Proofs. 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 information

Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014

Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014 Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014 Notes for Lecture 9 Mathematical logic is the rigorous study of the way in which we prove the validity of mathematical

More information

HANDOUT AND SET THEORY. Ariyadi Wijaya

HANDOUT 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 information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!

More information

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies

Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Logic as a Tool Chapter 1: Understanding Propositional Logic 1.1 Propositions and logical connectives. Truth tables and tautologies Valentin Stockholm University September 2016 Propositions Proposition:

More information

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter 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 information

5. And. 5.1 The conjunction

5. And. 5.1 The conjunction 5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language

More information

Math.3336: Discrete Mathematics. Applications of Propositional Logic

Math.3336: Discrete Mathematics. Applications of Propositional Logic Math.3336: Discrete Mathematics Applications of Propositional Logic Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu

More information

Learning Goals of CS245 Logic and Computation

Learning 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 information

Chapter 1: Formal Logic

Chapter 1: Formal Logic Chapter 1: Formal Logic Dr. Fang (Daisy) Tang ftang@cpp.edu www.cpp.edu/~ftang/ CS 130 Discrete Structures Logic: The Foundation of Reasoning Definition: the foundation for the organized, careful method

More information

THE LOGIC OF QUANTIFIED STATEMENTS

THE LOGIC OF QUANTIFIED STATEMENTS CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.2 Predicates and Quantified Statements II Copyright Cengage Learning. All rights reserved. Negations

More information

Logic and Proofs. (A brief summary)

Logic 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 information

5. And. 5.1 The conjunction

5. And. 5.1 The conjunction 5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language

More information

Truth Tables for Arguments

Truth Tables for Arguments ruth ables for Arguments 1. Comparing Statements: We ve looked at SINGLE propositions and assessed the truth values listed under their main operators to determine whether they were tautologous, self-contradictory,

More information

Predicate Calculus - Syntax

Predicate Calculus - Syntax Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language

More information

Section 1.2: Propositional Logic

Section 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 information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Propositional 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 information

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Why 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 information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

WARM-UP. Conditional Statements

WARM-UP. Conditional Statements WARM-UP B A 4x + 33 C D 2x +81 ( ) + 33 ind the values of the three angles below m ABD 4x + = 33 4= 8 2x +81 m ABD +4x = 32 +4x + 33= 65 33 = 6x + 81 m DBC 81 = 2( 8) +81 81 m DBC 48 = 16 = 6x +81= 65

More information

Propositional Language - Semantics

Propositional Language - Semantics Propositional Language - Semantics Lila Kari University of Waterloo Propositional Language - Semantics CS245, Logic and Computation 1 / 41 Syntax and semantics Syntax Semantics analyzes Form analyzes Meaning

More information

ICS141: Discrete Mathematics for Computer Science I

ICS141: 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 information

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe: Logic - recap So far, we have seen that: Logic is a language which can be used to describe: Statements about the real world The simplest pieces of data in an automatic processing system such as a computer

More information

Discrete Mathematics and Its Applications

Discrete 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 information

Compound Propositions

Compound 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 information

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN 021 McLoughlin Handout 1.3, page 1 of 6 FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN Truth Table for Not K K T F F T Truth Table for And B M B M T F F F T F F F F Truth Table for Or R S R S T

More information

CS 2800: Logic and Computation Fall 2010 (Lecture 13)

CS 2800: Logic and Computation Fall 2010 (Lecture 13) CS 2800: Logic and Computation Fall 2010 (Lecture 13) 13 October 2010 1 An Introduction to First-order Logic In Propositional(Boolean) Logic, we used large portions of mathematical language, namely those

More information

Chapter 1, Section 1.1 Propositional Logic

Chapter 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 information

Discrete Mathematics and Its Applications

Discrete Mathematics and Its Applications Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives

More information

Lecture 2: Syntax. January 24, 2018

Lecture 2: Syntax. January 24, 2018 Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified

More information

Proving logical equivalencies (1.3)

Proving logical equivalencies (1.3) EECS 203 Spring 2016 Lecture 2 Page 1 of 6 Proving logical equivalencies (1.3) One thing we d like to do is prove that two logical statements are the same, or prove that they aren t. Vocabulary time In

More information

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

Propositional 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 information