# Discrete Structures for Computer Science

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Discrete Structures for Computer Science William Garrison 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee

2 Topics n Predicates n Quantifiers n Logical equivalences in predicate logic n Translations using quantifiers

3 Propositional logic is simple, therefore limited Propositional logic cannot represent some classes of natural language statements Given: Kody is one of my dogs Given: All of my dogs like peanut butter Propositional logic gives us no way to draw the (obvious) conclusion that Kody likes peanut butter!

4 Propositional logic also limits the mathematical truths that we can express and reason about Consider the following: l p 1 º 2 has no divisors other than 1 and itself l p 2 º 3 has no divisors other than 1 and itself l p 3 º 5 has no divisors other than 1 and itself l p 4 º 7 has no divisors other than 1 and itself l p 5 º 11 has no divisors other than 1 and itself l This is an inefficient way to reason about the properties of prime numbers! General problem: Propositional logic has no way of reasoning about instances of general statements.

5 Historical Context The previous examples are called syllogisms Aristotle used syllogisms in his Prior Analytics to deductively infer new facts from existing knowledge Major premise All men are mortal Socrates is a man Socrates is mortal Minor premise Conclusion

6 Predicate logic allows us to reason about the properties of individual objects and classes of objects Predicate logic allows us to use propositional functions during our logical reasoning P(x) º x 3 > 0 variable predicate Note: A propositional function P(x) has no truth value unless it is evaluated for a given x or set of xs.

7 Examples Assume P(x) º x 3 > 0. What are the truth values of the following expressions: l P(0) false l P(23) true l P(-42) false We can express the prime number property using predicate logic: l P(x) º x is prime l D(x) º x has no divisors other than 1 and itself l P(x) «D(x)

8 Predicates can also be defined on more than one variable Let P(x, y) º x + y = 42. What are the truth values of the following expressions: l P(45, -3) true l P(23, 23) false l P(1, 119) false Let S(x, y, z) º x + y = z. What are the truth values of the following expressions: l S(1, 1, 2) true l S(23, 24, 42) false l S(-9, 18, 9) true

9 Predicates play a central role in program control flow and debugging If/then statements: l if x > 17 then y = 13 Loops: l while y <= 14 do end while This is a predicate! Debugging in C/C++: l assert(strlen(passwd) > 0);

10 Quantifiers allow us to make general statements that turn propositional functions into propositions In English, we use quantifiers on a regular basis: l All students can ride the bus for free l Many people like chocolate l I enjoy some types of tea l At least one person will sleep through their final exam Quantifiers require us to define a universe of discourse (also called a domain) in order for the quantification to make sense l Many like chocolate doesn t make sense! What are the universes of discourse for the above statements?

11 Universal quantification allows us to make statements about the entire universe of discourse Examples: l All of my dogs like peanut butter l Every even integer is a multiple of two l For each positive integer x, 2x > x Given a propositional function P(x), we express the universal quantification of P(x) as "x P(x) What is the truth value of "x P(x)? l true if P(x) is true for every x in the universe of discourse l false if P(x) is false for even one x in the universe of discourse

12 Examples All rational numbers are greater than 42 l Domain: rational numbers l Propositional function: Let G(x) º x is greater than 42 l Statement: "x G(x) l Truth value: false (counterexample: ½) If a natural number is prime, it has no divisors other than 1 and itself l Domain: natural numbers l Propositional functions: Let P(x) º x is prime Let D(x) º x has no divisors other than 1 and itself l Statement: "x [P(x) D(x)] l Truth value: true (by definition)

13 Existential quantifiers allow us to make statements about some objects Examples: l Some elephants are scared of mice l There exist integers a, b, and c such that the equality a 2 + b 2 = c 2 is true l There is at least one person who did better than John on the midterm Given a propositional function P(x), we express the existential quantification of P(x) as \$x P(x) What is the truth value of \$x P(x)? l true if P(x) is true for at least one x in the universe of discourse l false if P(x) is false for each x in the universe of discourse

14 Examples The inequality x + 1 < x holds for at least one integer l Domain: Integers l Propositional function: P(x) º x + 1 < x l Statement: \$x P(x) l Truth value: false For some integers, the equality a 2 + b 2 = c 2 is true l Domain: Integers l Propositional function: P(a, b, c) º a 2 + b 2 = c 2 l Statement: \$a,b,c P(a,b,c) l Truth value: true

