George Boole English Mathematician

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

1.3 Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Data and Knowledge Representation Lecture 2 Qing Zeng, Ph.D.
Discrete Mathematics Math 6A Instructor: M. Welling.
Discrete Structures Chapter 3: The Logic of Quantified Statements
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Predicates and Quantifiers
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
Discrete Maths Objective to introduce predicate logic (also called the predicate calculus) , Semester 2, Predicate Logic 1.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
© Jalal Kawash 2010Peeking into Computer Science George Boole English Mathematician His The Mathematical Analysis of Logic, 1848 is the first.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Nested Quantifiers Section 1.5.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Discrete Mathematics CS 2610 August 22, Agenda Last class Propositional logic Logical equivalences This week Predicate logic & rules of inference.
Logical Operations – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Logical Operations Reading: Kolman, Section 2.1.
Discrete Structures – CNS 2300
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
CSci 2011 Recap ^Propositional operation summary not andorconditionalBi-conditional pq ppqqpqpqpqpqpqpqpqpq TTFFTTTT TFFTFTFF FTTFFTTF FFTTFFTT.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Lecture 1.2: Equivalences, and Predicate Logic
Predicates and Quantified Statements I
CSNB 143 Discrete Mathematical Structures
Chapter 3 The Logic of Quantified Statements
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Predicates & Quantifiers
The function of knowledge representation scheme is
2.1 Propositions and Logical Operations
4-1 LOGIC OPERATIONS In Chapter 3 we discussed the fact that data inside a computer is stored as patterns of bits. Logic operations refer to those operations.
CMSC Discrete Structures
Chapter 1 The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
1.4 Predicates and Quantifiers
Copyright © Cengage Learning. All rights reserved.
CHAPTER 1: LOGICS AND PROOF
Computer Science 210 Computer Organization
Mathematics for Computer Science MIT 6.042J/18.062J
Introduction to Predicates and Quantified Statements I
Introduction To Robot Decision Making
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Objective Translate verbal sentences into equations and inequalities.
Algebra: Variables and Expressions
Predicates and Quantifiers
Lecture 1.3: Predicate Logic
Conditionals.
Presentation transcript:

George Boole 1815-1864 English Mathematician His The Mathematical Analysis of Logic, 1848 is the first contribution to symbolic logic In this book he introduced what is today called Boolean Logic (or Algebra) JT: Boolean (True, False outcome) George Boole

Peeking into Computer Science Logic Peeking into Computer Science

Mandatory: Chapter 2 – Section 2.2 Reading Assignment

Predicate Logic

Objectives By the end of this section, you will be able to: Define a predicate Understand universal and existential quantifiers Use quantification to convert a predicate to a proposition Work with quantifier equivalence rules Objectives

Proposition: a declarative sentence that is either true or false, but not both.1 Example propositions 3 > 4 4 > 3 JT: True/False clear cut 1) “Peeking into Computer Science” (2nd Ed) Kawash J. JT’s Extra: Review

JT’s Extra: New Material Predicate: a proposition where the value of a variable is unknown. Example predicate P(X): X > 0 JT: True/False “it depends” JT’s Extra: New Material

Predicate Logic X > 3 X is taller than Y These are predicates Is not a proposition X is taller than Y These are predicates P(X): X > 3 Q(X,Y): X is taller than Y Predicate Logic

Quantification Predicates can be made propositions by Substituting values for the variables P(X): X > 3, P(4) is true, P(-1) is false Q(X,Y): X is taller than Y, Q(Debra, Doug) OR Binding the variable with a quantifier Universal Quantifier x P(x) P(x) is true for all x in the universe of discourse Existential Quantifier x P(x) P(x) is true for at least one x in the universe of discourse Quantification

Quantification Examples Universe of discourse: this 203 class P(x): x is female x P(x) : All students in this class are female x P(x) There is at least one student in this class who is female Quantification Examples

Quantification Examples Universe of discourse: all earth creatures M(x): x is a monkey F(x): x lives in a forest Express: some monkeys live in forests x (M(x)  F(x)) : At least some monkey lives in a forest Quantification Examples

Quantification Examples Universe of discourse: all earth creatures M(x): x is a monkey F(x): x lives in a forest Express: all monkeys live in forests x (M(x)  F(x)) : All earth creatures are monkeys and live in forests x (M(x) → F(x)) : From all creatures if x is a monkey, then x lives in a forest X Quantification Examples

Quantifier Equivalence x P(x) is equivalent to  [x  P(x)] All monkeys are black There is no one monkey which is not black x P(x) is equivalent to  [x  P(x)] There is at least one student who likes the course It is not the case that all students do not like the course Quantifier Equivalence