Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Deductive Validity In this tutorial you will learn how to determine whether deductive arguments are valid or invalid. Go to next slide.
TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Functional Logic
Chapter 21: Truth Tables.
PROOF BY CONTRADICTION
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.
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
Formal Semantics of S. Semantics and Interpretations There are two kinds of interpretation we can give to wffs: –Assigning natural language sentences.
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
Knowledge Representation Methods
CS128 – Discrete Mathematics for Computer Science
Essential Deduction Techniques of Constructing Formal Expressions and Evaluating Attempts to Create Valid Arguments.
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.
Review Test 5 You need to know: How to symbolize sentences that include quantifiers of overlapping scope Definitions: Quantificational truth, falsity and.
Sentential Logic(SL) 1.Syntax: The language of SL / Symbolize 2.Semantic: a sentence / compare two sentences / compare a set of sentences 3.DDerivation.
Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.
For Monday, read Chapter 4, Sections 1 and 2. Nongraded homework: Problems on pages Graded HW #4 is due on Friday, Feb. 11, at the beginning of.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Discrete Structures Chapter 3: The Logic of Quantified Statements
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Adapted from Discrete Math
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
Chapter Six Sentential Logic Truth Trees. 1. The Sentential Logic Truth Tree Method People who developed the truth tree method: J. Hintikka— “model sets”
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Copyright © Cengage Learning. All rights reserved. CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS THE LOGIC OF QUANTIFIED STATEMENTS.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
2.8 Methods of Proof PHIL 012 1/26/2001.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Today’s Topics Introduction to Proofs Rules of Inference Rules of Equivalence.
Chapter Five Conditional and Indirect Proofs. 1. Conditional Proofs A conditional proof is a proof in which we assume the truth of one of the premises.
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Chapter Thirteen Identity and Philosophical Problems of Symbolic Logic.
Chapter Twelve Predicate Logic Truth Trees. 1. Introductory Remarks The trees for sentential logic give us decidability—there is a mechanical decision.
1 Knowledge Based Systems (CM0377) Lecture 6 (last modified 20th February 2002)
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
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.
Metalogic Soundness and Completeness. Two Notions of Logical Consequence Validity: If the premises are true, then the conclusion must be true. Provability:
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
3. The Logic of Quantified Statements Summary
Formal Modeling Concepts
{P} ⊦ Q if and only if {P} ╞ Q
IMPORTANT!! As one member of our class recognized, there is a major mistake on page 180 of the text where the rule schemas for SD are laid out. It symbolizes.
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
3 Logic The Study of What’s True or False or Somewhere in Between.
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
2-1 Conditional Statements
Copyright © Cengage Learning. All rights reserved.
Truth Tables Hurley
MA/CSSE 474 More Math Review Theory of Computation
The most important idea in logic: Validity of an argument.
Discrete Mathematics Lecture 4 Logic of Quantified Statements
6.4 Truth Tables for Arguments
1.3 Propositional Equivalences
Logical and Rule-Based Reasoning Part I
Arguments in Sentential Logic
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Presentation transcript:

Chapter Eight Predicate Logic Semantics

1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which the premises are true and the conclusion false. Sentences are consistent just in case there is some valuation on which they are all true Two sentences are logically equivalent iff there is no valuation ion which they differ in truth-value.

Interpretations in Predicate Logic, continued But while validity, consistency, and logical equivalence in predicate logic are the same as they are in sentential logic, more is involved in specifying a valuation in predicate logic.

Interpretations in Predicate Logic, continued In predicate logic, although we have individual variables and quantification using such variables, we have no predicate variables, only individual variables.

Interpretations in Predicate Logic, continued We introduce predicate constants into a specific context, but must treat them as though they have other interpretations. To speak of different interpretations of a predicate letter is to treat it as though it were a variable for which we are substituting another predicate: We assign it to different domains in different contexts.

Interpretations in Predicate Logic, continued At this point we shall treat predicates intensionally, relying on commonsense meanings of them.

2. Proving Invalidity In sentential logic we could prove that an argument was invalid by producing an interpretation on which all the premises were true and the conclusion false. In predicate logic too we produce counterexamples to show that arguments are invalid.

3. Using Expansions to Prove Invalidity An easy way to prove invalidity is to use an interpretation with a very small domain.

Using Expansions to Prove Invalidity, continued Technique: Construct the expansion of the premises and conclusion for a small domain. Use the shortcut technique from sentential logic, ascribing truth values consistently. Attempt to find an interpretation on which the premises are true and the conclusion false.

Using Expansions to Prove Invalidity, continued While many invalid arguments can be shown to be invalid using a two-individual domain, not all can. Some may require expansions of three or more individuals.

4. Consistency in Predicate Logic Just as in sentential logic, in predicate logic the method for proving consistency of the premise of an argument is basically part of the method used for proving invalidity.

Consistency in Predicate Logic, continued In predicate logic, to show that an argument is invalid we produce an interpretation in which the premises are true and the conclusion is false. To show that the premises are consistent, we need only to show that there is an interpretation on which they are all true.

Consistency in Predicate Logic, continued Note that whenever one proves an argument invalid, one also proves that the premises are consistent.

5. Validity and Inconsistency in Predicate Logic An argument is valid just in case among all of its many interpretations there is not one where the premises are true and the conclusion false. A set of sentences is inconsistent iff there is not a single interpretation in which all the sentences are true.

Validity and Inconsistency in Predicate Logic, continued To demonstrate validity or inconsistency in predicate logic we must either use a proof or a truth tree.

Key Terms Consistent Intensional interpretation of a predicate Interpretation Logically equivalent Valid