Mathematical Language

Slides:



Advertisements
Similar presentations
1.3 Predicates and Quantifiers
Advertisements

The Logic of Quantified Statements
Chapter 3 Tuple and Domain Relational Calculus. Tuple Relational Calculus.
F22H1 Logic and Proof Week 5 Overview of weeks 5—9 Predicates and Quantifiers.
1 541: Relational Calculus. 2 Relational Calculus  Comes in two flavours: Tuple relational calculus (TRC) and Domain relational calculus (DRC).  Calculus.
Week 1 Chapter 1 + Appendix A Signals carry information Signals are represented by functions Systems transform signals Systems are represented by functions,
A Quick Look at Quantified Statements. Why are Quantified Statements Important? The logical structure of quantified statements provides a basis for the.
School of Computing and Mathematics, University of Huddersfield CAS2545: WEEK 11 LECTURE: n The meaning of Algebraic Specifications TUTORIAL/PRACTICAL:
Relational Calculus. Another Theoretical QL-Relational Calculus n Comes in two flavors: Tuple relational calculus (TRC) and Domain relational calculus.
EECS 20 Lecture 3 (January 22, 2001) Tom Henzinger Sets, Tuples, Functions.
EECS 20 Lecture 7 (January 31, 2001) Tom Henzinger Reactive Systems.
EECS 20 Lecture 2 (January 19, 2001) Tom Henzinger Mathematical Language.
Week 1 1.websitewebsite 2.takehome examtakehome 3.Chapter Appendix A.
Discrete Mathematics Math 6A Instructor: M. Welling.
EECS 20 Lecture 4 (January 24, 2001) Tom Henzinger Block Diagrams.
1.2 – Open Sentences and Graphs
Generalized De Morgan’s Theorem Lecture L5.4 Section 5.1.
Rutgers University Relational Calculus 198:541 Rutgers University.
Adapted from Discrete Math
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
Formal Methods in SE Lecture 20. Agenda 2  Relations in Z Specification Formal Methods in SE.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
Combining Like Terms Terms  Are separated by a sign (- or +)
Theorem Proving Semantic Tableaux CIS548 November 15, 2006.
Thinking Mathematically
1 Sections 1.3 and 1.4 Predicates & Quantifiers. 2 Propositional Functions In a mathematical assertion, such as x < 3, there are two parts: –the subject,
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
CSS342: Quantifiers1 Professor: Munehiro Fukuda. CSS342: Quantifiers2 Review of Propositions Proposition: a statement that is either true or false, but.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
COMP 170 L2 L08: Quantifiers. COMP 170 L2 Outline l Quantifiers: Motivation and Concepts l Quantifiers: Notations and Meaning l Saying things with Quantified.
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.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Basic Definitions of Set Theory Lecture 24 Section 5.1 Fri, Mar 2, 2007.
CSED101 INTRODUCTION TO COMPUTING FUNCTION ( 함수 ) 유환조 Hwanjo Yu.
1 Logic Our ability to state invariants, record preconditions and post- conditions, and the ability to reason about a formal model depend on the logic.
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.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Lecture 1-3: Quantifiers and Predicates. Variables –A variable is a symbol that stands for an individual in a collection or set. –Example, a variable.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Chapter 1 – Part 3 ELEMENTARY LOGIC
EQUATION IN TWO VARIABLES:
Thinking Mathematically
Bool operators and, or, not
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
Relational Calculus Chapter 4, Part B
CSE 311 Foundations of Computing I
SHORTER TRUTH TABLE METHOD OR REDUCTIO-AD-ABSURDUM
CS201: Data Structures and Discrete Mathematics I
Decidability of logical theories
Mathematics for Computer Science MIT 6.042J/18.062J
Introduction to Predicates and Quantified Statements I
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Negations of quantifiers
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
State Machines EECS 20 Lecture 8 (February 2, 2001) Tom Henzinger.
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Decidability of logical theories
CS201: Data Structures and Discrete Mathematics I
Algebra 1 Section 2.4.
Algebra: Variables and Expressions
Variables and Equations
Evaluating Algebraic Expressions
Parts of an Expression EE2b. Identify parts of an expression using mathematical terms (sum, term, product, factor, quotient, coefficient).
Lecture 3 Natural Language Processing
Variables.
Presentation transcript:

Mathematical Language EECS 20 Lecture 2 (January 19, 2001) Tom Henzinger

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } .

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants Variables

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants Variables Operators

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants Variables Operators Quantifiers

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants Variables Operators Quantifiers Definition

Mathematical Language Let Evens = { x | (  y, y  Nats  x = 2· y ) } . Constants Variables Operators Quantifiers Definition

Constants have meaning 20 a certain number Berkeley a certain city false a certain truth value

Variables have no meaning x y0 z’

Operators on numbers number + number Result: number number ! number number = number truth value number  number truth value

Operators on cities merge ( city, city ) Result: city population-of ( city ) number has-a-university ( city ) truth value

Operators on truth values truth value  truth value Result: truth value truth value  truth value truth value ¬ truth value truth value truth value  truth value truth value truth value  truth value truth value

Expressions on constants have meaning 3 + 20 Result: 23 (3! + 2) · 4 32 4  population-of ( Berkeley ) true 4 · 20  4 + 20 false true  false false true  ( 4 + 20 ) not well-formed

Implication true  true Result: true true  false false false  true true false  false true

Expressions on variables have no meaning (3! + y) · 4 x  y Free variables: x y x, y

Quantifiers remove free variables from expressions  x, x = 0  x, x = 0  y, x + 1 = y  x,  y, x + 1 = y  x,  y, x  y  x, x + 7 Result: free x true false free x not well-formed

Every mathematical expression 1. is not well-formed (“type mismatch”), or 2. contains free variables, or 3. is a definition, or 4. has a meaning (e.g., 20, Berkeley, false).

SETS

Set constants { 1, 2, 3 } { Atlanta, Berkeley, Chicago, Detroit } { 1, 2, 3, 4, … }

Set operator anything  set Result: truth value 2  { 1, 2, 3 } true 2  { Atlanta, Berkeley } false

Set quantifier (  x, truth value ) Result: truth value (  x, truth value ) truth value { x | truth value } set

Quantifiers remove free variables from expressions { x | x  y } { x | x = 1  x = 2 } { x |  y, x = 2· y } { x | x + 7 } Result: free y { 1, 2 } { 2, 4, 6, 8, … } not well-formed

Bounded quantification (  x  set, truth value ) Result: truth value (  x  set, truth value ) truth value { x  set | truth value } set

Meaning of constants can be defined Let Nats = { 1, 2, 3, 4, … } . Let Bools = { true, false } . Define Cities = { Atlanta, Chicago, Berkeley, Detroit } . Define Ø = { } .

Let Evens = { x  Nats |  y  Nats, x = 2· y } . Let Evens be the set of all x  Nats such that x = 2· y for some y  Nats.