15 We can restrict the domain of quantification The square of every natural number less than 4 is no more than 9 l Domain: natural numbers This is equivalent to writing "x [(x < 4) (x 2 9)] l Statement: "x<4 (x 2 9) l Truth value: true Some integers between 0 and 6 are prime l Domain: Integers l Propositional function: P(x) º x is prime l Statement: \$0 x 6 P(x) l Truth value: true This is equivalent to writing \$x [(0 x 6) Ù P(x)]

16 Precedence of quantifiers The universal and existential quantifiers have the highest precedence of all logical operators For example: l "x P(x) Ù Q(x) actually means ("x P(x)) Ù Q(x) l \$x P(x) Q(x) actually means (\$x P(x)) Q(x) For the most part, we will use parentheses to disambiguate these types of statements But you are still responsible for understanding precedence!

17 In-class exercises Problem 1: Assume M(x) º x is a Monday and D(x,y) º 2x = y. What are the truth values of the following statements? l M( September 5, 2017 ) l D(2, 5) Problem 2: Let P(x) º x is prime where the domain of x is the integers. Let T(x,y) º x = 3y where the domain of x and y is all natural numbers. What are the truth values of the following statements? l "x P(x) l \$x,y T(x,y)

18 We can extend the notion of logical equivalence to expressions containing predicates or quantifiers Definition: Two statements involving predicates and quantifiers are logically equivalent iff they take on the same truth value regardless of which predicates are substituted into these statements and which domains of discourse are used.

19 Prove: \$x [P(x) Ú Q(x)] º \$x P(x) Ú \$x Q(x) We must prove each direction of the equivalence. Assume that P and Q have the same domain. First, prove \$x [P(x) Ú Q(x)] \$x P(x) Ú \$x Q(x): l If \$x [P(x) Ú Q(x)] is true, this means that there is some value v in the domain such that either P(v) is true or Q(v) is true l If P(v) is true, then \$x P(x) is true and [\$x P(x) Ú \$x Q(x)] is true l If Q(v) is true, then \$x Q(x) is true and [\$x P(x) Ú \$x Q(x)] is true l Thus \$x [P(x) Ú Q(x)] \$x P(x) Ú \$x Q(x)

20 Prove: \$x [P(x) Ú Q(x)] º \$x P(x) Ú \$x Q(x) Then, prove \$x P(x) Ú \$x Q(x) \$x [P(x) Ú Q(x)]: l If \$x P(x) Ú \$x Q(x) is true, this means that there is some value v in the domain such that either P(v) is true or Q(v) is true l If P(v) is true, then \$x [P(x) Ú Q(x)] is true l If Q(v) is true, then \$x [P(x) Ú Q(x)] is true l Thus \$x P(x) Ú \$x Q(x) \$x [P(x) Ú Q(x)] Since \$x [P(x) Ú Q(x)] \$x P(x) Ú \$x Q(x) and \$x P(x) Ú \$x Q(x) \$x [P(x) Ú Q(x)] then \$x [P(x) Ú Q(x)] º \$x P(x) Ú \$x Q(x).

21 We also have DeMorgan s laws for quantifiers Negation over universal quantifier: "x P(x) º \$x P(x) Intuition: If P(x) is not true for all x, then there is at least one x for which P(x) is false Negation over existential quantifier: \$x P(x) º "x P(x) Intuition: If P(x) is not true for at least one value x, then P(x) is false for all x These are very useful logical equivalences, so let s prove one of them

22 Prove: "x P(x) º \$x P(x) n "x P(x) \$x P(x) l "x P(x) is true if and only if "x P(x) is false l "x P(x) is false if and only if there is some v such that P(v) is true l If P(v) is true, then \$x P(x) n \$x P(x) "x P(x) l \$x P(x) is true if and only if there is some v such that P(v) is true l If P(v) is true, then clearly P(x) does not hold for all possible values in the domain and thus we have "x P(x) Therefore "x P(x) º \$x P(x).

23 Translations from English To translate English sentences into logical expressions: 1. Rewrite the sentence to make it easier to translate 2. Determine the appropriate quantifiers to use 3. Look for words that indicate logical operators 4. Formalize sentence fragments 5. Put it all together

24 Example: At least one person in this classroom is named Bill and has lived in Pittsburgh for 8 years Rewrite: There exists at least one person who is in this classroom, is named Bill, and has lived in Pittsburgh for 8 years Formalize: l C(x) º x is in this classroom l N(x) º x is named Bill l P(x) º x has lived in Pittsburgh for 8 years Final expression: \$x [C(x) Ù N(x) Ù P(x)] Existential quantifier Conjunction

