Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1.3 Predicates and Quantifiers
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
The Logic of Quantified Statements
Symbolic Logic: The Language of Modern Logic
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Introductory Logic PHI 120 Presentation: "Intro to Formal Logic" Please turn off all cell phones!
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Exam #3 will be given on Monday Nongraded Homework: Now that we are familiar with the universal quantifier, try
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.
CAS LX 502 8a. Formal semantics Truth and meaning The basis of formal semantics: knowing the meaning of a sentence is knowing under what conditions.
Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)
Knowledge Representation Methods
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
For Wednesday, read chapter 6, section 1. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class. In.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
For Wednesday, read chapter 2, sections 3 and 4. As nongraded homework, do the problems at the end each section. Also try exercises 7.1, C, D, and E on.
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.
For Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.
Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.
Discrete Structures Chapter 3: The Logic of Quantified Statements
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 6 Limitations of propositional logic Introduction to predicate logic Symbols, terms and formulae, Parse.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
PL continued: Quantifiers and the syntax of PL 1. Quantifiers of PL 1. Quantifier symbols 2. Variables used with quantifiers 2. Truth functional compounds.
The Language of Propositional Logic The Syntax and Semantics of PL.
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
No new reading for Wednesday. Exam #1 will be given in class on Friday. It covers Chapters 1 and 2 (except for chapter 2, section 6). On Monday, I’ll give.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Introduction to Quantification Chapter 9 Language, Proof and Logic.
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.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
Lecture 4: Predicates and Quantifiers; Sets.
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.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
Discrete Mathematics CS 2610 August 22, Agenda Last class Propositional logic Logical equivalences This week Predicate logic & rules of inference.
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.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
Semantics of Predicate Calculus For the propositional calculus, an interpretation was simply an assignment of truth values to the proposition letters of.
Chapter 9: Syntax and Semantics II : Logic & Proofs July 23, 2009 Karin Howe.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
Discrete Mathematics Lecture # 1. Course Objectives  Express statements with the precision of formal logic.  Analyze arguments to test their validity.
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Propositional and predicate logic
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.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Logic II CSE 140 etc..
Predicates & Quantifiers
Today’s Topics Universes of Discourse
CS201: Data Structures and Discrete Mathematics I
A Brief Summary for Exam 1
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Logics for Data and Knowledge Representation
CS201: Data Structures and Discrete Mathematics I
Compounding.
Presentation transcript:

Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.

Predicate logic: Three elements I. Small-case ‘a’ through ‘s’ serve as individual constants. They refer to specific persons, places, or things. For example, ‘s’ can stand for Simone.

II. Capital letters ‘A’ through ‘Z’ abbreviate predicates. A predicate is an atomic statement with the subject deleted. ‘Kermit is green’ is a simple statement. ‘___ is green’ is a predicate, symbolized by ‘Gx’ or ‘G_’.

How do we symbolize ‘Simone is a philosopher’? Using ‘P_’ for ‘___ is a philosopher’, we get Ps Note that the individual constant comes after the predicate, even though the individual constant corresponds to the subject of the sentence.

III. Quantifiers and variables: (  x), (  y), and (  z) serve as existential quantifiers. They mean “there exists at least one thing of which the following is true.” (  x), (  y), and (  z) serve as universal quantifiers. They mean “the following statement true for everything in the universe.”

Quantifiers are like logical operators in that they determine truth conditions for the statements they apply to. To do so, they work together with attached individual variables: small-case x, y, and z, which function like pronouns. ‘(  x)(Px & Fx)’ says, “it is true of at least one thing that it is a philosopher and it is female.”

Our original argument becomes PsFs  (  x)(Px & Fx) (Dictionary: P_: _ is a philosopher; F_: _ is female; s: Simone) Even if we don’t yet have a way of proving this argument is valid, we can see the reasoning. Use &I and generalize (if Simone is a female philosopher, then there has to exist at least one female philosopher).

Scope and Binding in predicate logic Scope: A quantifier’s scope is calculated in the same way as the scope of a tilde: look directly to the right of the quantifier and --if there is a predicate letter, the quantifier applies only to the atomic formula of which that predicate letter is a part.

--if there is a tilde, the quantifier applies to the tilde and to whatever the tilde applies to --if there is a parenthesis (or bracket), the quantifier applies to everything in that pair of parentheses (or brackets) A variable is bound if and only if it is within the scope of a quantifier that contains a matching small-case letter. If a variable is unbound, it is free.

A statement that contains at least one free variable (but is otherwise well-formed) is an open sentence. These count as formulae, but they don’t have truth-conditions. When symbolizing in predicate logic, the result should never be an open sentence (i.e., no free variables allowed when translating).

(  x)(Px & Fx) & Ax In this formula, the last x is free. The scope of the existential quantifier extends only to the closed parenthesis. The final ‘x’ is like a pronoun with no referent. The statement is incomplete; it does not have definite truth-conditions.

Statements with Individual Constants and No Quantifiers Many of our symbolizations have no quantifiers, simply because there is no quantity term in (and no corresponding idea expressed by) the English sentence being symbolized. Example: Simone is a female philosopher, but she’s not American. (Dictionary: P_: _ is a philosopher; F_: _ is female; A_: _is American; s: Simone) (Ps & Fs) & ~ As

Problems on p 158, 165