L05 - Negating Statements
|
|
- Caitlin Tate
- 5 years ago
- Views:
Transcription
1 L05 - Negating Statements CSci/Math May / 14
2 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 name, B00# on first page; staple Questions in the right order Points for each question are in the margin 2 / 14
3 More on Quantifiers and Implications Instead of! you can always use, it only emphasizes that there is exactly one (similar to instead of ) 3 / 14
4 More on Quantifiers and Implications Instead of! you can always use, it only emphasizes that there is exactly one (similar to instead of ) Unless asked to, do not use symbolic shorthand on assignments or tests! Use full sentences. 3 / 14
5 More on Quantifiers and Implications Instead of! you can always use, it only emphasizes that there is exactly one (similar to instead of ) Unless asked to, do not use symbolic shorthand on assignments or tests! Use full sentences. Symbolic shorthand is very useful though for scrap work! 3 / 14
6 More on Quantifiers and Implications Instead of! you can always use, it only emphasizes that there is exactly one (similar to instead of ) Unless asked to, do not use symbolic shorthand on assignments or tests! Use full sentences. Symbolic shorthand is very useful though for scrap work! For some implications P Q the truth value depends on a variable x. These are interpreted as x A, P Q. 3 / 14
7 Pop Quiz! Don t forget to put your name on your quiz! Question 1 According to DeMorgan s Laws, we have (P Q) =... Question 2 The only case in which P Q is false is if... Therefore (P Q) =... 4 / 14
8 English to Symbolic Questions about Section 2.9 (Translating English to Symbolic Language)? 5 / 14
9 Negations Why do we need to know how to negate a statement? The contrapositive of an implication is Q P. 6 / 14
10 Negations Why do we need to know how to negate a statement? The contrapositive of an implication is Q P. To find examples showing that a statement is false (a counterexample). 6 / 14
11 Negations Why do we need to know how to negate a statement? The contrapositive of an implication is Q P. To find examples showing that a statement is false (a counterexample). P Q = P Q 6 / 14
12 Negations Why do we need to know how to negate a statement? The contrapositive of an implication is Q P. To find examples showing that a statement is false (a counterexample). P Q = P Q A lot of mistakes are made negating statements - pay attention to details and practice! 6 / 14
13 Negation: Truth Tables One way to negate a statement is to look at its truth table 7 / 14
14 Negation: Truth Tables One way to negate a statement is to look at its truth table Flip all entries 7 / 14
15 Negation: Truth Tables One way to negate a statement is to look at its truth table Flip all entries Do the disjunctive normal form of the negated statement 7 / 14
16 Negations: And, Or, Xor (P Q) = P Q (DeMorgan s Law) (P Q) = P Q (DeMorgan s Law) (P Q) = (P Q) ( P Q) 8 / 14
17 Negations: And, Or, Xor Example 1 Negate each of the following statements. 9 / 14
18 Negations: And, Or, Xor Example 1 Negate each of the following statements. (a) I like reading and playing games. 9 / 14
19 Negations: And, Or, Xor Example 1 Negate each of the following statements. (a) I like reading and playing games. (b) Either Pearl or Bob was in the ballroom, but not both. 9 / 14
20 Negations: And, Or, Xor Example 1 Negate each of the following statements. (a) I like reading and playing games. (b) Either Pearl or Bob was in the ballroom, but not both. (c) I don t like being sick or tired. 9 / 14
21 Negations: And, Or, Xor Example 1 Negate each of the following statements. (a) I like reading and playing games. (b) Either Pearl or Bob was in the ballroom, but not both. (c) I don t like being sick or tired. (d) The integer x is divisible by 2 and by 3. 9 / 14
22 Negations: And, Or, Xor Example 1 Negate each of the following statements. (a) I like reading and playing games. (b) Either Pearl or Bob was in the ballroom, but not both. (c) I don t like being sick or tired. (d) The integer x is divisible by 2 and by 3. (e) At least one of the integers x and y is even. 9 / 14
23 Negation: Quantifiers - there is not a single one satisfying the statement, thus for all ( ) the statement is false 10 / 14
24 Negation: Quantifiers - there is not a single one satisfying the statement, thus for all ( ) the statement is false ( x S, P(x)) = x S, P(x) 10 / 14
25 Negation: Quantifiers - there is not a single one satisfying the statement, thus for all ( ) the statement is false ( x S, P(x)) = x S, P(x) - there is at least one ( ) for which the statement isn t true 10 / 14
26 Negation: Quantifiers - there is not a single one satisfying the statement, thus for all ( ) the statement is false ( x S, P(x)) = x S, P(x) - there is at least one ( ) for which the statement isn t true ( x S, P(x)) = x S, P(x) 10 / 14
27 Negation: Quantifiers Example 2 Negate the following: 11 / 14
28 Negation: Quantifiers Example 2 Negate the following: (a) Some subsets of N have 5 elements. 11 / 14
29 Negation: Quantifiers Example 2 Negate the following: (a) Some subsets of N have 5 elements. (b) For every real number x there is a real number y for which y 3 = x. 11 / 14
30 Negation: Quantifiers Example 2 Negate the following: (a) Some subsets of N have 5 elements. (b) For every real number x there is a real number y for which y 3 = x. (c) For any two integers x and y, x y is a rational number. 11 / 14
31 Negation: Quantifiers Example 2 Negate the following: (a) Some subsets of N have 5 elements. (b) For every real number x there is a real number y for which y 3 = x. (c) For any two integers x and y, x y is a rational number. (d) There is an integer a such that for all integers b we have a + b = b. 11 / 14
32 Negation: Quantifiers Example 2 Negate the following: (a) Some subsets of N have 5 elements. (b) For every real number x there is a real number y for which y 3 = x. (c) For any two integers x and y, x y is a rational number. (d) There is an integer a such that for all integers b we have a + b = b. (e) For every integer a there exists an integer b such that a + b = / 14
33 Negation: Implication (P Q) = P Q 12 / 14
34 Negation: Implication Example 3 Negate the following: 13 / 14
35 Negation: Implication Example 3 Negate the following: (a) If Pearl was in the ballroom, then so was Venom. 13 / 14
36 Negation: Implication Example 3 Negate the following: (a) If Pearl was in the ballroom, then so was Venom. (b) If a number is divisible by 6, then it is even. 13 / 14
37 Negation: Implication Example 3 Negate the following: (a) If Pearl was in the ballroom, then so was Venom. (b) If a number is divisible by 6, then it is even. (c) If you came to class today, then you were up before 10:30am. 13 / 14
38 Negation: Implication Example 3 Negate the following: (a) If Pearl was in the ballroom, then so was Venom. (b) If a number is divisible by 6, then it is even. (c) If you came to class today, then you were up before 10:30am. (d) If x Z, then x Z. 13 / 14
39 Negation: Everything combined Example 4 Negate the following: 14 / 14
40 Negation: Everything combined Example 4 Negate the following: (a) If the street is wet, then it rained or there was another water source. 14 / 14
41 Negation: Everything combined Example 4 Negate the following: (a) If the street is wet, then it rained or there was another water source. (b) You came to class an you were either on time or late, but not both. 14 / 14
42 Negation: Everything combined Example 4 Negate the following: (a) If the street is wet, then it rained or there was another water source. (b) You came to class an you were either on time or late, but not both. (c) If for all x A we know that 2x A as well, then either A is empty, or A is infinite, but not both. 14 / 14
43 Negation: Everything combined Example 4 Negate the following: (a) If the street is wet, then it rained or there was another water source. (b) You came to class an you were either on time or late, but not both. (c) If for all x A we know that 2x A as well, then either A is empty, or A is infinite, but not both. (d) If A = Z, then for all x A we know that 2x A as well. 14 / 14
44 Negation: Everything combined Example 4 Negate the following: (a) If the street is wet, then it rained or there was another water source. (b) You came to class an you were either on time or late, but not both. (c) If for all x A we know that 2x A as well, then either A is empty, or A is infinite, but not both. (d) If A = Z, then for all x A we know that 2x A as well. (e) Every integer that is not odd is even. 14 / 14
CSC 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 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 informationChapter 2 Homework Vocabulary Inductive reasoning - Conjecture - Counterexample - Conditional - Hypothesis - Conclusion - Truth value - Negation -
Chapter 2 Homework Vocabulary Inductive reasoning - Conjecture - Counterexample - Conditional - Hypothesis - Conclusion - Truth value - Negation - Converse - Inverse - Contrapositive - Equivalent statements
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 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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
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 informationDefinition MATH Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Benjamin V.C. Collins James A. Swenson s and undefined terms The importance of definition s matter! may be more important in Discrete Math than in any math course that you have had previously.
More informationCS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
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 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 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 informationCS103 Spring 2018 Mathematical Vocabulary
CS103 Spring 2018 Mathematical Vocabulary You keep using that word. I do not think it means what you think it means. - Inigo Montoya, from The Princess Bride Consider the humble while loop in most programming
More informationCOMP Intro to Logic for Computer Scientists. Lecture 2
COMP 1002 Intro to Logic for Computer Scientists Lecture 2 B 5 2 J Language of logic: building blocks Proposition: A sentence that can be true or false. A: It is raining in St. John s right now. B: 2+2=7
More informationCS 3512, Spring Instructor: Doug Dunham. Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010
CS 3512, Spring 2011 Instructor: Doug Dunham Textbook: James L. Hein, Discrete Structures, Logic, and Computability, 3rd Ed. Jones and Barlett, 2010 Prerequisites: Calc I, CS2511 Rough course outline:
More informationSET DEFINITION 1 elements members
SETS SET DEFINITION 1 Unordered collection of objects, called elements or members of the set. Said to contain its elements. We write a A to denote that a is an element of the set A. The notation a A denotes
More informationSummary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationCS 512, Spring 2017: Take-Home End-of-Term Examination
CS 512, Spring 2017: Take-Home End-of-Term Examination Out: Tuesday, 9 May 2017, 12:00 noon Due: Wednesday, 10 May 2017, by 11:59 am Turn in your solutions electronically, as a single PDF file, by placing
More information2. Sets. 2.1&2.2: Sets and Subsets. Combining Sets. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2014 1 2. Sets 2.1&2.2: Sets and Subsets. Combining Sets. Set Terminology and Notation DEFINITIONS: Set is well-defined collection of objects. Elements are objects or members
More informationPropositional Logic:
CS2209A 2017 Applied Logic for Computer Science Lecture 2 Propositional Logic: Syntax, semantics, truth table Instructor: Yu Zhen Xie Language of logic: building blocks Proposition: A sentence that can
More informationSets. Margaret M. Fleck. 15 September 2010
Sets Margaret M. Fleck 15 September 2010 These notes cover set notation, operations on sets, and how to prove claims involving sets (Rosen sections 2.1 and 2.2). They also cover some logic subtleties that
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 informationLogical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.
Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens
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 informationBinary Values. CSE 410 Lecture 02
Binary Values CSE 410 Lecture 02 Lecture Outline Binary Decimal, Binary, and Hexadecimal Integers Why Place Value Representation Boolean Algebra 2 First: Why Binary? Electronic implementation Easy to store
More informationMATH 2100 / 2105 / 2350 EXAM 1
MATH 2100 / 2105 / 2350 EXAM 1 Name: Wednesday, February 20 Instructions: Please write your work neatly and clearly. You must explain all reasoning. It is not sufficient to just write the correct answer.
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 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 informationCopyright 2006 Melanie Butler Chapter 1: Review. Chapter 1: Review
QUIZ AND TEST INFORMATION: The material in this chapter is on Quiz 1 and Exam 1. You should complete at least one attempt of Quiz 1 before taking Exam 1. This material is also on the final exam. TEXT INFORMATION:
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationGuidelines for Writing Mathematical Proofs
Appendix A Guidelines for Writing Mathematical Proofs One of the most important forms of mathematical writing is writing mathematical proofs. The writing of mathematical proofs is an acquired skill and
More informationLesson 38: Conditionals #2 (W11D3)
Lesson 38: Conditionals #2 (W11D3) Balboa High School Michael Ferraro October 28, 2015 1 / 61 Do Now In Lesson38/DoNow.java, write a method called isdivisiblebyfour() that takes an int returns the boolean
More informationPlease try all of the TRY THIS problems throughout this document. When done, do the following:
AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School nrabadi@nredlearn.org One great resource for any course is YouTube. Please watch videos to help you with any of the summer
More informationMath Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can
More information1. Divide by using long division. (8x 3 + 6x 2 + 7) (x + 2)
Bellwork 0-7-4. Divide by using long division. (8x + 6x 2 + 7) (x + 2) Synthetic division is a shorthand method of dividing a polynomial by a linear binomial by using only the coefficients. For synthetic
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 informationComputer Organization and Levels of Abstraction
Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean
More informationStrategies for Proofs
Strategies for Proofs Landscape with House and Ploughman Van Gogh Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois 1 Goals of this lecture A bit more logic Reviewing Implication
More information1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
More informationIntroduction to Software Testing Chapter 3, Sec# 1 & 2 Logic Coverage
Introduction to Software Testing Chapter 3, Sec# 1 & 2 Logic Coverage Paul Ammann & Jeff Offutt http://www.cs.gmu.edu/~offutt/soft waretest/ Ch. 3 : Logic Coverage Four Structures for Modeling Software
More information(iv) The square root of an integer is a rational number. (viii) There is an infinite number of natural numbers.
A statement is a sentence that is either always true or always false. Examples 2 ` 2 4. Suppose x 2 2. henx is not an integer. All cats are gray. I have a gray cat. Non-examples x is an odd number. Let
More information9/19/12. Why Study Discrete Math? What is discrete? Sets (Rosen, Chapter 2) can be described by discrete math TOPICS
What is discrete? Sets (Rosen, Chapter 2) TOPICS Discrete math Set Definition Set Operations Tuples Consisting of distinct or unconnected elements, not continuous (calculus) Helps us in Computer Science
More informationMath 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday)
Math 55 - Spring 04 - Lecture notes # 1 - Jan 20 (Tuesday) Name, class, URL (www.cs.berkeley.edu/~demmel/ma55) on board Head TA Mike West speaks on bureaucracy Advertise CS 70 (T Th 2-3:30) as an "honors"
More informationGeometry Lesson 2.1 Conditional Statements. September 4, 2007
Geometry Lesson 2.1 Conditional Statements September 4, 2007 Objectives Students will be able to: Define: conditional statement, hypothesis, conclusion, converse, inverse, contrapositive, equivalent statements
More information7/25/2016. Example: Addition of Unsigned Bit Patterns. ECE 120: Introduction to Computing. Adding Two Non-Negative Patterns Can Overflow
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing 2 s Complement Overflow and Boolean Logic Example: ddition of Unsigned Bit Patterns
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 informationNotes. 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 informationLecture Transcript While and Do While Statements in C++
Lecture Transcript While and Do While Statements in C++ Hello and welcome back. In this lecture we are going to look at the while and do...while iteration statements in C++. Here is a quick recap of some
More information4-1 Reasoning and Proof in Geometry
4-1 Reasoning and Proof in Geometry Inductive reasoning Deductive reasoning onditional statement We can use symbols to represent our statements: if p, then p p implies p only if, if p hypothesis conclusion
More information8.3 Common Loop Patterns
Lecture 17 Topics: Chapter 8. Loop Structures and Booleans 8.3 (Continues) nested loops 8.4. Computing with booleans 8.5 Other common structures: post-test, loop and half. 1 8.3 Common Loop Patterns Nested
More informationBoolean Algebra A B A AND B = A*B A B A OR B = A+B
Boolean Algebra Algebra is the branch of mathematics that deals with variables. Variables represent unknown values and usually can stand for any real number. Because computers use only 2 numbers as we
More informationCS 31: Introduction to Computer Systems. 03: Binary Arithmetic January 29
CS 31: Introduction to Computer Systems 03: Binary Arithmetic January 29 WiCS! Swarthmore Women in Computer Science Slide 2 Today Binary Arithmetic Unsigned addition Subtraction Representation Signed magnitude
More informationCMSC 201 Fall 2016 Lab 09 Advanced Debugging
CMSC 201 Fall 2016 Lab 09 Advanced Debugging Assignment: Lab 09 Advanced Debugging Due Date: During discussion Value: 10 points Part 1: Introduction to Errors Throughout this semester, we have been working
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 informationMath 187 Sample Test II Questions
Math 187 Sample Test II Questions Dr. Holmes October 2, 2008 These are sample questions of kinds which might appear on Test II. There is no guarantee that all questions on the test will look like these!
More information2.1 Sets 2.2 Set Operations
CSC2510 Theoretical Foundations of Computer Science 2.1 Sets 2.2 Set Operations Introduction to Set Theory A set is a structure, representing an unordered collection (group, plurality) of zero or more
More informationIntroduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt
Introduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt www.introsoftwaretesting.com Ch. 3 : Logic Coverage Four Structures for Modeling Software Graphs Logic Input Space
More informationIntroduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt
Introduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt http://www.cs.gmu.edu/~offutt/softwaretest/ Ch. 3 : Logic Coverage Four Structures for Modeling Software Graphs
More informationCOMS 1003 Fall Introduction to Computer Programming in C. Bits, Boolean Logic & Discrete Math. September 13 th
COMS 1003 Fall 2005 Introduction to Computer Programming in C Bits, Boolean Logic & Discrete Math September 13 th Hello World! Logistics See the website: http://www.cs.columbia.edu/~locasto/ Course Web
More informationMathematical Logic Part Two
Mathematical Logic Part Two A Note on the Career Fair 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:
More informationETHERNET IRRIGATION CONTROLLER. Irrigation Caddy Model: ICEthS1. User Manual and Installation Instructions
ETHERNET IRRIGATION CONTROLLER Irrigation Caddy Model: ICEthS1 User Manual and Installation Instructions I R R I G A T I O N C A D D Y M O D E L : I C E T H S 1 User Manual and Installation Instructions
More informationGeometry Note-Sheet Overview
Geometry Note-Sheet Overview 1. Logic a. A mathematical sentence is a sentence that states a fact or contains a complete idea. Open sentence it is blue x+3 Contains variables Cannot assign a truth variable
More informationComputer Organization and Levels of Abstraction
Computer Organization and Levels of Abstraction Announcements PS8 Due today PS9 Due July 22 Sound Lab tonight bring machines and headphones! Binary Search Today Review of binary floating point notation
More informationSets. {1, 2, 3, Calvin}.
ets 2-24-2007 Roughly speaking, a set is a collection of objects. he objects are called the members or the elements of the set. et theory is the basis for mathematics, and there are a number of axiom systems
More informationMathematical Logic Part Two
Mathematical Logic Part Two A Note on the Career Fair 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:
More informationHonors Geometry Chapter 2 Test * Required
Honors Geometry Chapter 2 Test * Required Matching Vocabulary Section 1. Compound with the word "and" 2. negates both the hypothesis and conclusion 3. "if-then" s https://docs.google.com/a/evsck12.com/forms/d/1tjnuxtlrl3_kjnv3uxiay6oe-mvaxf7pieqvisunsye/edit
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 informationSECTION 1.5: LOGIC PROGRAMMING
SECTION 1.5: LOGIC PROGRAMMING William DeMeo williamdemeo@gmail.com University of South Carolina February 7, 2013 SPECIFYING FACTS AND RULES We populate our Prolog database with facts using predicates,
More informationLet A(x) be x is an element of A, and B(x) be x is an element of B.
Homework 6. CSE 240, Fall, 2014 Due, Tuesday October 28. Can turn in at the beginning of class, or earlier in the mailbox labelled Pless in Bryan Hall, room 509c. Practice Problems: 1. Given two arbitrary
More informationCISC-124. Casting. // this would fail because we can t assign a double value to an int // variable
CISC-124 20180122 Today we looked at casting, conditionals and loops. Casting Casting is a simple method for converting one type of number to another, when the original type cannot be simply assigned to
More informationSet and Set Operations
Set and Set Operations Introduction A set is a collection of objects. The objects in a set are called elements of the set. A well defined set is a set in which we know for sure if an element belongs to
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 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 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 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 informationInfinity and Uncountability. Countable Countably infinite. Enumeration
Infinity and Uncountability. Countable Countably infinite. Enumeration How big is the set of reals or the set of integers? Infinite! Is one bigger or smaller? Same size? Same number? Make a function f
More informationx 2 + 3, r 4(x) = x2 1
Math 121 (Lesieutre); 4.2: Rational functions; September 1, 2017 1. What is a rational function? It s a function of the form p(x), where p(x) and q(x) are both polynomials. In other words, q(x) something
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 informationGrade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
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 informationSyntax of Eiffel: a Brief Overview
Syntax of Eiffel: a Brief Overview EECS3311 A: Software Design Fall 2018 CHEN-WEI WANG Escape Sequences Escape sequences are special characters to be placed in your program text. In Java, an escape sequence
More informationSets. Sets. Examples. 5 2 {2, 3, 5} 2, 3 2 {2, 3, 5} 1 /2 {2, 3, 5}
Sets We won t spend much time on the material from this and the next two chapters, Functions and Inverse Functions. That s because these three chapters are mostly a review of some of the math that s a
More informationNP and computational intractability. Kleinberg and Tardos, chapter 8
NP and computational intractability Kleinberg and Tardos, chapter 8 1 Major Transition So far we have studied certain algorithmic patterns Greedy, Divide and conquer, Dynamic programming to develop efficient
More information4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)
COP 273, Winter 26 Exercises 2 - combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic
More informationCSC 101: Lab #5 Prelab Boolean Logic Practice Due Date: 5:00pm, day after lab session
Name: Email Username: Lab Date and Time: CSC 101: Lab #5 Prelab Boolean Logic Practice Due Date: 5:00pm, day after lab session Purpose: The purpose of this pre-lab is to provide you with hands-on experience
More informationCommands, and Queries, and Features. Syntax of Eiffel: a Brief Overview. Escape Sequences. Naming Conventions
Commands, and Queries, and Features Syntax of Eiffel: a Brief Overview EECS3311 A: Software Design Fall 2018 CHEN-WEI WANG In a Java class: Attributes: Data Mutators: Methods that change attributes without
More informationPropositional Logic. Application of Propositional logic
DISCRETE STRUCTURE Propositional Logic Application of Propositional logic Propositional logic is the study of propositions (true or false statements) and ways of combining them (logical operators) to
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 informationThis Lecture. We will first introduce some basic set theory before we do counting. Basic Definitions. Operations on Sets.
Sets A B C This Lecture We will first introduce some basic set theory before we do counting. Basic Definitions Operations on Sets Set Identities Defining Sets Definition: A set is an unordered collection
More informationDesigning Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A
EEC 16B esigning Information evices and ystems II pring 2018 J. Roychowdhury and M. Maharbiz iscussion 1A 1 igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)
More informationFondamenti della Programmazione: Metodi Evoluti. Lezione 5: Invariants and Logic
Fondamenti della Programmazione: Metodi Evoluti Prof. Enrico Nardelli Lezione 5: Invariants and Logic versione originale: http://touch.ethz.ch Reminder: contracts Associated with an individual feature:
More informationCS100: DISCRETE STRUCTURES
CS: DISCRETE STRUCTURES Computer Science Department Lecture : Set and Sets Operations (Ch2) Lecture Contents 2 Sets Definition. Some Important Sets. Notation used to describe membership in sets. How to
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 informationTaibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103. Chapter 2. Sets
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 2 Sets Slides are adopted from Discrete Mathematics and It's Applications Kenneth H.
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 information1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns
Lecture 9: Propositional Logic I Philosophy 130 23 & 28 October 2014 O Rourke I. Administrative A. Problem sets due Thursday, 30 October B. Midterm course evaluations C. Questions? II. Logic and Form A.
More informationProblem 1.R1: How Many Bits?
CSC 495 Problem Set 1 Due Tuesday, January 17 Problem 1.R1: How Many Bits? Required Problem Points: 50 points Background When a number is stored in a primitive type, like an int or long variable, it always
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 information9. MATHEMATICIANS ARE FOND OF COLLECTIONS
get the complete book: http://wwwonemathematicalcatorg/getfulltextfullbookhtm 9 MATHEMATICIANS ARE FOND OF COLLECTIONS collections Collections are extremely important in life: when we group together objects
More informationPropositional logic (Ch. 7)
Propositional logic (Ch. 7) Announcements Writing 2 graded - 2 weeks from today to resubmit Complete-state CSP So far we have been looking at incremental search (adding one value at a time) Complete-state
More information