25 Example: If a student is taking CS441, then they have taken high school algebra Universal quantifier Rewrite: For all students, if a student is in CS 441, then they have taken high school algebra Formalize: Implication l C(x) º x is taking CS441 l H(x) º x has taken high school algebra Final expression: "x [C(x) H(x)]

26 Negate the previous example "x [C(x) H(x)] º \$x [C(x) H(x)] º \$x [ C(x) Ú H(x)] a b º a Ú b Double negation law º \$x [ C(x) Ù H(x)] º \$x [C(x) Ù H(x)] DeMorgan s law for negation over the universal quantifier DeMorgan s law for negation over disjunction Translate back into English: l There is a student taking CS441 that has not taken high school algebra!

27 Example: Jane enjoys drinking some types of tea Rewrite: There exist some types of tea that Jane enjoys drinking Formalize: l T(x) º x is a type of tea l D(x) º Jane enjoys drinking x Final expression: \$x [T(x) Ù D(x)] Negate the previous example: \$x [T(x) Ù D(x)] º "x [T(x) Ù D(x)] º "x [ T(x) Ú D(x)] º "x [T(x) D(x)] For all types of drink, if x is a tea, Jane does not enjoy drinking it.

28 In-class exercises Problem 3: Translate the following sentences into logical expressions. a) Some cows have black spots b) At least one student likes to watch football or ice hockey c) Any adult citizen of the US can register to vote if he or she is not a convicted felon Problem 4: Negate the translated expressions from problem 3. Translate these back into English.

29 Final Thoughts n The simplicity of propositional logic makes it unsuitable for solving certain types of problems n Predicate logic makes use of l Propositional functions to describe properties of objects l The universal quantifier to assert properties of all objects within a given domain l The existential quantifier to assert properties of some objects within a given domain n Predicate logic can be used to reason about relationships between objects and classes of objects n Next lecture: l Applications of predicate logic and nested quantifiers l Please read section 1.5

### 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

### Discrete Structures for Computer Science

Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #6: Rules of Inference Based on materials developed by Dr. Adam Lee Today s topics n Rules of inference

### 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

### DISCRETE 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

### Proposi'onal Logic Not Enough

Section 1.4 Proposi'onal Logic Not Enough If we have: All men are mortal. Socrates is a man. Socrates is mortal Compare to: If it is snowing, then I will study discrete math. It is snowing. I will study

### ! Predicates! Variables! Quantifiers. ! Universal Quantifier! Existential Quantifier. ! Negating Quantifiers. ! De Morgan s Laws for Quantifiers

Sec\$on Summary (K. Rosen notes for Ch. 1.4, 1.5 corrected and extended by A.Borgida)! Predicates! Variables! Quantifiers! Universal Quantifier! Existential Quantifier! Negating Quantifiers! De Morgan s

### Chapter 3. The Logic of Quantified Statements

Chapter 3. The Logic of Quantified Statements 3.1. Predicates and Quantified Statements I Predicate in grammar Predicate refers to the part of a sentence that gives information about the subject. Example:

### Predicate Calculus lecture 1

Predicate Calculus lecture 1 Section 1.3 Limitation of Propositional Logic Consider the following reasoning All cats have tails Gouchi is a cat Therefore, Gouchi has tail. MSU/CSE 260 Fall 2009 1 MSU/CSE

### Chapter 2: The Logic of Quantified Statements. January 22, 2010

Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3

### 1.3 Predicates and Quantifiers

1.3 Predicates and Quantifiers INTRODUCTION Statements x>3, x=y+3 and x + y=z are not propositions, if the variables are not specified. In this section we discuss the ways of producing propositions from

### Logic and Propositional Calculus

CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

### Predicate Logic. CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo

Predicate Logic CSE 191, Class Note 02: Predicate Logic Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 22 Outline 1 From Proposition to Predicate

### Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p

### Lecture 4. Predicate logic

Lecture 4 Predicate logic Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 All slides are based on CS441 Discrete

### Today s Topic: Propositional Logic

Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical

### 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

### Predicates and Quantifiers. CS 231 Dianna Xu

Predicates and Quantifiers CS 231 Dianna Xu 1 Predicates Consider P(x) = x < 5 P(x) has no truth values (x is not given a value) P(1) is true 1< 5 is true P(10) is false 10 < 5 is false Thus, P(x) will

### Section 2.1: Introduction to the Logic of Quantified Statements

Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional

### Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

Propositional Logic: Syntax and Natural Deduction 1 The Plot That Will Unfold I want to provide some key historical and intellectual context to the model theoretic approach to natural language semantics,

### Logic. 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

### First order Logic ( Predicate Logic) and Methods of Proof

