# DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form

Save this PDF as:

Size: px
Start display at page:

Download "DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form"

## Transcription

1 DISCRETE MATH: LECTURE 5 DR. DANIEL FREEMAN 1. Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form x D, y E such that P (x, y) your challenge is to allow someone else to pick whatever element x in D they wish and then you must find an element y in E that works for that particular x. If you want to establish the truth of a statement of the form x D such that y E, P (x, y) your job is to find one particular x in D that will work no matter what y in E anyone might choose to challenge you with. Hence, in a statement containing both and, changing the order of the quantifiers usually changes the meaning of the statement! For example: Consider the statements: people x, a person y such that x loves y. a person y, such that people x, x loves y In Class Work. A college cafeteria line has four stations: salads, main courses, desserts, and beverages. The salad station offers a choice of green salad or fruit salad; the main course station offers spaghetti or fish; the dessert station offers pie or cake; and the beverage station offers milk, soda, or coffee. Three students, Uta, Tim, and Yuen, go through the line a make the following choices: Uta: green salad, spaghetti, pie, milk Tim: fruit salad, fish, pie, cake, milk, coffee Yuen: spaghetti, fish, pie, soda Write each of the following statements informally and find its truth value. (1) an item I such that students S, S choose I. (2) a student S such that items I, S choose I. (3) a student S such that stations Z, an item I in Z such that S choose I. (4) studets S and station Z, an item I in Z such that S choose I. 1

2 2 DR. DANIEL FREEMAN 1.2. Negations of Multiply-Quantified Statements. ( x D, y E such that P (x, y)) is equivalent to x D such that y E, P (x, y) ( x D such that y E, P (x, y)) is equivalent to x D, y E such that P (x, y) 1.3. Formal Logic Notation. In some areas of computer science, logical statements are expressed in purely symbolic notation. The formalism depends on the following facts: x in D, P (x) can be written as x(x D P (x)). x in D such thatp (x) can be written as x(x D P (x)) In Class Work. Rewrite the statement formally using quantifiers and variables. Then, write a negation for each statement. (1) Everybody loves somebody. (2) Somebody loves everybody. (3) Any even integer equals twice some integer. (4) There is a program that gives the correct answer to every question that is posed to it.

3 DISCRETE MATH: LECTURE Chapter 3.4 Arguments with Quantified Statements The rule of universal instantiation: If some property is true of everything in a set, then it is true of any particular thing in the set. For example: Suppose you are doing a math problem where you need to simplify r k+1 r, where r R and k is some integer Universal Modus Ponens. Universal Modus Ponens x if P (x) then Q(x). P (a) for a particular a. Q(a) For example: Write the conclusion that can be inferred using universal modus ponens. If T is any right triangle with hypotenuse c and legs a and b, then c 2 = a 2 + b 2. The triangle shown is a right triangle with both legs equal to 1 and hypotenuse c Universal Modus Tollens. Universal Modus Tollens x if P (x) then Q(x). Q(a) for a particular a. P (a) For example: Write the conclusion that can be inferred using universal modus tollens. All professors are absent-minded. Tom Hutchins is not absent-minded Proving Validity of Arguments with Quantified Statements. To say that an argument form is valid means the following: No matter what particular predicates are substituted for the predicate symbols in its premises, if the resulting premise statements area all true, then the conclusion is also true. An argument is called valid if, and only if, its form is valid.

4 4 DR. DANIEL FREEMAN 2.4. Using Diagrams to Test for Validity. To test the validity of an argument diagrammatically, represent the truth of both premises with diagrams. Then analyze the diagrams to see whether they necessarily represent the truth of the conclusion as well. For example: use diagrams to show the validity of the following syllogism: All humans beings are mortal. Zeus is not mortal. Zeus is not a human being.. For example: Use a diagram to show the invalidity of the following argument: All human beings are mortal. Felix is a mortal. Felix is a human being. The last example exhibits the converse error. The converse error has the following form: x, if P (x) then Q(x). Q(a) for a particular a. P (a).

