Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

1.3 Predicates and Quantifiers
Predicate Logic Colin Campbell. A Formal Language Predicate Logic provides a way to formalize natural language so that ambiguity is removed. Mathematical.
Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
First-Order Logic (and beyond)
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.
Today’s Topics Introduction to Predicate Logic Venn Diagrams Categorical Syllogisms Venn Diagram tests for validity Rule tests for validity.
RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Today’s Topics n Symbolizing conditionals and bi-conditionals n Other complex symbolizations. n Unless.
Exam #3 is Friday. It will consist of proofs, plus symbolizations in predicate logic.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
March 10: Quantificational Notions Interpretations: Every interpretation interprets every individual constant, predicate, and sentence letter of PL. Our.
FIRST-ORDER LOGIC FOL or FOPC
From Chapter 4 Formal Specification using Z David Lightfoot
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
Discrete Mathematics Math 6A Instructor: M. Welling.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Predicate-Argument Structure Monadic predicates: Properties Dyadic predicate: Binary relations Polyadic Predicates: Relations with more then two arguments.
Symbolization in Predicate Logic In Predicate Logic, statements predicate properties of specific individuals or members of a group. Singular Statement:
Sentence Structure Exercise.
Copyright © Cengage Learning. All rights reserved.
Adapted from Discrete Math
Predicates and Quantifiers
Basics On Logic. A PROPOSITION is a statement that is either true (T) or false (F). Propositions are represented by letters p, q, r, P, Q, etc. The negation.
Section 1.3: Predicates and Quantifiers
The Foundations: Logic and Proofs
Intro to Discrete Structures
Logical Equivalence & Predicate Logic
Discrete Mathematics and Its Applications
Chapter 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
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.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 5: Classical Logic.
PART TWO PREDICATE LOGIC. Chapter Seven Predicate Logic Symbolization.
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
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.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
No new reading for Wednesday. Keep working on chapter 5, section 3. Exam #3 is next Monday.
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Discrete Structures – CNS 2300
Thinking Mathematically Statements, Negations, and Quantified Statements.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
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.
CSE15 Discrete Mathematics 01/23/17
ece 627 intelligent web: ontology and beyond
Today’s Topics Introduction to Predicate Logic Venn Diagrams
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Today’s Topics Universes of Discourse
Chapter 8 Logic Topics
CS201: Data Structures and Discrete Mathematics I
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Introduction to Computational Linguistics
Presentation transcript:

Today’s Topics Limits to the Usefulness of Venn’s Diagrams Predicates (Properties and Relations) Variables (free, bound, individual, constants)

Limits to Venn’s diagrams We cannot construct a proper diagram (no region left out, none duplicated) for an argument involving 6 or more terms. We CAN construct 16 and 32 region “Venn diagrams” for both 4 and 5 term arguments, but they are really hard to use. This limit is linked to what mathematicians call the 4 color problem. Any may can be colored with 4 colors and have no adjoining regions the same color.

A 16 region Venn-type diagram for a 4 term argument

An Imposter Venn-type diagram for a 4 term argument

A 32 region Venn-type diagram for a 5 term argument

Things that aren’t supposed to be funny Things I find funny. Why I’m going to Hell.

The Joker “Venn Diagram”

Propositional and syllogistic logic have serious limitations. Some arguments that are clearly valid cannot be shown valid in our system (remember DeMorgan’s valid sentence). Propositional logic misses the internal structure of sentences. Syllogistic logic cannot deal with more than 4 terms, nor can it deal with relations. We need a new, more powerful, tool: Predicate Logic.

The two central concepts in predicate logic are: The Predicate (Property Constant) The Variable

A PREDICATE is either a property of an object or a relation between a group of objects. A predicate is represented symbolically by a capital letter followed by one or more lower case variable letters. Hx = ‘x is happy’ Txy = ‘x is taller than y’

Monadic and Polyadic (Relational) Predicates A predicate that expresses a property of an object is monadic, it applies to only one thing. A predicate that expresses a relation between objects is polyadic or relational, it applies to an ordered set of objects.

A VARIABLE is a place-holder in a formulaic expression. An individual variable is a true place holder, expressed symbolically with lower case letters taken from the end of the alphabet, t, u, v,...z. An individual constant stands for a specific individual, represented by a lower case letter taken from the beginning of the alphabet).

Predicates plus variables allow us to describe individual and relations more fully Let Hx = ‘x is happy’ and Txy = ‘x is taller than y’ and ‘a’ be the individual constant for Alice and ‘b’ the individual constant for Bob. Hb says that Bob is happy. Tba says that Bob is taller than Alice

