Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that.

Slides:



Advertisements
Similar presentations
Computing Truth Value.
Advertisements

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
Logic & Critical Reasoning
Possible World Semantics for Modal Logic
1 Logic Logic in general is a subfield of philosophy and its development is credited to ancient Greeks. Symbolic or mathematical logic is used in AI. In.
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.
SL Truth value assignments. SL Truth value assignments PL Interpretation.
Truth Trees Intermediate Logic.
Philosophy 120 Symbolic Logic I H. Hamner Hill CSTL-CLA.SEMO.EDU/HHILL/PL120.
2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.
Oh, a break! A logic puzzle   In a mythical (?) community, politicians always lie and non-politicians always tell the truth. A stranger meets 3 natives.
Formalizing Alpha: Soundness and Completeness Bram van Heuveln Dept. of Cognitive Science RPI.
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.
PHIL 120: Jan 8 Basic notions of logic
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.
Let remember from the previous lesson what is Knowledge representation
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Phil 120 week 1 About this course. Introducing the language SL. Basic syntax. Semantic definitions of the connectives in terms of their truth conditions.
Critical Thinking: A User’s Manual
Propositional Logic Review
Discrete Mathematics and Its Applications
Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
Deductive versus Inductive Reasoning Consider the following two passages: Argument #1 Mr. Jones is a member of the Academy of Scholarly Fellows and only.
Chapter 1 Logic Section 1-1 Statements Open your book to page 1 and read the section titled “To the Student” Now turn to page 3 where we will read the.
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Advanced Topics in Propositional Logic Chapter 17 Language, Proof and Logic.
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.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
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.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
Arguments, translation, representation -Sign In! -Quiz -Review Quiz -Unstated premises and translation -Things that look like arguments but aren't -Representing.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Methods of Proof for Boolean Logic Chapter 5 Language, Proof and Logic.
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
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 =
a valid argument with true premises.
{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.
Introduction to Logic PHIL 240 Sections
Chapter 8 Logic Topics
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
Truth Tables Hurley
Truth Trees.
TRUTH TABLES.
TRUTH TABLES continued.
Back to “Serious” Topics…
Discrete Mathematics and Its Applications Kenneth H
The Logic of Declarative Statements
TRUTH TABLES.
Introductory Logic PHI 120
Statements and Logical Connectives
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.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

Proving the implications of the truth functional notions  How to prove claims that are the implications of the truth functional notions  Remember that P, Q, R, and S are meta varibles that range over individual sentences of SL  If a claim is of the form “if and only if” you must prove two if/then claims.  If a claim is not of the form “if and only if” (but only show that “if/then” you need to identify what follows ‘if’ and show that if it holds what follows ‘then’ does as well

Proving implications  Suppose that P and Q are truth-functionally indeterminate sentences. Does it follow that P & Q is truth functionally indeterminate?  If P and Q are truth functionally indeterminate then there is at least one TVA on which P is true and at least one TVA on which Q is true, and there is at least one TVA on which P is false and at least one TVA on which Q is false.  So P & Q can be neither truth-functionally true, nor truth-functionally false. Hence it will be truth- functionally indeterminate.

Proving implications  Suppose that P is a truth-functionally true sentence and Q is truth-functionally indeterminate.  Based on this information, can you determine if P  Q is truth functionally true, truth functionally false, or truth functionally indeterminate? If so, which is it?  Yes. It is truth functionally indeterminate. There will be at least one TVA on which it is true (when Q is true) and at least one TVA on which it is false (when Q is false).

Proving implications  Suppose that two sentences, P and Q, are truth functionally equivalent. Show that it follows that the sentences P and P & Q are truth functionally equivalent.  If P and Q are truth functionally equivalent, there is no TVA on which they have different truth values.  So on every TVA on which P and Q are true, P & Q will be true; and on every TVA on which P is false, P & Q will be false as well.  So P and P & Q are truth functionally equivalent.

Proving implications  Suppose that two sentences, P and Q, are truth functionally equivalent. Show that it follows that ~P v Q is truth functionally true.  If P and Q are truth functionally equivalent, there is no TVA on which P and Q have different truth values. Thus on any TVA on which Q is false, ~P is true because P is false, and on any TVA on which ~P is false, Q is true because P is true. So there is no TVA on which ~P v Q is false (so the sentence is truth functionally true). So there is no TVA on which ~P v Q is false (so the sentence is truth functionally true).

Proving implications  Prove that {P} is truth functionally inconsistent if and only if ~P is truth functionally true.  If {P} is truth functionally inconsistent, there is no TVA on which its member (P) is true. Hence P (the only member of the set) is truth functionally false and its negation, ~P, is truth functionally true.  If ~P is truth functionally true, P is truth functionally false. Hence {P} is truth functionally inconsistent because there is no TVA on which its member is true.

Proving implications  If {P} is truth functionally consistent must {~P} be truth functionally consistent as well?  If {P} is truth functionally consistent, there is at least one truth value assignment on which its member, P, is true.  This only tells us that P is not truth functionally false. If P is truth-functionally true, ~P is truth functionally false and {~P} is not truth functionally consistent. If P is truth functionally indeterminate then {~P} would be truth functionally consistent. But we can’t know which P is so we cannot know the truth functional status (consistent or inconsistent) of {~P}

Proving implications  Prove that if P  Q is truth functionally true, then {P, ~Q} is truth functionally inconsistent.  If P  Q is truth functionally true, then there is no TVA on which P and Q have different truth values.  So either both are truth functionally true sentences, both are truth functionally false sentences, or P and Q are truth functionally equivalent (on any TVA, they have the same truth values).

Proving implications  If both are truth functionally true, then ~Q is truth functionally false and the set {P, ~Q} is truth functionally inconsistent as there is no TVA on which ~Q will be true and thus none on which all the members of the set are true.  If both are truth functionally false, then P is truth functionally false and the set {P, ~Q} is truth functionally inconsistent because there is no TVA on which P is true and thus none on which all the members of the set are true.

Proving implications  If P and Q are truth functionally equivalent, then when P is true, ~Q is false; and when ~Q is true, P is false. So there is no TVA on which both P and ~Q are true and, so, the set {P, ~Q} is truth functionally inconsistent.

Proving implications Part 1: If the corresponding material conditional of an argument PQR---S which is [ (P & Q) & R]  S] is truth functionally true, there is no TVA on which (P & Q) & R is true and S is false. Thus there is no TVA on which the premises of the argument are all true and the conclusion S is false and so the argument is truth functionally valid.

Proving implications Part 2: If the argument PQR---S is truth functionally valid, then there is no TVA on which P, Q, and R are all true and S is false. Thus there is no TVA on which the material conditional that has the conjunction (P & Q) & R as its antecedent and S as its consequent is false, and hence the material conditional is truth functionally true.

Proving implications Part 2: If the argument PQR---S is truth functionally valid, then there is no TVA on which P, Q, and R are all true and S is false. Thus there is no TVA on which the material conditional that has the conjunction (P & Q) & R as its antecedent and S as its consequent is false, and hence the material conditional is truth functionally true.

Proving implications  Show that P ╞ Q and Q ╞ P IFF P and Q are truth functionally equivalent.  If P ╞ Q and Q ╞ P, then there is no TVA on which P is true and Q is false and no TVA on which Q is true and P is false. So there is no TVA on which P and Q have different truth values. So P and Q are truth functionally equivalent.  If P and Q are truth functionally equivalent, then there is no TVA on which P and Q have different truth values. So on any TVA on which P is true, Q is true and so P ╞ Q, and on any TVA on which Q is true, Q ╞ P.

Truth functional properties and truth functional consistency  It turns out that the truth functional concepts of truth functional truth, truth functional falsehood, truth functional indeterminacy, truth functional validity, and truth functional entailment can each be defined in an additional way: in terms of truth functional consistency.  And this affords an additional way of explicating each of them.

Truth functional properties and truth functional consistency  A sentence P is truth functionally false IFF {P} is truth functionally inconsistent.  Why?  A sentence P is truth functionally true IFF {P} is truth functionally consistent.  Why?  A sentence P is truth functionally indeterminate IFF both {~P} and {P} are truth functionally consistent.  Why?

Truth functional properties and truth functional consistency  Sentences P and Q are truth functionally equivalent IFF {~(P  Q} is truth functionally inconsistent.  Why?

Truth functional properties and truth functional consistency  Where  is a set of sentences of SL and P is any sentence of SL, we may form a set that contains all the members of  and P, represented by  ⋃ {P} (the union of  and the unit set of P)

Truth functional properties and truth functional consistency  An argument is truth functionally valid IFF the set containing as its only members the premises of the argument and the negation of the conclusion is truth functionally inconsistent.  So, the argument A v B ~B A

Truth functional properties and truth functional consistency  So, the argument A v B ~B A is truth functionally valid IFF {A v B, ~B, ~A} is truth functionally inconsistent.