5 DISCRETE MATH: LECTURE In Class Work: Use a diagram to show the invalidity of the inverse error form which is: x, if P (x) then Q(x). P (a), for a particular a. Q(a). Use diagrams to test the following argument for validity: No polynomial functions have horizontal asymptotes. This function has a horizontal asymptote. This function is not a polynomial function Creating Additional Forms of Argument. Universal Transitivity xp (x) Q(x). xq(x) R(x). xp (x) R(x).

### Tutorial 2 Logic of Quantified Statements

Tutorial 2 Logic of Quantified Statements 1. Let V be the set of all visitors to Universal Studios Singapore on a certain day, T (v) be v took the Transformers ride, G(v) be v took the Battlestar Galactica

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

### CPSC 121: Models of Computation

CPSC 121: Models of Computation Unit 6 Rewriting Predicate Logic Statements Based on slides by Patrice Belleville and Steve Wolfman Coming Up Pre-class quiz #7 is due Wednesday October 25th at 9:00 pm.

### DISCRETE MATH: FINAL REVIEW

DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review

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

### Math 55 Homework 2 solutions

Math 55 Homework solutions Section 1.3. 6. p q p q p q p q (p q) T T F F F T F T F F T T F T F T T F T F T F F T T T F T 8. a) Kwame will not take a job in industry and not go to graduate school. b) Yoshiko

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

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

### 5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

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

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

### CS2336 Discrete Mathematics

CS2336 Discrete Mathematics Homework 1 Tutorial: March 20, 2014 Problems marked with * will be explained in the tutorial. 1. Determine which of the following statements are propositions and which are non-propositions.

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

### Analyzing Arguments with Truth Tables

Analyzing Arguments with Truth Tables MATH 100 Survey of Mathematical Ideas J. Robert Buchanan Department of Mathematics Fall 2014 Introduction Euler diagrams are useful for checking the validity of simple

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

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

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

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

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

### Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

Logic and Proof Argument An argument is a sequence of statements. All statements but the first one are called assumptions or hypothesis. The final statement is called the conclusion. An argument is valid

### Fuzzy Expert Systems Lecture 6 (Fuzzy Logic )

Fuzzy Expert Systems Lecture 6 (Fuzzy Logic ) Unlike Classical Logic, Fuzzy Logic is concerned, in the main, with modes of reasoning which are approximate rather than exact L. A. Zadeh Lecture 6 صفحه Summary

### Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three

### CITS2211 Discrete Structures Proofs

CITS2211 Discrete Structures Proofs Unit coordinator: Rachel Cardell-Oliver August 13, 2017 Highlights 1 Arguments vs Proofs. 2 Proof strategies 3 Famous proofs Reading Chapter 1: What is a proof? Mathematics

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

### Axiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:

Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,

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

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

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

### Deductive and Inductive Logic

Deductive Logic Overview (1) Distinguishing Deductive and Inductive Logic (2) Validity and Soundness (3) A Few Practice Deductive Arguments (4) Testing for Invalidity (5) Practice Exercises Deductive and

### Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

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

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

### Solving Equations with Addition and Subtraction

OBJECTIVE: You need to be able to solve equations by using addition and subtraction. In math, when you say two things are equal to each other, you mean they represent the same value. We use the = sign

### Logical Reasoning. Chapter Statements and Logical Operators

Chapter 2 Logical Reasoning 2.1 Statements and Logical Operators Preview Activity 1 (Compound Statements) Mathematicians often develop ways to construct new mathematical objects from existing mathematical

### Lecture : Set Theory and Logic

Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Contrapositive and Converse 1 Contrapositive and Converse 2 3 4 5 Contrapositive and Converse

### Natural deduction for truth-functional logic

Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or

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

### OGIC 2.1 Propositional Calculus

2 LOGIC 2. Propositional Calculus 2.. Definitions This concerns formulae or propositions, B, C,... which are statements which are True or False. If and B are formulae then the following are also formulae:

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

### Example ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.

Announcements CS311H: Discrete Mathematics More Logic Intro to Proof Techniques Homework due next lecture Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mathematics More Logic Intro

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

### For a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.

7.1 The start of Proofs From now on the arguments we are working with are all VALID. There are 18 Rules of Inference (see the last 2 pages in Course Packet, or front of txt book). Each of these rules is

### First-Order Logic. Announcements. General Logic. PL Review: Truth Tables. First-Order Logic. PL Review: Inference Rules

