CS2336 Discrete Mathematics
|
|
- Duane Riley
- 6 years ago
- Views:
Transcription
1 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. If a statement is a proposition, then decide the truth value of it. (a) 2008 is a leap year. (b) All people living in Taiwan can speak in Taiwanese. (c) No parking. (d) What is a polite society? (e) George Lucas is not an Asian. (f) If I have seen further, it is by standing on the shoulders of giants. 2. (*) Consider the expression (P Q) (P Q). In any way that you like, find an equivalent expression that is as short as possible. Prove that your expression is equivalent. 3. (*) Let M be the proposition you will get all pass. Let P be the proposition you work hard. Express each of the following statements using M, P, and logical connectives. (a) You will get all pass if you work hard. (b) You did not work hard but you will get all pass. (c) You will get all pass whether or not you work hard. 4. Write down the negation of the following statements. (a) a > 0 or b > 0. (b) Both Newton and Gauss are mathematicians. (c) If a 2 + b 2 = 0, then a = b = 0. (d) All people prefer taking trains than buses. 5. Explain why the following statements are correct. (a) (P Q) ( P Q) is a tautology. (b) P (P Q) is logically equivalent to P. (c) P (Q R) and (P Q) R are not logically equivalent. (d) The negation of P (Q R) is logically equivalent to ( P ) ( Q) ( R). 6. Which of the following statements are logically equivalent to P ( Q)? Why? (a) ( P ) ( Q) 1
2 (b) ( P ) Q (c) ( P ) Q (d) (P Q) 7. Construct the truth tables step by step of the following propositions. (a) P ( Q Q) (b) (P Q) (P Q) (c) P (Q R) 8. (*) What is wrong with this argument? Let H(x) be x is happy. Given that xh(x), we conclude that H(Lola). Therefore Lola is happy. 9. (*) What is wrong with this argument? Let S(x, y) be x is shorter than y. Given the premise ss(s, Max) it follows that S(Max, Max). Then by existential generalization it follows that xs(x, x), so that someone is shorter than himself. 10. (*) Identify the error or errors in this argument that supposedly shows that if x(p (x) Q(x)) is true then xp (x) xq(x) is true. (1) x(p (x) Q(x)) Premise. (2) P (c) Q(c) Universal instantiation from (1). (3) P (c) Simplification from (2). (4) xp (x) Universal generalization from (3). (5) Q(c) Simplification from (2). (6) xq(x) Universal generalization from (5). (7) x(p (x) Q(x)) Conjunction from (4) and (6). 11. Show that the following arguments are valid. (a) Premises: A (B C), A Conclusion: B (b) Premises: E F, E G, F Conclusion: G (c) Premises: G F, H F, G Conclusion: H (d) Premises: N V, V Conclusion: N (e) Premises: U C, L U, L Conclusion: C (f) Premises: (A B) (C D), A C, B Conclusion: D (g) Premises: (H J) (I K), L, L (H I) Conclusion: J K (h) Premises: ( P Q) R, R (S T ), S U, U T Conclusion: P 2
3 12. Show that each of the following arguments is invalid by providing a counterexample. Find an assignment of truth values for given primitive statements P, Q, R, and S such that all premises are true while the conclusion is false. (a) Premises: (((P Q) R) ( Q R) Conclusion: P (b) Premises: P Q, Q R, R S, S Q Conclusion: S (c) (*) Premises: P, P R, P (Q R), Q S Conclusion: S 13. Show that the following arguments are valid. (a) Premises: xa(x) Conclusion: xa(x) (b) Premises: xa(x) Conclusion: x(a(x) B(x)) (c) Premises: x(a(x) B(x)), x(a(x) C(x)) Conclusion: x(c(x) B(x)) (d) Premises: x( K(x) H(x)) y(l(y) L(y)) Conclusion: x H(x) 14. (*) Let P (x), Q(x), and R(x) be the following open statements. P (x) : x 2 7x + 10 = 0 Q(x) : x 2 2x 3 = 0 R(x) : x < 0 (a) Determine the truth or falsity of the following statements, where the universe is all integers. If a statement is false, provide a counterexample or explanation. i. x(p (x) R(x)) ii. x(q(x) R(x)) iii. x(q(x) R(x)) iv. x(p (x) R(x)) (b) Find the answers to part (a) when the universe consists of all positive integers. (c) Find the answers to part (a) when the universe contains only the integers 2 and There are four boxes, A, B, C, and D. There are cakes in some of them. We know that If there are cakes in at least one of A and B, then D contains cakes. If there are cakes in at least one of A and C, then at least one of B and D do not contain cakes. If there are cakes in at least one of A and D, then B contains cakes, too. What can we say about A? (a) There must be cakes in it. 3
4 (b) There must be no cake in it. (c) We cannot conclude anything about A. 16. (*) Four students (A, B, C and D) attended an exam. The following are what they said after the exam. A: I got the highest score. B: I got the highest score. C: My score is lower than A s. D: B s score is higher than C s. Only the one who got the highest score tells the truth, the others are all liars. List the names of the students according to their scores from highest to lowest. (Note: All students have different scores.) 17. (*, Challenging) Jane, Janice, Jack, Jasper, and Jim are the names of five high schools chums. Their last names in one order or another are Carter, Carver, Clark, Clayton, and Cramer. Jasper s mother is dead. In deference to a certain very wealthy aunt, Mr. and Mrs. Clayton agreed when they were first married that if they ever had a daughter they would name her Janice. Jane s father and mother have never met Jack s parents. The Cramer and Carter children have been teammates on several of the school s athletic teams. When Cramer heard that Carver was going to be out of town on the night of the school s Father and Son banquet, Cramer called Mrs. Carver and offered to adopt her son for the evening, but Jack s father had already asked him to go. The Clarks and Carters, who are very good friends, were delighted when their children began dating each other. What is the full name of each youngster? You can make the following assumptions: If person A dates person B, then A and B are of opposite gender. There are no mixed gender sports. Agreements are always kept. No one got divorced. 18. (*, Challenging) Albert Einstein once posed a brain teaser that he predicted only 2% of the worlds population would be able to solve. FACTS: (a) There are 5 houses in 5 different colours (red, white, green, yellow, blue). (b) In each house lives a person with a different nationality (British, Swedish, Danish, German, Norwegian). 4
5 (c) These 5 owners drink a certain beverage (tea, coffee, milk, beer, water), smoke a certain brand of cigarette (Pall Mall, Dunhill, Blend, Camel, Marlborough), and keep a certain pet (dog, birds, cats, horses, fish). (d) No owners have the same pet, brand of cigaratte, or drink. CLUES: (a) The Brit lives in a red house. (b) The Swede keeps a dog. (c) The Dane drinks tea. (d) The green house is on the left of the white house. (e) The green house owner drinks coffee. (f) The person who smokes Pall Mall keeps birds. (g) The owner of the yellow house smokes Dunhill. (h) The man living in the house right in the center drinks milk. (i) The Norwegian lives in the first house. (j) The man who smokes Blend lives next to the one who keeps cats. (k) The man who keeps horses lives next to the man who smokes Dunhill. (l) The owner who smokes Camel drinks beer. (m) The German smokes Marlborough. (n) The Norwegian lives next to the blue house. (o) The man who smokes Blend has a neighbour who drinks water. The question is, who keeps the fish? HINT: Try working it out with pencil and paper as a matrix 5
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
More informationFormal (Natural) Deduction for Predicate Calculus
Formal (Natural) Deduction for Predicate Calculus Lila Kari University of Waterloo Formal (Natural) Deduction for Predicate Calculus CS245, Logic and Computation 1 / 42 Formal deducibility for predicate
More informationMACM 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
More information2. Use quantifiers to express the associative law for multiplication of real numbers.
1. Define statement function of one variable. When it will become a statement? Statement function is an expression containing symbols and an individual variable. It becomes a statement when the variable
More informationDenote John by j and Smith by s, is a bachelor by predicate letter B. The statements (1) and (2) may be written as B(j) and B(s).
PREDICATE CALCULUS Predicates Statement function Variables Free and bound variables Quantifiers Universe of discourse Logical equivalences and implications for quantified statements Theory of inference
More informationChapter 1 - Foundations
Chapter 1 - oundations Introduction Suppose that: 1. Babies are illogical. 2. Nobody is despised who can manage a crocodile. 3. Illogical persons are despised. What conclusion may be reached using all
More informationChapter 2: The Logic of Quantified Statements
Chapter 2: The Logic of Quantified Statements Topics include 2.1, 2.2 Predicates and Quantified Statements, 2.3 Statements with Multiple Quantifiers, and 2.4 Arguments with Quantified Statements. cs1231y
More informationDISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form
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
More informationINSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC
1 CHAPTER 7. PREDICATE LOGIC 1 INSTITIÚID TEICNEOLAÍOCHTA CHEATHARLACH INSTITUTE OF TECHNOLOGY CARLOW PREDICATE LOGIC 1 Predicate Logic 1.1 Introduction There are various arguments which cannot be dealt
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More information4 Quantifiers and Quantified Arguments 4.1 Quantifiers
4 Quantifiers and Quantified Arguments 4.1 Quantifiers Recall from Chapter 3 the definition of a predicate as an assertion containing one or more variables such that, if the variables are replaced by objects
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationSection Summary. Section 1.5 9/9/2014
Section 1.5 Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements into Statements involving Nested Quantifiers Translated
More informationPredicates, 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 information1.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
More informationRules Build Arguments Rules Building Arguments
Section 1.6 1 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments Rules of Inference for Quantified Statements Building Arguments for Quantified
More informationMath 3336: Discrete Mathematics Practice Problems for Exam I
Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing
More informationTest 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:
Test 1 Solutions(COT3100) Sitharam (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology: ( q (p q) (r p)) r Solution. This is Modus Tollens applied twice, with transitivity
More informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationMathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC
I. BASICS OF PROPOSITIONAL LOGIC George Boole (1815-1864) developed logic as an abstract mathematical system consisting of propositions, operations (conjunction, disjunction, and negation), and rules for
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More informationUniversity of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura. March 1, :00 pm Duration: 1:15 hs
University of Ottawa CSI 2101 Midterm Test Instructor: Lucia Moura March 1, 2012 1:00 pm Duration: 1:15 hs Closed book, no calculators THIS MIDTERM AND ITS SOLUTION IS SUBJECT TO COPYRIGHT; NO PARTS OF
More information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationWhat does the word Proof mean to you A) Establishing a fact with complete certainty
Silly starter Clicker question What does the word Proof mean to you A) Establishing a fact with complete certainty B) Establishing a fact beyond reasonable doubt C) What happens to dough when you add yeast
More informationAnnouncement. Homework 1
Announcement I made a few small changes to the course calendar No class on Wed eb 27 th, watch the video lecture Quiz 8 will take place on Monday April 15 th We will submit assignments using Gradescope
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationHomework assignment 1: Solutions
Math 240: Discrete Structures I Due 4:30pm Friday 29 September 2017. McGill University, Fall 2017 Hand in to the mailbox at Burnside 1005. Homework assignment 1: Solutions Discussing the assignment with
More informationLOGIC 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,
More informationFormal 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,
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Homework 1- Fall 2010 Due Date: Sept. 16 2010, 3:30 pm Statements, Truth Values, and Tautologies 1. Which of the following are statements? a) 3 + 7 = 10 b) All cars are blue.
More informationPredicates 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
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: The Foundations: Logic and Proofs (1.3-1.5) MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 19, 2017 Outline 1 Logical
More informationIII. Elementary Logic
III. Elementary Logic The Language of Mathematics While we use our natural language to transmit our mathematical ideas, the language has some undesirable features which are not acceptable in mathematics.
More informationDiscrete 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
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationCITS2211: 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
More informationPredicate Logic. Andreas Klappenecker
Predicate Logic Andreas Klappenecker Predicates A function P from a set D to the set Prop of propositions is called a predicate. The set D is called the domain of P. Example Let D=Z be the set of integers.
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
MTH 164 Practice Exam 2 Spring 2008 Dr. Garcia-Puente Name Section MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Decide whether or not the following
More informationCOMP 2600: Formal Methods for Software Engineeing
COMP 2600: Formal Methods for Software Engineeing Dirk Pattinson Semester 2, 2013 What do we mean by FORMAL? Oxford Dictionary in accordance with convention or etiquette or denoting a style of writing
More informationHOW TO USE A CHART Y N N N N N N Y Y N N N Y N N N Y Y N N. iv 2005 The Critical Thinking Co.
Mind Benders Beginning Book How to Use a Chart HOW TO USE A CHART A Mind Benders problem gives you two lists of things and asks you to match each item in one list with an item in the other list by writing
More informationChapter 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:
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More informationCS 220: Discrete Structures and their Applications. Predicate Logic Section in zybooks
CS 220: Discrete Structures and their Applications Predicate Logic Section 1.6-1.10 in zybooks From propositional to predicate logic Let s consider the statement x is an odd number Its truth value depends
More informationMACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)
MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:
More informationKS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team
KS091201 MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE Discrete Math Team 2 -- KS091201 MD W-04 Outline Valid Arguments Modus Ponens Modus Tollens Addition and Simplification More Rules
More informationWhat is the story behind the picture?
What is the story behind the picture? Silly starter Clicker question The picture is an example of which fallacy? A) Straw man B Slippery slope C) Argumentum ad hominum D) Ignoratio Elenchi E) Circular
More informationBefore you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.
Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will
More informationProving Arguments Valid in Predicate Calculus
Proving Arguments Valid in Predicate Calculus Lila Kari University of Waterloo Proving Arguments Valid in Predicate Calculus CS245, Logic and Computation 1 / 22 Predicate calculus - Logical consequence
More informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Suggested Problems for Logic and Proof The following problems are from Discrete Mathematics and Its Applications by Kenneth H. Rosen. 1. Which of these
More informationSection 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
More informationSection 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
More informationIntroduction. 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
More informationReview: Potential stumbling blocks
Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)
More informationPredicate Logic. Example. Statements in Predicate Logic. Some statements cannot be expressed in propositional logic, such as: Predicate Logic
Predicate Logic Predicate Logic (Rosen, Chapter 1.4-1.6) TOPICS Predicate Logic Quantifiers Logical Equivalence Predicate Proofs Some statements cannot be expressed in propositional logic, such as: All
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 3 Logic: Rules of Inference 1 Outline Mathematical Argument Rules of Inference 2 Argument In mathematics, an argument is a sequence of propositions (called premises)
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationPropositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013
Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics
More informationTHE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM Eng. Huda M.
THE ISLAMIC UNIVERSITY OF GAZA ENGINEERING FACULTY DEPARTMENT OF COMPUTER ENGINEERING DISCRETE MATHMATICS DISCUSSION ECOM 2011 Eng. Huda M. Dawoud September, 2015 Section 1: Propositional Logic 2. Which
More informationChapter 1: Inductive and Deductive Reasoning
Chapter 1: Inductive and Deductive Reasoning Section 1.1 Chapter 1: Inductive and Deductive Reasoning Section 1.1: Making Conjectures: Inductive Reasoning Terminology: Conjecture: A testable expression
More informationAt least one of us is a knave. What are A and B?
1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either
More informationLecture 3 : Predicates and Sets DRAFT
CS/Math 240: Introduction to Discrete Mathematics 1/25/2010 Lecture 3 : Predicates and Sets Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we discussed propositions, which are
More information! 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
More informationMat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.
Fall 2013 Student Responsibilities Reading: Textbook, Sections 1.5 1.6 Assignments: as given in the Homework Assignment list (handout) Secs. 1.5 & 1.6 Attendance: Dryly Encouraged Overview Finish up 1.1
More informationCS0441 Discrete Structures Recitation 3. Xiang Xiao
CS0441 Discrete Structures Recitation 3 Xiang Xiao Section 1.5 Q10 Let F(x, y) be the statement x can fool y, where the domain consists of all people in the world. Use quantifiers to express each of these
More informationCOMP232 - Mathematics for Computer Science
COMP232 - Mathematics for Computer Science Tutorial 4 Ali Moallemi moa ali@encs.concordia.ca Iraj Hedayati h iraj@encs.concordia.ca Concordia University, Winter 2016 Ali Moallemi, Iraj Hedayati COMP232
More informationChapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.
Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements
More informationCSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE
1 CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE Spring 2015 February 5, 2015 2 Announcements Homework 1 is due now. Homework 2 will be posted on the web site today. It is due Thursday, Feb. 12 at 10am in class.
More informationCHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
More informationExercises. 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)
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationLOGIC. Name: Teacher: Pd: Page 1
LOGIC Name: Teacher: Pd: Page 1 Table of Contents Day 1 Introduction to Logic HW pages 8-10 Day 2 - Conjunction, Disjunction, Conditionals, and Biconditionals HW pages 16-17 #13-34 all, #35 65(every other
More informationPredicate 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
More informationNotes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the
More informationAnnouncements CompSci 102 Discrete Math for Computer Science
Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationSection Summary. Predicate logic Quantifiers. Negating Quantifiers. Translating English to Logic. Universal Quantifier Existential Quantifier
Section 1.4 Section Summary Predicate logic Quantifiers Universal Quantifier Existential Quantifier Negating Quantifiers De Morgan s Laws for Quantifiers Translating English to Logic Propositional Logic
More informationDiscrete Structures Homework 1
Discrete Structures Homework 1 Due: June 15. Section 1.1 16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 c) 1 +
More informationPREDICATE LOGIC. Schaum's outline chapter 4 Rosen chapter 1. September 11, ioc.pdf
PREDICATE LOGIC Schaum's outline chapter 4 Rosen chapter 1 September 11, 2018 margarita.spitsakova@ttu.ee ICY0001: Lecture 2 September 11, 2018 1 / 25 Contents 1 Predicates and quantiers 2 Logical equivalences
More information2/18/14. What is logic? Proposi0onal Logic. Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.
Logic? Propositional Logic, Truth Tables, and Predicate Logic (Rosen, Sections 1.1, 1.2, 1.3) TOPICS Propositional Logic Logical Operations Equivalences Predicate Logic CS160 - Spring Semester 2014 2 What
More informationRules of Inference. Arguments and Validity
Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if
More informationPredicate Logic & Quantification
Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More informationMathematical Reasoning. The Foundation of Algorithmics
Mathematical Reasoning The Foundation of Algorithmics The Nature of Truth In mathematics, we deal with statements that are True or False This is known as The Law of the Excluded Middle Despite the fact
More informationQuantifiers Here is a (true) statement about real numbers: Every real number is either rational or irrational.
Quantifiers 1-17-2008 Here is a (true) statement about real numbers: Every real number is either rational or irrational. I could try to translate the statement as follows: Let P = x is a real number Q
More informationFull file at Chapter 1
Chapter 1 Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
More informationToday s Lecture. ICS 6B Boolean Algebra & Logic. Predicates. Chapter 1: Section 1.3. Propositions. For Example. Socrates is Mortal
ICS 6B Boolean Algebra & Logic Today s Lecture Chapter 1 Sections 1.3 & 1.4 Predicates & Quantifiers 1.3 Nested Quantifiers 1.4 Lecture Notes for Summer Quarter, 2008 Michele Rousseau Set 2 Ch. 1.3, 1.4
More informationQuantifiers. P. Danziger
- 2 Quantifiers P. Danziger 1 Elementary Quantifiers (2.1) We wish to be able to use variables, such as x or n in logical statements. We do this by using the two quantifiers: 1. - There Exists 2. - For
More informationTHE 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 informationPredicate Calculus. Lila Kari. University of Waterloo. Predicate Calculus CS245, Logic and Computation 1 / 59
Predicate Calculus Lila Kari University of Waterloo Predicate Calculus CS245, Logic and Computation 1 / 59 Predicate Calculus Alternative names: predicate logic, first order logic, elementary logic, restricted
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More information(Refer Slide Time: 02:20)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 Logical Inference In the last class we saw about
More informationSkills Practice Skills Practice for Lesson 3.1
Skills Practice Skills Practice for Lesson.1 Name Date A Little Dash of Logic Two Methods of Logical Reasoning Vocabulary Define each term in your own words. 1. inductive reasoning 2. deductive reasoning
More information