First order Logic ( Predicate Logic) and Methods of Proof 1 Outline Introduction Terminology: Propositional functions; arguments; arity; universe of discourse Quantifiers Definition; using, mixing, negating

### 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

### MACM 101 Discrete Mathematics I. Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class)

MACM 101 Discrete Mathematics I Exercises on Predicates and Quantifiers. Due: Tuesday, October 13th (at the beginning of the class) Reminder: the work you submit must be your own. Any collaboration and

### Propositional and Predicate Logic

Propositional and Predicate Logic CS 536-05: Science of Programming This is for Section 5 Only: See Prof. Ren for Sections 1 4 A. Why Reviewing/overviewing logic is necessary because we ll be using it

### MAT 243 Test 1 SOLUTIONS, FORM A

t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,

### Symbolising Quantified Arguments

Symbolising Quantified Arguments 1. (i) Symbolise the following argument, given the universe of discourse is U = set of all animals. Animals are either male or female. Not all Cats are male, Therefore,

### University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. February 9, :30 pm Duration: 1:50 hs. Closed book, no calculators

University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura February 9, 2010 11:30 pm Duration: 1:50 hs Closed book, no calculators Last name: First name: Student number: There are 5 questions and

### ECOM Discrete Mathematics

ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional

### Introduction. Predicates and Quantifiers. Discrete Mathematics Andrei Bulatov

Introduction Predicates and Quantifiers Discrete Mathematics Andrei Bulatov Discrete Mathematics Predicates and Quantifiers 7-2 What Propositional Logic Cannot Do We saw that some declarative sentences

### Rules Build Arguments Rules Building Arguments

Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified

### Introduction to first-order logic:

Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September

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

### Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction

### 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

### Introduction to Predicate Logic Part 1. Professor Anita Wasilewska Lecture Notes (1)

Introduction to Predicate Logic Part 1 Professor Anita Wasilewska Lecture Notes (1) Introduction Lecture Notes (1) and (2) provide an OVERVIEW of a standard intuitive formalization and introduction to

### Discrete Mathematical Structures: Theory and Applications

Chapter 1: Foundations: Sets, Logic, and Algorithms Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with

### MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS

DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you

### Proposition 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

### Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

### LING 501, Fall 2004: Quantification

LING 501, Fall 2004: Quantification The universal quantifier Ax is conjunctive and the existential quantifier Ex is disjunctive Suppose the domain of quantification (DQ) is {a, b}. Then: (1) Ax Px Pa &

### Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables

### CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:

CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 1 Course Outline CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach

### 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

### Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when

### 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

### 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

### CS70: Discrete Math and Probability. Slides adopted from Satish Rao, CS70 Spring 2016 June 20, 2016

CS70: Discrete Math and Probability Slides adopted from Satish Rao, CS70 Spring 2016 June 20, 2016 Introduction Programming Computers Superpower! What are your super powerful programs doing? Logic and

### CS 1571 Introduction to AI Lecture 14. First-order logic. CS 1571 Intro to AI. Midterm

CS 1571 Introduction to AI Lecture 14 First-order logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Midterm The midterm for the course will be held on October 28, 2014 In class exam Closed book

### 1 Propositional Logic

CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with

### Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

### A. 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

### 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

### LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

### What 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

### CS2742 midterm test 2 study sheet. Boolean circuits: Predicate logic:

x NOT ~x x y AND x /\ y x y OR x \/ y Figure 1: Types of gates in a digital circuit. CS2742 midterm test 2 study sheet Boolean circuits: Boolean circuits is a generalization of Boolean formulas in which

### CS 2336 Discrete Mathematics

CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)

### 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

### Predicate logic. G. Carl Evans. Summer University of Illinois. Propositional Logic Review Predicate logic Predicate Logic Examples

G. Carl Evans University of Illinois Summer 2013 Propositional logic Propositional Logic Review AND, OR, T/F, implies, etc Equivalence and truth tables Manipulating propositions Implication Propositional

### First Order Logic (1A) Young W. Lim 11/18/13

Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software

### Chapter 1 Logic Unit Math 114

Chapter 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Statements Definition: A statement is a group of words or symbols that can be classified as true or false. Examples of statements

### 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

### CS 340: Discrete Structures for Engineers

CS 340: Discrete Structures for Engineers Instructor: Prof. Harry Porter Office: FAB 115-06 harry@cs.pdx.edu Hours: Mon 3-4, Wed 3-4, or by appointment Website: web.cecs.pdx.edu/~harry/discrete Class Mailing

### WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

