COMP232 - Mathematics for Computer Science
|
|
- Scot Hardy
- 5 years ago
- Views:
Transcription
1 COMP232 - Mathematics for Computer Science Tutorial 3 Ali Moallemi moa ali@encs.concordia.ca Iraj Hedayati h iraj@encs.concordia.ca Concordia University, Winter 2017 Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 1 / 20
2 Table of Contents Propositional Logic Exercise 4 Exercise 7 Exercise 9 Exercise 11 Exercise 20 Exercise 28 Exercise 28 Exercise 32 Exercise 34 Exercise 36 Exercise 46 Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 2 / 20
3 Exercise 4 Express quantifications in English Remark P(x, y): Student x has taken class y Domain of x: all students Domain of y: all computer science courses at your school a) x y P(x, y) Answer: Some students have taken some computer science courses b) x y P(x, y) Answer: Some students have taken all computer science courses c) x y P(x, y) Answer: All students have taken some computer science courses Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 3 / 20
4 Exercise 4 (cont...) Express quantifications in English Remark P(x, y): Student x has taken class y Domain of x: all students Domain of y: all computer science courses at your school d) y x P(x, y) Answer: Some computer science courses have been taken by all students e) y x P(x, y) Answer: All computer science courses have been taken by some students f) x y P(x, y) Answer: All students have taken all computer science courses Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 4 / 20
5 Exercise 7 Express sentences by simple English sentence Remark T (x, y): Student x likes cuisine y Domain of x: all students at your school Domain of y: all cuisines a) T (AbdallahHussein, Japanese) Answer: Abdallah Hussein does not like Japanese cuisine b) x T (x, Korean) xt (x, Mexican) Answer: Some students at our school like Korean cuisine and all students at our school like Mexican cuisine c) y (T (MoniqueArsenault, y) T (JayJohnson, y)) Answer: There exists some cuisines which Monique or Jay like them Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 5 / 20
6 Exercise 7 (cont...) Express sentences by simple English sentence Remark T (x, y): Student x likes cuisine y Domain of x: all students at your school Domain of y: all cuisines d) x y z ((x z) (T (x, y) T (z, y)) Answer: There is no restaurant that you can find a pair of students which both of them like it. e) x z y (T (x, y) T (z, y)) Answer: There are some pair of students, which for all cuisines, both of them either like it or not f) x z y (T (x, y) T (z, y)) Answer: For every couple of students, there are some cuisines which both of them either like it or not Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 6 / 20
7 Exercise 9 Use quantifiers to express each of these statements Remark L(x, y): x loves y Domain of x and y: all people in the world a) Everybody loves Jerry Answer: x L(x, Jerry) b) Everybody loves somebody Answer: x y L(x, y) c) There is somebody whom everybody loves Answer: y x L(x, y) d) Nobody loves everybody Answer: x y L(x, y) x y L(x, y) De Morgan s law e) There is somebody whom Lydia does not love Answer: y L(Lydia, y) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 7 / 20
8 Exercise 9 (cont...) Use quantifiers to express each of these statements Remark L(x, y): x loves y Domain of x and y: all people in the world f) There is somebody whom no one loves Answer: y x L(x, y) y x L(x, y) De Morgan s law g) There is exactly one person whom everybody loves Answer: y( x L(x, y) ( z w (L(w, z) z = y))) h) There are exactly two people whom Lynn loves Answer: x y (x y L(Lynn, x) L(Lynn, y) z (L(Lynn, z) (z = x z = y))) i) Everyone loves himself or herself Answer: x L(x, x) j) There is someone who loves no one besides himself or herself. Answer: x y (L(x, y) x = y) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 8 / 20
9 Exercise 11 Use quantifiers to express each of these statements Remark S(x): x is a student F (x): x is a faculty member A(x, y): x has asked y a question Domain of x and y: all people associated with your school a) Lois has asked Professor Michaels a question Answer:A(Lois, ProfessorMichaels) b) Every student has asked Professor Gross a question Answer: x (S(x) A(x, ProfessorGross)) c) Every faculty member has either asked Professor Miller a question or been asked a question by Professor Miller Answer: x (F (x) (A(x, ProfessorMiller) A(ProfessorMiller, x))) d) Some student has not asked any faculty member a question Answer: x y (S(x) (F (y) A(x, y))) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 9 / 20
10 Exercise 11(cont...) Use quantifiers to express each of these statements Remark S(x): x is a student F (x): x is a faculty member A(x, y): x has asked y a question Domain of x and y: all people associated with your school e) There is a faculty member who has never been asked a question by student Answer: x y(f (x) (S(y) A(y, x))) f) Some student has asked every faculty member a question Answer: x y (S(x) (F (y) A(x, y))) g) There is a faculty member who has asked every other faculty member a question Answer: x y (F (x) ((F (y) x y) A(x, y))) h) Some student has never been asked a question by a faculty member Answer: x y (S(x) (F (y) A(y, x))) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 10 / 20
11 Exercise 20 Express each of the statements using predicates, quantifiers, logical connectives, and mathematical operators Remark Domain consists of all integers a) The product of two negative integers is positive Answer: x y((x < 0 y < 0) xy > 0) b) The average of two positive integers is positive Answer: x y((x > 0 y > 0) x+y 2 > 0) c) The difference of two negative integers is not necessarily negative Answer: x y((x < 0 y < 0) (x y < 0)) d) The absolute value of the sum of two integers does not exceed the sum of the absolute values of the integers Answer: x y( x + y x + y ) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 11 / 20
12 Exercise 28 Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. a) x y(x 2 = y) Solution: True b) x y(x = y 2 ) Solution: False c) x y(xy = 0) Solution: True d) x y(x + y y + x) Solution: False e) x(x 0 y xy = 1) Solution: True Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 12 / 20
13 Exercise 28 Cont.. Determine the truth value of each of these statements if the domain of each variable consists of all real numbers. f) x y(y 0 xy = 1) Solution: False g) x y(x + y = 1) Solution: True h) x y(x + 2y = 2 2x + 4y = 5) Solution: False i) x y(x + y = 2 2x y = 1) Solution: False j) x y z(z = (x + y)/2) Solution: True Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 13 / 20
14 Exercise 32 Express the negations of each of these statements so that all negation symbols immediately precede predicates a) z y xt (x, y, z) Answer: z y xt (x, y, z) z y xt (x, y, z) z y xt (x, y, z) z y x T (x, y, z) b) x yp(x, y) x yq(x, y) Answer: ( x yp(x, y) x yq(x, y)) x yp(x, y) x yq(x, y) x y P(x, y) x y Q(x, y) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 14 / 20
15 Exercise 32 (cont...) Express the negations of each of these statements so that all negation symbols immediately precede predicates c) x y(q(x, y) Q(y, x)) Answer: x y(q(x, y) Q(y, x)) x y (Q(x, y) Q(y, x)) x y(q(x, y) Q(y, x)) d) y x z(t (x, y, z) Q(x, y)) Answer: y x z(t (x, y, z) Q(x, y)) y x z (T (x, y, z) Q(x, y)) y x z( T (x, y, z) Q(x, y)) Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 15 / 20
16 Exercise 34 Find a common domain for the variable x, y, z for which below statement is true and another domain for which it is false. Statement Answer: x y((x y) z((z = x) (z = y))) TRUE: On the domain D = {a, b} the statement is true. If x = a and y = b (or x = b, y = a), any choice of z must be either equal to x or y. FALSE: With other domains more than two elements, the statement is false. Let D = {a, b, c}, and x = a, y = b. Then z = c, makes above statement truth value, FALSE. Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 16 / 20
17 Exercise 36 Express each of these statements using quantifiers. Then form the negation of the statement so that no negation is to the left of a quantifier. Next, express the negation in simple English. (Do not simply use the phrase It is not the case that. ) a) No one has lost more than one thousand dollars playing the lottery. x y (Lost(x, y) y > 1000) x y(lost(x, y) y > 1000) There is someone who lost 1000$ or more. b) There is a student in this class who has chatted with exactly one other student. x y(y x z(z x (z = y Chatted(x, z))) x y(y x z(z x (z = y Chatted(x, z))) Everybody has either chatted with no one or more than one student. Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 17 / 20
18 Exercise 36 Cont... c) No student in this class has sent to exactly two other students in this class. x y w(y x y w w x z(z x ((z = y z = w) ed(x, z))) x y w(y x y w w x z(z x ((z = y z = w) ed(x, z))) some student in this class has sent to exactly two other students in the class. d) Some student has solved every exercise in this book. x ysolved(x, y) x y Solved(x, y) No student solved all questions Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 18 / 20
19 Exercise 36 Cont... e) No student has solved at least one exercise in every section of this book. x y z(solved(x, z) InSection(z, y)) x y z(solved(x, z) InSection(z, y)) Some student has solved at least one exercise in every section of the book Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 19 / 20
20 Exercise 46 Determine the truth value of the statement x y(x y 2 ) if the domain for the variables consists of a) the positive real numbers. Answer:False, for any positive real number x, then y = x/2 is also a positive real number, but, x y 2. b) the integers. Answer:True, 0 y 2 for any integer y. c) the nonzero real numbers. Answer:True, 1 y 2 for any real number y. Ali Moallemi, Iraj Hedayati COMP232 - Mathematics for Computer Science 20 / 20
Notes. Notes. Introduction. Notes. Propositional Functions. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry.
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.3 1.4 of Rosen cse235@cse.unl.edu Introduction
More informationChapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation
Chapter 1.3 Quantifiers, Predicates, and Validity Reading: 1.3 Next Class: 1.4 1 Motivation Propositional logic allows to translate and prove certain arguments from natural language If John s wallet was
More informationSection 2.2: Introduction to the Logic of Quantified Statements
Section 2.2: Introduction to the Logic of Quantified Statements In this section, we shall continue to examine some of the fundamentals of predicate calculus. Specifically, we shall look at the negations
More information(l) Represent each of the sets A, B and C using bit strings. Then, use bit string representation and bitwise logical operations to find
Fall 2004 Ahmed Elgammal CS 205: Sample Final Exam December 6th, 2004 1. [10 points] Let A = {1, 3, 5, 7, 9}, B = {4, 5, 6, 7, 8}, C = {2, 4, 6, 8, 10}, D = {1, 2, 3} and let the universal set be U = {1,
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Math 24 - Study Guide - Chapter 1 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) Give one number between -8 and 8 that is a negative real
More informationPredicate Logic and Quan0fies
Predicate Logic and Quan0fies Sec0ons 1.4, and 1.5 of Rosen Spring 2017 CSCE 235H Introduc7on to Discrete Structures (Honors) Course web-page: cse.unl.edu/~cse235h All ques7ons: Piazza LaTeX Using the
More informationHomework 1. Due Date: Wednesday 11/26/07 - at the beginning of the lecture
Homework 1 Due Date: Wednesday 11/26/07 - at the beginning of the lecture Problems marked with a [*] are a littlebit harder and count as extra credit. Note 1. For any of the given problems make sure that
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationPropositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus
More informationCSC Discrete Math I, Spring Sets
CSC 125 - Discrete Math I, Spring 2017 Sets Sets A set is well-defined, unordered collection of objects The objects in a set are called the elements, or members, of the set A set is said to contain its
More informationCSE Discrete Structures
CSE 2315 - Discrete Structures Lecture 5: Predicate Logic- Fall 2010 1 Motivation The use of predicates, variables, and quantifiers allows to represent a large number of arguments and expressions in formal
More information2.2 Set Operations. Introduction DEFINITION 1. EXAMPLE 1 The union of the sets {1, 3, 5} and {1, 2, 3} is the set {1, 2, 3, 5}; that is, EXAMPLE 2
2.2 Set Operations 127 2.2 Set Operations Introduction Two, or more, sets can be combined in many different ways. For instance, starting with the set of mathematics majors at your school and the set of
More informationDiscrete structures - CS Fall 2017 Questions for chapter 2.1 and 2.2
Discrete structures - CS1802 - Fall 2017 Questions for chapter 2.1 and 2.2 1. (a) For the following switch diagrams, write the corresponding truth table and decide whether they correspond to one of the
More informationCSE20: Discrete Mathematics
Spring 2018 Summary Last time: Today: Introduction to Basic Set Theory (Vardy) More on sets Connections between sets and logic Reading: Chapter 2 Set Notation A, B, C: sets A = {1, 2, 3}: finite set with
More informationComputation Club: Gödel s theorem
Computation Club: Gödel s theorem The big picture mathematicians do a lot of reasoning and write a lot of proofs formal systems try to capture the ideas of reasoning and proof in a purely mechanical set
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationPractice Final. Read all the problems first before start working on any of them, so you can manage your time wisely
PRINT your name here: Practice Final Print your name immediately on the cover page, as well as each page of the exam, in the space provided. Each time you are caught working on a page without your name
More informationCMPSCI 250: Introduction to Computation. Lecture #7: Quantifiers and Languages 6 February 2012
CMPSCI 250: Introduction to Computation Lecture #7: Quantifiers and Languages 6 February 2012 Quantifiers and Languages Quantifier Definitions Translating Quantifiers Types and the Universe of Discourse
More informationLecture Notes 15 Number systems and logic CSS Data Structures and Object-Oriented Programming Professor Clark F. Olson
Lecture Notes 15 Number systems and logic CSS 501 - Data Structures and Object-Oriented Programming Professor Clark F. Olson Number systems The use of alternative number systems is important in computer
More informationPropositional Calculus. Math Foundations of Computer Science
Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to
More informationPredicate Logic CHAPTER What This Chapter Is About
CHAPTER 14 Predicate Logic We now turn our attention to a generalization of propositional logic, called predicate, or first-order, logic. Predicates are functions of zero or more variables that return
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationMathematical Logic
Mathematical Logic - 2017 Exercises: DPLL and First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia, Rui Zhang, Vincenzo Maltese and Mattia Fumagalli
More informationCITS2211 Discrete Structures Logic
CITS2211 Discrete Structures Logic Unit coordinator: Rachel Cardell-Oliver August 6, 2017 Highlights All men are mortal, Socrates is a man, therefore Socrates is mortal. Reading Chapter 3: Logical Formulas
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationITCS 6150 Intelligent Systems. Lecture 13 First-Order Logic Chapter 8
ITCS 6150 Intelligent Systems Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic can create intelligent behavior But propositional logic is a poor representation for
More informationUniversity of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012
University of Illinois at Chicago Department of Computer Science Final Examination CS 151 Mathematical Foundations of Computer Science Fall 2012 Thursday, October 18, 2012 Name: Email: Print your name
More informationFirst Order Logic and Resolution
Artificial Intelligence CS 6364 Professor Dan Moldovan Section 6 First Order Logic and Resolution First Order Logic (First Order Predicate Calculus) n n There is need to access components of a sentence.
More informationL05 - Negating Statements
L05 - Negating Statements CSci/Math 2112 15 May 2015 1 / 14 Assignment 1 Assignment 1 is now posted Due May 22 at the beginning of class Can work on it in groups, but separate write-up Don t forget your
More informationFor next Tuesday. Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday
For next Tuesday Read chapter 8 No written homework Initial posts due Thursday 1pm and responses due by class time Tuesday Any questions? Program 1 Imperfect Knowledge What issues arise when we don t know
More information1 / 43. Today. Finish Euclid. Bijection/CRT/Isomorphism. Fermat s Little Theorem. Review for Midterm.
1 / 43 Today Finish Euclid. Bijection/CRT/Isomorphism. Fermat s Little Theorem. Review for Midterm. 2 / 43 Finding an inverse? We showed how to efficiently tell if there is an inverse. Extend euclid to
More informationIntroduction to Boolean logic and Logical Gates
Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction
More informationCPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM
CPSC 121 Some Sample Questions for the Final Exam Tuesday, April 15, 2014, 8:30AM Name: Student ID: Signature: Section (circle one): George Steve Your signature acknowledges your understanding of and agreement
More informationIntroduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationLecture 9: Predicate Logic. First: Finish Propositional Logic in Haskell. Semantics in Haskell. Syntax In Haskell. CS 181O Spring 2016 Kim Bruce
Lecture 9: Predicate Logic CS 181O Spring 2016 Kim Bruce First: Finish Propositional Logic in Haskell Some slide content taken from Unger and Michaelis Syntax In Haskell data Form = P String Ng Form Cnj
More informationIntroduction to Boolean Algebra
Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems
More informationToday. Finish Euclid. Bijection/CRT/Isomorphism. Review for Midterm.
Today Finish Euclid. Bijection/CRT/Isomorphism. Review for Midterm. Finding an inverse? We showed how to efficiently tell if there is an inverse. Extend euclid to find inverse. Euclid s GCD algorithm.
More informationVibhav Gogate University of Texas, Dallas Artificial Intelligence: CS 4365 First-order Logic
Artificial Intelligence: CS 4365 First-order Logic Vibhav Gogate University of Texas, Dallas First-order Logic Course Outline: Where are we? Introduction and Agents Search, Heuristics and CSPs Adversarial
More informationThe set consisting of all natural numbers that are in A and are in B is the set f1; 3; 5g;
Chapter 5 Set Theory 5.1 Sets and Operations on Sets Preview Activity 1 (Set Operations) Before beginning this section, it would be a good idea to review sets and set notation, including the roster method
More informationToday s Topics. What is a set?
Today s Topics Introduction to set theory What is a set? Set notation Basic set operations What is a set? Definition: A set is an unordered collection of objects Examples: Sets can contain items of mixed
More informationFIVE YEARS OLD. P r o f e s s o r ikobbins B. Stoeckei ol is s h o w n b y the J u n e 1 pig c r o p
/ K j Y- Y -K Y X Y K K Y Y 5 9-7 j < - 8 X Y Z Q X 9 K Y - K Y X K Y Z Y - x - - - - x - - - - 5 -j - - x K K j 9 x - - q z K K - - K & -«x x - q j? x z Q - 8 - x q - - 5 - K K Q Y - - x \ - x j Y 5 x
More information(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1
CS 70 Discrete Mathematics for CS Fall 2000 Wagner MT1 Sol Solutions to Midterm 1 1. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are
More informationModule 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) Lesson 15 Inference in FOL - I 6.2.8 Resolution We have introduced the inference rule Modus Ponens. Now we introduce another inference rule
More informationUnit 2: Accentuate the Negative Name:
Unit 2: Accentuate the Negative Name: 1.1 Using Positive & Negative Numbers Number Sentence A mathematical statement that gives the relationship between two expressions that are composed of numbers and
More informationLecture 5: Predicate Calculus. ffl Predicate Logic ffl The Language ffl Semantics: Structures
Lecture 5: Predicate Calculus ffl Predicate Logic ffl The Language ffl Semantics: Structures 1 Why Predicate Logic? Propositional logic is not powerful enough to express statements such as ffl For every
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationLogic and its Applications
Logic and its Applications Edmund Burke and Eric Foxley PRENTICE HALL London New York Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Contents Preface xiii Propositional logic 1 1.1 Informal introduction
More informationGoing beyond propositional logic
Going beyond propositional logic Consider the following statements: p: Ling took CS245 q: Ling passed CS245 r: Ling failed CS245 Taken literally, these are all atomic statements, and formally they have
More informationObjectives: 1- Bolean Algebra. Eng. Ayman Metwali
Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-
More informationPreliminary Mathematics Extension 1
Phone: (0) 8007 684 Email: info@dc.edu.au Web: dc.edu.au 018 HIGHER SCHOOL CERTIFICATE COURSE MATERIALS Preliminary Mathematics Extension 1 Parametric Equations Term 1 Week 1 Name. Class day and time Teacher
More informationJoint probability distributions
Joint probability distributions Let X and Y be two discrete rv s defined on the sample space S. The joint probability mass function p(x, y) is p(x, y) = P(X = x, Y = y). Note p(x, y) and x y p(x, y) =
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationOperations of Relational Algebra
ITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION JING YANG 2010 FALL Class 11: The Relational Algebra and Relational Calculus (2) 2 Operations of Relational Algebra 1 3 Operations of Relational Algebra (cont
More informationNumber System. Introduction. Natural Numbers (N) Whole Numbers (W) Integers (Z) Prime Numbers (P) Face Value. Place Value
1 Number System Introduction In this chapter, we will study about the number system and number line. We will also learn about the four fundamental operations on whole numbers and their properties. Natural
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationPractice Problems: All Computer Science majors are people. Some computer science majors are logical thinkers. Some people are logical thinkers.
CSE 240, Fall, 2013 Homework 2 Due, Tuesday September 17. Can turn in class, at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Consider
More informationfor all x, the assertion P(x) is false. there exists x, for which the assertion P(x) is true.
You can t prove a predicate is true because a predicate is not an assertion, you can t prove it is valid as it is not a deduction! If someone asks you to prove P(x), it is not totally clear what they mean.
More informationSection 1.8. Simplifying Expressions
Section 1.8 Simplifying Expressions But, first Commutative property: a + b = b + a; a * b = b * a Associative property: (a + b) + c = a + (b + c) (a * b) * c = a * (b * c) Distributive property: a * (b
More informationConnecting Statements. Today. First there was logic jumping forward.. ..and then proofs and then induction...
Today Review for Midterm. First there was logic... A statement is a true or false. Statements? 3 = 4 1? Statement! 3 = 5? Statement! 3? Not a statement! n = 3? Not a statement...but a predicate. Predicate:
More informationAutomatic Reasoning (Section 8.3)
Automatic Reasoning (Section 8.3) Automatic Reasoning Can reasoning be automated? Yes, for some logics, including first-order logic. We could try to automate natural deduction, but there are many proof
More information3.1 Start Thinking. 3.1 Warm Up. 3.1 Cumulative Review Warm Up. Consider the equation y x.
3.1 Start Thinking Consider the equation y x. Are there any values of x that you cannot substitute into the equation? If so, what are they? Are there any values of y that you cannot obtain as an answer?
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.4 Arguments with Quantified Statements Copyright Cengage Learning. All rights reserved. Arguments
More informationTwo-Color Counters. Adding Integers, Part II. Key Term. Learning Goals. Essential Ideas. Common Core State Standards for Mathematics
Two-Color Counters Adding Integers, Part II Learning Goals In this lesson, you will: Model the addition of integers using two-color counters. Develop a rule for adding integers. Key Term additive inverses
More informationQuestion about Final Exam. CS 416 Artificial Intelligence. What do we like about propositional logic? First-order logic
Page 1 Question about Final Exam CS 416 Artificial Intelligence I will have a date for you by Tuesday of next week. Lecture 13 First-Order Logic Chapter 8 First-order logic We saw how propositional logic
More informationCS112 Friday, September 12, 2008
CS112 Friday, September 12, 2008 Agenda Natural Deduction Questions FOL Translations FOL Interpretations Natural Deduction Questions? First Order Logic Translations Symbolization Key Universe of Discourse
More informationProgramming in C++ PART 2
Lecture 07-2 Programming in C++ PART 2 By Assistant Professor Dr. Ali Kattan 1 The while Loop and do..while loop In the previous lecture we studied the for Loop in C++. In this lecture we will cover iteration
More informationFirst-Order Logic Syntax
First-Order Logic Syntax Reading: Chapter 8, 9.1-9.2, 9.5.1-9.5.5 FOL Syntax and Semantics read: 8.1-8.2 FOL Knowledge Engineering read: 8.3-8.5 FOL Inference read: Chapter 9.1-9.2, 9.5.1-9.5.5 (Please
More informationFirst Order Logic Part 1
First Order Logic Part 1 Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [Based on slides from Burr Settles and Jerry Zhu] slide 1 Problems with propositional
More informationCOMP Logic for Computer Scientists. Lecture 23
COMP 1002 Logic for Computer cientists Lecture 23 B 5 2 J Admin stuff Assignment 3 extension Because of the power outage, assignment 3 now due on Tuesday, March 14 (also 7pm) Assignment 4 to be posted
More informationAnimation Curves and Splines 2
Animation Curves and Splines 2 Animation Homework Set up Thursday a simple avatar E.g. cube/sphere (or square/circle if 2D) Specify some key frames (positions/orientations) Associate Animation a time with
More informationCMPS 277 Principles of Database Systems. https://courses.soe.ucsc.edu/courses/cmps277/fall11/01. Lecture #3
CMPS 277 Principles of Database Systems https://courses.soe.ucsc.edu/courses/cmps277/fall11/01 Lecture #3 1 Summary of Lectures #1 and #2 Codd s Relational Model based on the concept of a relation (table)
More informationPartial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives
In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really
More informationComputer Engineering Chapter 3 Boolean Algebra
Computer Engineering Chapter 3 Boolean Algebra Hiroaki Kobayashi 5/30/2011 Ver. 06102011 5/30/2011 Computer Engineering 1 Agenda in Chapter 3 What is Boolean Algebra Basic Boolean/Logical Operations (Operators)
More informationMy dear students, Believe in yourselves. Believe in your abilities. You can DO this! -Dr. M
1/29 2/22 3/12 4/8 5/9 6/20 otal/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. You must show all work, or risk losing credit. Be sure to answer
More information4 Operations On Data 4.1. Foundations of Computer Science Cengage Learning
4 Operations On Data 4.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: List the three categories of operations performed on data.
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
More information-t:ma. u V:. 1! *VV; jf >*4: t i f n - v i ' ONABI E :VISITd:Rs ; 8 A EASTBOURNE, SAT. 5? -tesiste- COLLEGE. D ressm aker.
\ [ «* 33 3 5 «*» \ *? ^V- *VV >*4 J & & V! V Q Y x - X 8 - - 5 ( J 8 V Y X^ * V * V * ( ) ( --------- x () x J ( * -) V - V Y Y 8! -) Y Y Y8 ( - ) > Y - 8 Y - x x -- x ( ) 7 6 3 - Q V 4 6 8 V
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationAlgebra. Chapter 4: FUNCTIONS. Name: Teacher: Pd:
Algebra Chapter 4: FUNCTIONS Name: Teacher: Pd: Table of Contents Day1: Chapter 4-1: Relations SWBAT: (1) Identify the domain and range of relations and functions (2) Match simple graphs with situations
More informationCPSC 121: Models of Computation. Module 5: Predicate Logic
CPSC 121: Models of Computation Module 5: Predicate Logic Module 5: Predicate Logic Midterm 1: Friday February 9 th, 17:00 to 18:15 A to C (by last name): room DMP 310 D to K: room MATH 100 L to P: room
More informationPHIL 240, Introduction to Logic, Sections Fall 2011 FINAL EXAM 14 December Name (5 points): Section (5 points):
Section I True / False questions (2 points each) 1. TRUE Any argument that is sound is also valid. 2. FALSE_ If the premises of an argument are all true, then that argument is sound. 3. TRUE Every universal
More informationSlide 1 / 96. Linear Relations and Functions
Slide 1 / 96 Linear Relations and Functions Slide 2 / 96 Scatter Plots Table of Contents Step, Absolute Value, Piecewise, Identity, and Constant Functions Graphing Inequalities Slide 3 / 96 Scatter Plots
More informationMathematical Logic Part Two
Mathematical Logic Part Two Recap from Last Time Recap So Far A propositional variable is a variable that is either true or false. The propositional connectives are as follows: Negation: p Conjunction:
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationLECTURE 2 An Introduction to Boolean Algebra
IST 210: Boot Camp Ritendra Datta LECTURE 2 An Introduction to Boolean Algebra 2.1. Outline of Lecture Fundamentals Negation, Conjunction, and Disjunction Laws of Boolean Algebra Constructing Truth Tables
More informationCS February 17
Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)
More informationChapter 3 Boolean Algebra
Computer Engineering Chapter 3 Boolean Algebra Hiroaki Kobayashi 5/19/2008 5/19/2008 1 Agenda in Chapter 3 What is Boolean Algebra Basic Boolean/Logical Operations (Operators) Truth Table to Describe Logical
More informationUnit 1 Calendar. 9/15 Review 1.1, 1.2, 1.3, 1.4, 1.6, 1.7 9/17 Unit 1 Test
Unit 1 Calendar Day Date Topic Day 1 August 31 st 8/31 Day 2 September 2 nd Day 3 September 4 th Day 4 September 9 th Day 5 September 11 th 9/2 9/4 9/9 9/11 WELCOME! Introductions Social Media Statistics
More informationFor fine ti.ito vvt* have hcen in IS PUBLISHED EVERY. OF LOWELL. n t m r n T i l t " ^ n a i I Howk & White, CAPITAL, ,000.
G G 7 87 - G G * - -» *» - - -8 6 8 ( - * - - - [- -- ( G - ( X * ( - --» - ( - - G» # - - - x- G»»» * 6 q q 6» - * 6 76 G» q 6 * - Q * /» q ** - X - * (( G» - * * * 8 8» * * X - - - (»-» * - - G - - G
More informationSpring 2018 CSE191 Midterm Exam I
Plagiarism of any sort on this exam will result in you being given an F in the course. In addition, a request will be made to have you expelled from the university. For each question, circle the correct
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.8 Application: Algorithms Copyright Cengage Learning. All rights reserved. Application:
More informationIE 521 Convex Optimization
Lecture 4: 5th February 2019 Outline 1 / 23 Which function is different from others? Figure: Functions 2 / 23 Definition of Convex Function Definition. A function f (x) : R n R is convex if (i) dom(f )
More informationMath 213 Calculus III Practice Exam 2 Solutions Fall 2002
Math 13 Calculus III Practice Exam Solutions Fall 00 1. Let g(x, y, z) = e (x+y) + z (x + y). (a) What is the instantaneous rate of change of g at the point (,, 1) in the direction of the origin? We want
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 PRINT Your Name:, (last) READ AND SIGN The Honor Code: As a member of the UC Berkeley community, I act with honesty,
More informationCSE 311: Foundations of Computing. Lecture 8: Predicate Logic Proofs
CSE 311: Foundations of Computing Lecture 8: Predicate Logic Proofs Last class: Propositional Inference Rules Two inference rules per binary connective, one to eliminate it and one to introduce it Elim
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More information