irst-order Logic Announcements Homework #2 is assigned, it is due Monday, July 7 (1 week from today) Burr H. Settles CS-540, UW-Madison www.cs.wisc.edu/~cs540-1 Summer 2003 Project proposals are due today

### Discrete Structures for Computer Science

Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n

### Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS DERIVED RULE RAA DERIVED RULE TND

Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS We have last week completed the introduction of a calculus, which is sound and complete. That is, we can syntactically establish the

### Exercises. Exercise Sheet 1: Propositional Logic

B Exercises Exercise Sheet 1: Propositional Logic 1. Let p stand for the proposition I bought a lottery ticket and q for I won the jackpot. Express the following as natural English sentences: (a) p (b)

### Discrete Mathematics

Department of Mathematics National Cheng Kung University 2008 2.4: The use of Quantifiers Definition (2.5) A declarative sentence is an open statement if 1) it contains one or more variables, and 1 ) quantifier:

### Logical forms and substitution instances. Philosophy and Logic Unit 2, Section 2.1

Logical forms and substitution instances Philosophy and Logic Unit 2, Section 2.1 Avoiding impossibility A valid deductive argument is an argument with a valid logical form. An argument has a valid logical

### Collins' notes on Lemmon's Logic

Collins' notes on Lemmon's Logic (i) Rule of ssumption () Insert any formula at any stage into a proof. The assumed formula rests upon the assumption of itself. (ii) Double Negation (DN) a. b. ( Two negations

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

### Discrete Mathematics

Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 9, 2009 Overview of ( 1.5-1.7, ~2 hours) Methods of mathematical argument (i.e., proof methods) can be formalized

### Horizontal and Vertical Asymptotes from section 2.6

Horizontal and Vertical Asymptotes from section 2.6 Definition: In either of the cases f(x) = L or f(x) = L we say that the x x horizontal line y = L is a horizontal asymptote of the function f. Note:

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

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

### CCHS Math Unit Exam (Ch 1,2,3) Name: Math for Luiberal Arts (200 Points) 9/23/2014

CCHS Math Unit Exam (Ch 1,2,3) Name: Math for Luiberal Arts (200 Points) 9/23/2014 MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Let U = {q, r,

### Logic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014

John Nachbar Washington University December 26, 2014 Logic and Proofs 1 1 Overview. These notes provide an informal introduction to some basic concepts in logic. For a careful exposition, see, for example,

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

### Solving Equations by Adding and Subtracting

SECTION 2.1 Solving Equations by Adding and Subtracting 2.1 OBJECTIVES 1. Determine whether a given number is a solution for an equation 2. Use the addition property to solve equations 3. Determine whether

### 3.6. Disproving Quantified Statements Disproving Existential Statements

36 Dproving Quantified Statements 361 Dproving Extential Statements A statement of the form x D, P( if P ( false for all x D false if and only To dprove th kind of statement, we need to show the for all

### 6. Conditional derivations

6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that

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

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

### Solving Equations with Addition and Subtraction. Solving Equations with Addition and Subtraction. Solving Equations with Addition and Subtraction

OBJECTIVE: You need to be able to solve equations by using addition and subtraction. In math, when you say two things are equal to each other, you mean they represent the same value. We use the sign to

### Discrete Mathematics. Sec

Islamic University of Gaza Faculty of Engineering Department of Computer Engineering Fall 2011 ECOM 2311: Discrete Mathematics Eng. Ahmed Abumarasa Discrete Mathematics Sec 1.1-1.6 The Foundations: Logic

### 6. Conditional derivations

6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes gives an important argument for government. Hobbes begins by claiming that without a common

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

### Computational Logic. Recall of First-Order Logic. Damiano Zanardini

Computational Logic Recall of First-Order Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic

### [1] Describe with examples, the three inference rules involving quantifiers

[1] Describe with examples, the three inference rules involving quantifiers The three new inference rules are as follows: 1- Universal Instantiation : For any sentence a, variable v, and ground term g

### Proofs. Chapter 2 P P Q Q

Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,

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

### Notes for Recitation 1

6.042/18.062J Mathematics for Computer Science September 10, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 1 1 Logic How can one discuss mathematics with logical precision, when the English

### Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and

### Unit 6 Logic Math 116

Unit 6 Logic Math 116 Logic Unit Statement: A group words or symbols that can be classified as true or false. Examples of statements Violets are blue Five is a natural number I like Algebra 3 + 7 = 10

### EXERCISES BOOKLET. for the Logic Manual. Volker Halbach. Oxford. There are no changes to the exercises from last year s edition

EXERCISES BOOKLET for the Logic Manual 2017/2018 There are no changes to the exercises from last year s edition Volker Halbach Oxford 21st March 2017 1 preface The most recent version of this Exercises

### The University of Nottingham

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 3 MODULE, AUTUMN SEMESTER 2011-2012 KNOWLEDGE REPRESENTATION AND REASONING Time allowed TWO hours Candidates may complete the front cover

### The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

The Conditional (IMPLIES) Operator The conditional operation is written p q. The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence. The Conditional

### Logic and Set Notation

Logic and Set Notation Logic Notation p, q, r: statements,,,, : logical operators p: not p p q: p and q p q: p or q p q: p implies q p q:p if and only if q We can build compound sentences using the above

### Section 1.3: Valid and Invalid Arguments

Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order

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

### Lesson 11: The Special Role of Zero in Factoring

Lesson 11: The Special Role of Zero in Factoring Student Outcomes Students find solutions to polynomial equations where the polynomial expression is not factored into linear factors. Students construct

### Basic Fraction and Integer Operations (No calculators please!)

P1 Summer Math Review Packet For Students entering Geometry The problems in this packet are designed to help you review topics from previous mathematics courses that are important to your success in Geometry.

### Equations with regular-singular points (Sect. 5.5).

Equations with regular-singular points (Sect. 5.5). Equations with regular-singular points. s: Equations with regular-singular points. Method to find solutions. : Method to find solutions. Recall: The

### The University of Nottingham

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 3 MODULE, AUTUMN SEMESTER 2010-2011 KNOWLEDGE REPRESENTATION AND REASONING Time allowed TWO hours Candidates may complete the front cover

### Notes on Venn Diagrams Cynthia Bolton Arizona State University - Summer 2005

Notes on Venn Diagrams Cynthia Bolton Arizona tate University - ummer 2005 Venn Diagrams: An Introduction Venn diagrams are used to pictorially prove the validity or invalidity of syllogisms. A Venn diagram

### Material Implication and Entailment

510 Notre Dame Journal of Formal Logic Volume 29, Number 4, Fall 1988 Material Implication and Entailment CLARO R. CENIZA* The paradoxes of material implication have been called "paradoxes" of a sort because

### Square Roots and the Pythagorean Theorem Lesson Tutors with Vision Project. Spring 2008

The square root of a number, n, written below is the number that gives n when multiplied by itself. Square Roots and the Pythagorean Theorem Lesson Tutors with Vision Project Center for Teacher Certification

### Deductive Systems. Lecture - 3

Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth

### Introduc+on to Discrete Mathema+cs. Course Outline. Prof. G. Kesidis, instructor. Course Outline

Introduc+on to Discrete Mathema+cs Course Outline Prof. G. Kesidis, instructor 1 Course Outline Introduction to logic Introduction to methods of proof Sequences and induction Introduction to set theory

### CS 214 Introduction to Discrete Structures. Chapter 1 Formal Logic. Mikel D. Petty, Ph.D.

CS 214 Introduction to Discrete Structures Chapter 1 Formal Logic Mikel D. Petty, Ph.D. Center for Modeling, Simulation, and Analysis CS 214 Formal Logic 1.2 Chapter sections and objectives 1.1 Statements,

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

### Accuplacer College Level Math Study Guide

Testing Center Student Success Center Accuplacer Study Guide The following sample questions are similar to the format and content of questions on the Accuplacer College Level Math test. Reviewing these

### Math Introduction to Abstract Mathematics Supplementary Lecture Notes 1

Math 108 - Introduction to Abstract Mathematics Supplementary Lecture Notes 1 1 Mathematical rigor vs. scientific rigor Did the sun rise today? Did it rise every day of your life so far? Your answers to

### Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic

Journal of Uncertain Systems Vol.3, No.4, pp.243-251, 2009 Online at: www.jus.org.uk Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic Baoding Liu Uncertainty Theory Laboratory