PHIL012 Class Notes 1/12/2001. Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Artificial Intelligence in the 21 st Century S. Lucci / D. Kopec Chapter 5: Logic in Artificial Intelligence 1.
CS1502 Formal Methods in Computer Science Lecture Notes 3 Consequence Rules Boolean Connectives.
Lecture 10 varieties of necessity tautological equivalence
Kripke: Outline …(1975) First improtant decision: the theory is about sentences, not about propositions. Like Tarski, not like Barwise & Etchemendy. ***
Knowledge Representation Methods
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
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.
Satisfiability & Logical Truth PHIL /16/2001.
Predicates and Quantifiers
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
Mathematical Maxims and Minims, 1988
INTRODUCTION TO LOGIC FALL 2009 Quiz Game. ConceptsTrue/FalseTranslations Informal Proofs Formal Proofs
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Discrete Mathematics and Its Applications
CS1502 Formal Methods in Computer Science Lecture Notes 1 Course Information Introduction to Logic Part 1.
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
Atomic Sentences Chapter 1 Language, Proof and Logic.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Function Symbols & Arithmetic PHIL012 January 22, 2001.
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.
AP STATISTICS LESSON 10 – 2 DAY 2 MORE DETAIL: STATING HYPOTHESES.
2.8 Methods of Proof PHIL 012 1/26/2001.
CHAPTER 9 Testing a Claim
CS-554 Part-3: First-Order Logic
COMP 170 L2 L08: Quantifiers. COMP 170 L2 Outline l Quantifiers: Motivation and Concepts l Quantifiers: Notations and Meaning l Saying things with Quantified.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
For Friday Read chapter 8 Homework: –Chapter 7, exercises 2 and 10 Program 1, Milestone 2 due.
Thinking Mathematically Statements, Negations, and Quantified Statements.
Formal Proofs & F PHIL /31/2001. Outline Homework Problems The FOL of F and Fitch notation Formal Proofs Assignment.
Postulates and Theorems Relating Points, Lines, and Planes
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
Higher / Int.2 Philosophy 12. Our Learning  Fallacy Reminder  Summary following Homework NAB  Class NAB.
Understanding Student Thinking in Algebra. Opener At your tables, read one item from your reading that was an important statement. Continue until all.
The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers CHAPTER 9 Testing a Claim 9.1 Significance Tests:
10.1 Estimating with Confidence Chapter 10 Introduction to Inference.
Chapter 9 Sampling Distributions 9.1 Sampling Distributions.
The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers CHAPTER 9 Testing a Claim 9.1 Significance Tests:
PHIL 012 2/14/2001 Logical Equivalence & Translation.
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
CHAPTER 9 Testing a Claim
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
The Boolean Connectives
CHAPTER 9 Testing a Claim
CSCI 3310 Mathematical Foundation of Computer Science
Chapter 1: The Informative Function of Language
CS201: Data Structures and Discrete Mathematics I
CHAPTER 9 Testing a Claim

CHAPTER 9 Testing a Claim
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
CHAPTER 9 Testing a Claim
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
CS201: Data Structures and Discrete Mathematics I
CHAPTER 9 Testing a Claim
·Answer in complete sentences ·Page 17 - # 2
Predicate Logic: Syntax.
CHAPTER 9 Testing a Claim
Predicate Logic.
Statistical Test A test of significance is a formal procedure for comparing observed data with a claim (also called a hypothesis) whose truth we want to.
Validity and Soundness, Again
CHAPTER 9 Testing a Claim
Truth tables.
AP Language and Composition
Presentation transcript:

PHIL012 Class Notes 1/12/2001

Outline Announcements, web page Names and Predicates Sentences, claims, and truth value Atomic sentences Homework Problems Assignment for Monday (1/15)

Names A name in a formal language refers to an object in the world. In FOL the object must exist. That is, every name must refer to an actual object.

LanguageWorld “Name1”Object1 “Name2” Object2 “Pegasus”

Names Continued No Name can name more than one object. In other words, every name must have a unique reference. Or, every name in FOL must be a “rigid designator”. An object can have more than one name or even be unnamed.

LanguageWorld “The Morning Star” “Venus” “The Evening Star” Good

Bad LanguageWorld “John”

Predicates Predicates in FOL refer to properties of objects in the world or relations between objects. Examples of Predicates: –“IsBlue” or simply “Blue” –“IsMarriedTo” or simply “Married” –“Can’tStandBrittanySpears” or simply “BrittanyHater”

“Arity” Each predicate refers to a fixed number of objects. In other words, each predicate will take a fixed number of names as arguments* or parameters. We refer to the number of arguments a predicate takes as its “arity” * Note that this is not the same thing as an argument made up of sentences that makes a claim.

“ Arities”of Predicates in Tarski’s World Arity 1: Cube, Tet, Dodec, Small, Medium, Large –Example: Cube(a) - “a” is the name of an object that has the property of being a cube. Arity 2: Smaller, Larger, LeftOf, RightOf, BackOf, FrontOf –Example: Smaller(a,b) - This says that an object named by “a” is smaller than an object named by “b”

Arity 3: Between –Example: Between(a,b,c) - An object named by “a” is between objects named by “b” and “c”. Remember: Predicates must have a precise meaning in FOL. “ Arities”of Predicates in Tarski’s World

Names and Predicates LanguageWorld NameObject PredicateProperty

Sentences and Claims A sentence in FOL, like in English, makes a claim. A claim is a statement about a state of affairs in the world. Claims have truth value. That is, claims are either true or false.

Claims and Truth Value A claim is true if it represents an actual state of affairs with regard to objects in the world. It is false if it does not. Consider the sentence expressing the claim “Mary like Jim”: Likes(Mary,Jim). This sentence and this claim will be true just in case Mary actually does like Jim and false if she does not.

Atomic Sentences An atomic sentence is a predicate followed by the correct number of names, such as Tet(a), Between(a,b,c), and Large(b). An atomic sentence is the simplest type of sentence that makes a claim. In other words, an atomic sentence is the smallest unit of FOL that can have a truth value.

Homework Problems

Assignment for Monday (1/15) Meet with your groups at least once. Read LFOL if you haven’t already. Continue working LFOL probs Work LFOL problems For practice, sample the exercises in chapter 1 of Tarski’s World