Function Symbols & Arithmetic PHIL012 January 22, 2001.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Artificial Intelligence: Natural Language and Prolog
First-Order Logic Chapter 8.
Logic & Critical Reasoning Translation into Propositional Logic.
Relational Algebra Dashiell Fryer. What is Relational Algebra? Relational algebra is a procedural query language. Relational algebra is a procedural query.
Philosophy 103 Linguistics 103 Introductory Logic: Critical Thinking Fall 2007 Dr. Robert Barnard.
Truth Trees Intermediate Logic.
Copyright © Cengage Learning. All rights reserved.
January th grade. Tuesday 10 th grade 4 th period  You need your language books.
Knowledge Representation & Reasoning.  Introduction How can we formalize our knowledge about the world so that:  We can reason about it?  We can do.
For Friday, read chapter 6, section 2. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class.
1 1. Show the result of each of the following set operations in terms of set property. Write your sets as simple as possible. (a) L 0  L 4 (b) L 0  L.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
Copyright © Cengage Learning. All rights reserved.
What makes communication by language possible? Striking fact (a) If someone utters a sentence and you know which proposition her utterance expresses, then.
Satisfiability & Logical Truth PHIL /16/2001.
What makes communication by language possible? Striking fact (a) If someone utters a sentence and you know which proposition her utterance expresses, then.
First Order Logic. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about first order.
Chapter 1 Section 6 Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley.
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
Week 3 - Wednesday.  What did we talk about last time?  Basic number theory definitions  Even and odd  Prime and composite  Proving existential statements.
Copyright © 2010 Pearson Education, Inc. All rights reserved. 1.6 – Slide 1.
CS1502 Formal Methods in Computer Science Lecture Notes 1 Course Information Introduction to Logic Part 1.
Logic Introduction to Logic.
PHIL012 Class Notes 1/12/2001. Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems.
Atomic Sentences Chapter 1 Language, Proof and Logic.
1 Chapter 7 Propositional and Predicate Logic. 2 Chapter 7 Contents (1) l What is Logic? l Logical Operators l Translating between English and Logic l.
1 Knowledge Based Systems (CM0377) Lecture 4 (Last modified 5th February 2001)
Syntax Analysis The recognition problem: given a grammar G and a string w, is w  L(G)? The parsing problem: if G is a grammar and w  L(G), how can w.
P. 58 #10 – 19 (pick 4) # (pick 6).
Section 7.2 So far, we have only worked with integer exponents. In this section, we extend exponents to rational numbers as a shorthand notation when using.
Computabilty Computability Finite State Machine. Regular Languages. Homework: Finish Craps. Next Week: On your own: videos +
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Dr. Shazzad Hosain Department of EECS North South Universtiy Lecture 04 – Part A Knowledge Representation and Reasoning.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Course Overview and Road Map Computability and Logic.
Bell Work8/25/14 Evaluate the expression. Powers and Exponents TSWBAT: evaluate an expression that has an exponent. 11/15/2015 Students understand and.
PHIL012 Class Notes 1/15/2001. Outline Announcements, web page Review Homework Problems (1-7) Set Theory Review & Problem 8 (if time) Assignment for Wednesday.
2.8 Methods of Proof PHIL 012 1/26/2001.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Monday, January 10 No homework due today. No homework due today. Fill in planner Fill in planner Today’s assignment is Practice 2-3 Today’s assignment.
Bell Work3/11/2015 Define the following: 1.Power of a Power Property 2.Product of Powers Property 3.Power of a Product Property.
4.1 : Anti-derivatives Greg Kelly, Hanford High School, Richland, Washington.
Warm Up. 7.1 A – Initial Value Problems Consider: then: or It doesn’t matter whether the constant was 3 or -5, since when we take the derivative the.
Chapter Thirteen Identity and Philosophical Problems of Symbolic Logic.
Artificial Intelligence First-Order Logic (FOL). Outline of this Chapter The need for FOL? What is a FOL? Syntax and semantics of FOL Using FOL.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
First Order Logic Lecture 3: Sep 13 (chapter 2 of the book)
Monday January 26, 2015 Opening: Take out study guide ch. 5 to be checked. Warm-Up: How would you feel if the rules for correct behavior kept changing?
First-Order Logic Chapter 8 (not 8.1). Outline Why FOL? Why FOL? Syntax and semantics of FOL Syntax and semantics of FOL Using FOL Using FOL Wumpus world.
Formal Proofs & F PHIL /31/2001. Outline Homework Problems The FOL of F and Fitch notation Formal Proofs Assignment.
CHAPTER 7 SECTION 1 ROOTS AND RADICAL EXPRESSIONS Algebra 2 Notes ~ April 10, 2009.
Week 2 - Wednesday.  What did we talk about last time?  Arguments  Digital logic circuits  Predicate logic  Universal quantifier  Existential quantifier.
Week 4 - Friday.  What did we talk about last time?  Floor and ceiling  Proof by contradiction.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
1 Lecture 3 The Languages of K, T, B and S4. 2 Last time we extended the language PC to the language S5 by adding two new symbols ‘□’ (for ‘It is necessary.
Bell Work8/28/14 Evaluate the expression. Yesterday’s Homework 1.Any questions? 2.Please pass your homework to the front. Make sure the correct heading.
PHILOSOPHY OF LANGUAGE Some topics and historical issues of the 20 th century.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
PHIL 012 2/14/2001 Logical Equivalence & Translation.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
Natural Language Processing Vasile Rus
Chapter 7. Propositional and Predicate Logic
Logarithms and Logarithmic Functions
Conditionals and Biconditionals
Subscript and Summation Notation
Chapter 7. Propositional and Predicate Logic
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Function Symbols & Arithmetic PHIL012 January 22, 2001

Outline Announcements function symbols, terms, complex terms The first order language of arithmetic Sample problems Assignment

Terms A “Term” is another name for the arguments that predicates take. ExamplesTermsPredicate Cube(a) Between(a,b,c) Likes(Mary, Tom) Tall(Father(Max) aCube a, b, cBetween Mary, TomLikes Father(Max)Tall

Function Symbols A Function Symbol looks like a predicate (since it takes arguments): Predicate: Cube(a) Function Symbol: Father(Max) However, a Predicate with its arguments form a sentence. Whereas, a Function Symbol with its argument is simply a term.

Function Symbols vs. Predicates Cube(a) is a sentence because it makes a claim. It says “a is a cube” Father(Max) does not make a claim. It simply picks out a person, “Max’s Father.” Father(Max) is a term because it doesn’t say anything about Max’s father. Cube(a) has a truth value. Father(Max) does not.

Terms and Function Symbols In the two expressions, Cube(a) and Tall(Father(Max)), “a” is like “Father(Max)” “Tall” is like “Cube” “a” and “Father(Max)” behave like names in picking out objects “Tall” and “Cube” are predicates, specifying properties of objects.

Complex Terms Father(Max) is an example of a Complex Term. A Complex Term is formed by putting a function symbol in front of either a name or another complex term. Complex Terms are used just like names (simple terms) in forming atomic sentences.

Sample Problem Suppose we have 2 languages for talking about employment. Language 1 is functional, since it contains the function symbol, “Employer”. Employer(Claire) means “Claire’s Employer” Language 2 is relational. It uses the predicate Employs(Tony,Claire) to say that Tony is Claire’s employer.

Language 1 Names: Tony, Claire, Max Function Symbol: Employer Predicates: EarnsMoreThan, =

Language 2 Names: Tony, Claire, Max Predictates: EarnsMoreThan, =, Employs

Translate these Language 2 sentences into Language 1 Lanuage 2Language 2 Employs(Claire,Max)Employer(Max) = Claire Employs(Max,Tony)Employer(Tony) = Max EarnsMoreThan(Claire, Tony)

Language 1 into Language 2 Language 1Language 2 Employer(Max) = ClaireEmploys(Claire,Max) Employer(Max) = Employer(Tony)untranslatable EarnsMoreThan(Employer(Max), Employer(Tony)) untranslatable

Summary Terms are simple or complex. A Simple Term is a Name A Complex Term is a Function Symbol followed by some number of Simple Terms or Complex Terms. Terms pick out objects. Predicates specify properties of objects.

Function Symbols & Arithmetic We can specify all of the numbers and operations of arithmetic using a simplified set of symbols: Names: The numbers 0, 1 Predicates: =, < Function Symbols: +, *

Inductive Definition of Terms The language includes an infinite number of complex terms: 0, 1, (1+1), (1+1)+1, ((1+1)+1)+1, … We need to have a routine way of determining whether an expression is a term in the language or not. We do this by inductive definition.

Inductive Definition To form an inductive definition, We set up initial set of terms, Definition 1: 0 and 1 are terms

Inductive Definition Continued We specify a set of rules that must be followed to get additional terms. In this case, these are: Definition 2: If t 1 and t 2 are terms, then (t 1 + t 2 ) and (t 1 * t 2 ) are also terms. Definition 3: An expression is a term IFF it was derived by repeating definitions 1 and 2.

Sample Problems Show that the following are expressions in our language: 1. ((1 + 1) * ((1+1) +1))

Sample Problems 2. ((0 * (1 + 0)) + 1)

Assignment For Wednesday: –Read 2.7 –Try to work through problems By Midnight Thursday: –Turn in problems (Homework 3) For Friday: –Read 2.8 Our first test (Chapter 2) will be on Feb 5 We will have a review on Feb 2.