PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

The Logic of Quantified Statements
Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Predicates and 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 Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
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.
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.
Discrete Structures Chapter 3: The Logic of Quantified Statements
Discrete Structures Chapter 3: The Logic of Quantified Statements
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.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
The Foundations: Logic and Proofs
Logical Equivalence & Predicate Logic
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
2.2 Statements, Connectives, and Quantifiers
Quantifiers, Predicates, and Names Kareem Khalifa Department of Philosophy Middlebury College Universals, by Dena Shottenkirk.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Introduction to Quantification Chapter 9 Language, Proof and Logic.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
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.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
Section Predicates & Quantifiers. Open Statement 2 x > 8 p < q -5 x = y + 6 Neither true nor false.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
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,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
LOGIC AND QUANTIFIERS. INTRODUCTION Many algorithms and proofs use logical expressions such as: “IF p THEN q” or “If p1 AND p2, THEN q1 OR q2” Therefore.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
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.
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.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Chapter 9: Syntax and Semantics II : Logic & Proofs July 23, 2009 Karin Howe.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
PREDICATE CALCULS In Propositional Calculus, each atomic symbol denotes a proposition. But there is no way to access the components of an individual assertion.
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.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
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.
ece 627 intelligent web: ontology and beyond
Predicates & Quantifiers
Chapter 1 The Foundations: Logic and Proofs
Today’s Topics Universes of Discourse
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
Introduction to Predicates and Quantified Statements I
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
Presentation transcript:

PART TWO PREDICATE LOGIC

Chapter Seven Predicate Logic Symbolization

Predicate Logic, or Quantifier Logic, is concerned with the interior structure of both atomic and compound sentences.

1. Individuals and Properties In atomic sentences a property is ascribed to some individual. For example, “Art is happy” has the property of “being happy” ascribed to Art. We can symbolize this as Ha, with the uppercase letter denoting the property and the lowercase letter denoting the individual.

Individuals and Properties, continued Properties that hold between two or more entities are called relational properties. Properties such as “is happy” which are ascribed to only one individual are monadic properties.

Individuals and Properties, continued Capital letters used to denote properties are called property constants, and lowercase letters (up to an including the letter t) used to denote things, objects, and individual entities are called individual constants. The lowercase variables u through z are used as individual variables, replaceable by individual constants.

2. Quantifiers and Free Variables In predicate logic two symbols, called quantifiers, are used to state how many. The universal quantifier is used to state that all entities have some property or properties. The existential quantifier is used to assert that some individual or individuals have one or more properties.

Quantifiers and Free Variables, continued In predicate logic, parentheses indicate the scope of a quantifier. For example, the sentence “Everything has mass and is extended” is symbolized as (x)(Mx. Ex) (where Mx = “x has mass” and Ex = “x is extended”). The parentheses around the expression (Mx. Ex) indicate that the scope of the (x) quantifier is the remaining part of the sentence.

Quantifiers and Free Variables, continued The expression (x) (Mx. Ex) is a sentence, but (Mx. Ex) is a sentence form, not a sentence. The expression (x)(Mx). Ex is not a sentence as it contains an individual variable that is not quantified, the Ex. Unquantified variables are called free variables. Quantified variables are called bound variables.

3. Universal Quantifiers When we use the universal quantifier, (x), we are saying something about all the individuals represented by the variable in the quantifier. Since few properties can be ascribed to everything, we might need to restrict our domain of discourse.

4. Existential Quantifiers The existential quantifier ( ∃ x) is used to assert that some entities (at least one) have a given property. For example, “Something is heavy” can be symbolized as ( ∃ x)Hx

5. Basic Predicate Logic Symbolizations Sentences that begin with words such as “all” “every” or “any” can be symbolized using the universal quantifier. (x) (Dx ⊃ Fx) Sentences of the form “Some A’s are B’s” can be symbolized using the existential quantifier. ( ∃ x) (Dx. Fx)

Basic Predicate Logic Symbolizations, continued Sentences of the form “No A’s are B’s” can be symbolized using either the existential quantifier: ˜( ∃ x) (Dx. Fx) Or the universal quantifier: (x) (Dx ⊃ ˜ Fx)

Basic Predicate Logic Symbolizations, continued Sentences of the form “Not all A’s are B’s” can be symbolized using the universal quantifier: ˜(x) (Dx ⊃ Fx) Or the existential quantifier: ( ∃ x) (Dx. ˜ Fx)

6. The Square of Opposition Any sentence that can be symbolized with a universal quantifier can be symbolized with an existential quantifier, and vice versa. A traditional way of illustrating the relationship between the quantifiers is known as the square of opposition.

7. Common Pitfalls in Symbolizing with Quantifiers Some English expressions that look like compound subjects or predicates should not be symbolized that way. Be careful with sentences that contain the word “a” or “any”. These sometimes operate logically like the particle “all”, but often they do not. Be careful when symbolizing conjunctions!

8. Expansions A reliable guide to translation is to compare the truth conditions of the ordinary language sentence we are translating with those of its translation. In a universe with four individual entities (x)Fx would be true if (Fa. Fb). (Fc. Fd), the expansion of (x) Fx with respect to that universe, was true.

Expansions, continued A model universe is a domain of a small number of individuals about which we shall construe our quantified statements.

9. Symbolizing “Only, “None but,” and “Unless”” Statements such as “Only those who study will pass the test” should be symbolized as (x)(Px ⊃ Sx), with the universe of discourse restricted to the students in question. Sentences such as “None but the good die young” should be symbolized as (x)(Yx ⊃ Gx) Sentences such as “No one will pass the test unless he or she studies” should be symbolized as (x)(Px ⊃ Sx).

Key Terms Bound variable Domain of discourse Existential quantifier Expansion Free variable Individual constant Individual variable Model universe Predicate logic

Key Terms, continued Property constants Quantifier Relational property Scope of a quantifier Square of opposition Substitution Universal quantifier Universe of discourse