### Topics in Logic and Proofs

Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2

### Logic. Lesson 3: Tables and Models. Flavio Zelazek. October 22, 2014

Logic Lesson 3: Tables and Models Flavio Zelazek flavio.zelazek@gmail.com October 22, 2014 Flavio Zelazek (flavio.zelazek@gmail.com) Logic (Lesson 3: Tables and Models) October 22, 2014 1 / 29 Previous

### CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

CSCE 222 Discrete Structures for Computing Predicate Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Predicates A function P from a set D to the set Prop of propositions is called a predicate.

### 1. Propositions: Contrapositives and Converses

Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement

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

### Logic Background (1A) Young W. Lim 12/14/15

Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any

### 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,

### Introduction to Logic: Argumentation and Interpretation. Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D

Introduction to Logic: Argumentation and Interpretation Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D. 30. 3. 2016 tests. Introduction to Logic: Argumentation and Interpretation

### Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory

Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should

### Negations of Quantifiers

Negations of Quantifiers Lecture 10 Section 3.2 Robb T. Koether Hampden-Sydney College Thu, Jan 31, 2013 Robb T. Koether (Hampden-Sydney College) Negations of Quantifiers Thu, Jan 31, 2013 1 / 20 1 Negations

### Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

You are a mathematician if 1.1 Overview you say to a car dealer, I ll take the red car or the blue one, but then you feel the need to add, but not both. --- 1. Logic and Mathematical Notation (not in the

### Logic and Modelling. Introduction to Predicate Logic. Jörg Endrullis. VU University Amsterdam

Logic and Modelling Introduction to Predicate Logic Jörg Endrullis VU University Amsterdam Predicate Logic In propositional logic there are: propositional variables p, q, r,... that can be T or F In predicate

### Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013

. Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space

### Unit 1 Logic Unit Math 114

Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific

### The 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 :

### Proseminar on Semantic Theory Fall 2013 Ling 720 First Order (Predicate) Logic: Syntax and Natural Deduction 1

First Order (Predicate) Logic: Syntax and Natural Deduction 1 A Reminder of Our Plot I wish to provide some historical and intellectual context to the formal tools that logicians developed to study the

### Bits and Bit Operations. Today s topics

oday s topics Bits and Bit Operations opic #2 Bits Boolean algebra preview Propositional equivalences Predicate logic Reading: Sections 1.2-1.4 Slides taken from Prof. Michael rank A bit is a binary nary

### Propositions and Proofs

Propositions and Proofs Gert Smolka, Saarland University April 25, 2018 Proposition are logical statements whose truth or falsity can be established with proofs. Coq s type theory provides us with a language

### Resolution (14A) Young W. Lim 8/15/14

Resolution (14A) Young W. Lim Copyright (c) 2013-2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version

### MATH 114 Fall 2004 Solutions to practice problems for Final Exam

MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from

### Math Real Analysis

1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch

### Unit 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

### 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

### Predicate Logic Quantifier Rules

Predicate Logic Quantifier Rules CS251 at CCUT, Spring 2017 David Lu May 8 th, 2017 Contents 1. Universal Instantiation (UI) 2. Existential Generalization (EG) 3. Universal Generalization (UG) 4. Existential

### 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

### Chapter 5: Section 5-1 Mathematical Logic

Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic

### [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

400 lecture note #2 [Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 1) Basics An argument is a sequence of statements ( s1, s2,, sn). All statements in an argument, excet for

### 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,

### Formal Logic: Quantifiers, Predicates, and Validity. CS 130 Discrete Structures

Formal Logic: Quantifiers, Predicates, and Validity CS 130 Discrete Structures Variables and Statements Variables: A variable is a symbol that stands for an individual in a collection or set. For example,

### The Fundamentals of Logic. Foundations of Logic. Foundations of Logic. CMSC 302 Propositional Logic. In Rosen, ~98 slides, ~3 lectures

VCU, Department of Computer Science CMSC 302 Propositional Logic Vojislav Kecman The Fundamentals of Logic In Rosen, 1.1-1.4 ~98 slides, ~3 lectures All the PPT slides are based on MP Franck s and H Bingöl

### 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:

### Reasoning. Inference. Knowledge Representation 4/6/2018. User

Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world

### CITS2211: Test One. Student Number: 1. Use a truth table to prove or disprove the following statement.

CITS2211: Test One Name: Student Number: 1. Use a truth table to prove or disprove the following statement. ((P _ Q) ^ R)) is logically equivalent to ( P ) ^ ( Q ^ R) P Q R P _ Q (P _ Q) ^ R LHS P Q R