Sentences containing free individual variables are called open sentences and have no truth value. Hx says only that x, whoever that is, is happy. Since the value of x is open, we can’t assign a truth value to Hx. Replacing free variables with individual constants turns the open sentence into a closed sentence with a truth value.

Another way to close an open sentence is to BIND the free individual variables with QUANTIFIERS. There are only 2 quantifiers in English: All and Some.

Symbolizing quantifiers The universal quantifier, all, is represented with an upside down A--  -- followed by a variable letter (  x says ‘for any x’) –Some systems of logic (the text, LogicWorks) use a variable in parens—(x)--as the symbol for the Universal Quantifier. We shall simply be symbolically polyglot. The existential quantifier, some, is represented with a backwards E--  -- followed by a variable letter (  x says ‘there exists an x such that’)

Any variable that falls within the scope of a quantifier is bound by that quantifier (see pp ). The parentheses following a quantifier mark its scope.  xHx says “everybody is happy.”  x(Txb  Hx) says “someone is taller than Bob and that person is happy.”

If all the variables in a sentence are either bound or individual constants, the sentence is closed. So, while ‘Hx’ is an open sentence, ‘  xHx,’ in which the second ‘x’ is a bound variable, is closed and means ‘someone is happy.’ However, in ‘  xHx  Txy’ both the third x and the y are free, outside the scope of any quanitfier, and thus the sentence is open.

In which, if any, of the following WFF’s are there free variables? 1.  x(Fx  (Ga ● Hx)) 2.  x(Fx  (Ga ● Hy)) 3.  xFx   y(Fy ● Rxy) 4.  x(Fx   y(Fy ● Rxy)) 5.  xFx   y(Fy ● Gy) 6.  x(Tx  (Se ▼ Bxe)) 7.  x(Tx   y(Sy ▼ Bzy))

Answers 1. No free variables 2. The ‘y’ is free 3. The second ‘x’ is free 4. No free variables 5. No free variables 6. No free variables 7. The ‘z’ is free

Symbolizing with Quantifiers: The material inside the parenthesis following a quantifier is called the matrix of the formula. The dominant operator in the matrix of a universally quantified proposition will almost always be the conditional. 1.The word “are” indicates the dominant operator 2.Relative clauses (All  ’s who are  ’s are  ’s) indicate a compound antecedent. The dominant operator in the matrix of an existentially quantified proposition will almost always be conjunction.

Common Errors in Symbolizing with Quantifiers Sentences beginning with “A” do not follow strict rules: –‘A barking dog never bites’ is a universal claim, but –‘A barking dog is in the road’ is an existential claim.

Common Errors in Symbolizing with Quantifiers Sentences beginning with “A” do not follow strict rules: ‘He who’ sentences are universal claims

Common Errors in Symbolizing with Quantifiers Sentences beginning with “A” do not follow strict rules: ‘He who’ sentences are universal claims –‘He who lives by the sword dies by the sword’ is a universal claim

‘Common Errors in Symbolizing with Quantifiers Sentences beginning with “A” do not follow strict rules: ‘He who’ sentences are universal claims ‘Any’ and ‘every’ are not synonymous when following negations –‘Hamner is not taller than any NBA player’ is false, but –‘Hamner is not taller than every NBA player’ is true.

Common Errors in Symbolizing with Quantifiers Sentences beginning with “A” do not follow strict rules: ‘He who’ sentences are universal claims ‘Any’ and ‘every’ are not synonymous when following negations The problem of ‘only’

–In English sentences beginning with ‘only,’ the grammatical subject is the logical predicate. ‘Only freshmen are eligible’ means ‘All who are eligible are freshmen.’

Troubling occurrences of ‘and.’ Sometimes ‘and’ does not signal conjunction. –‘Hamner and Peggy are married’ indicates a relational predicate, not a conjunction – ‘Women and children are exempt’ says that whoever is either a woman or a child is exempt, NOT that whoever is a woman/child is exempt. –‘Some dogs and cats do not make good pets’ does not, the cartoon notwithstanding, indicate that there are cat-dogs who do not make good pets

Try some on your own. Download the Predicate Study Guide from the Handouts section and review it.Handouts Download the Handout entitled Predicate Translation Exercises and try some. Post and discuss your answers. Be careful to use quantifiers when necessary, but remember that we do not quantify across individual constants—names have a fixed value.Handout