Conditionality What does TFF mean?. The paradox of material implication p ⊨ q ⊃ p is valid (by the definition of the truth table of ⊃ ) but trivially.

Slides:



Advertisements
Similar presentations
-- in other words, logic is
Advertisements

Logic The study of correct reasoning.
Rules of Inference Rosen 1.5.
Methods of Proof. Methods of Proof The Vicky Pollard Proof Technique Prove that when n is even n2 is even. Assume n is 0, then n2 is 0, and that is.
Introduction to Proofs
Chapter 2 Fundamentals of Logic Dept of Information management National Central University Yen-Liang Chen.
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.
Deduction In addition to being able to represent facts, or real- world statements, as formulas, we want to be able to manipulate facts, e.g., derive new.
BIRDS FLY. is a bird Birds fly Tweety is a bird Tweety flies DEFEASIBLE NON-MONOTONIC PRESUMPTIVE?
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
On Status and Form of the Relevance Principle Anton Benz, ZAS Berlin Centre for General Linguistics, Typology and Universals Research.
Logic 3 Tautological Implications and Tautological Equivalences
Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.
Me Talk Good One Day When Language and Logic Fail to Coincide.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
Logic. what is an argument? People argue all the time ― that is, they have arguments.  It is not often, however, that in the course of having an argument.
The “Explanatory Gap” Where it is said that identity theory is not necessary false, but merely unknowable.
Many Valued Logic (MVL) By: Shay Erov - 01/11/2007.
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Conditional Statements
Logical and Rule-Based Reasoning Part I. Logical Models and Reasoning Big Question: Do people think logically?
Adapted from Discrete Math
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
Chapter 8 Logic DP Studies. Content A Propositions B Compound propositions C Truth tables and logical equivalence D Implication and equivalence E Converse,
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Discrete Mathematics and Its Applications
Chapter 1: The Foundations: Logic and Proofs
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
F22H1 Logic and Proof Week 6 Reasoning. How can we show that this is a tautology (section 11.2): The hard way: “logical calculation” The “easy” way: “reasoning”
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
The Science of Good Reasons
2.3Logical Implication: Rules of Inference From the notion of a valid argument, we begin a formal study of what we shall mean by an argument and when such.
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.
MADAM SITI AISYAH ZAKARIA. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC LOGICAL CONNECTIVES CONDITIONAL STATEMENT.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
LECTURE 17 THE MODAL ONTOLOGICAL ARGUMENT (A VARIANT OF HARTSHORNE’S VERSION)
Presentation about pragmatic concepts Implicatures Presuppositions
Logic The Lost Art of Argument. Logic - Review Proposition – A statement that is either true or false (but not both) Conjunction – And Disjunction – Or.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Philosophy and Logic The Process of Correct Reasoning.
CS104:Discrete Structures Chapter 2: Proof Techniques.
Is there a Culture that is the Best, that all others should strive to become more like?
What is an argument? An argument is, to quote the Monty Python sketch, "a connected series of statements to establish a definite proposition." Huh? Three.
Learning Objectives  To define a proposition  To form a compound proposition using connectives  To determine the truth values of compound propositions.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Section 1.7. Section Summary Mathematical Proofs Forms of Theorems Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction.
Implicature. I. Definition The term “Implicature” accounts for what a speaker can imply, suggest or mean, as distinct from what the speaker literally.
Chapter 1 Logic and proofs
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Chapter 1 Logic and Proof.
Discrete Mathematical
Chapter 3 Basic Logical Concepts (Please read book.)
2. The Logic of Compound Statements Summary
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Proof Techniques.
Elements of Reasoning:
Principles of Computing – UFCFA3-30-1
Chapter 8 Logic Topics
Dawkins’ The God Delusion: A Public Debate
Nofsinger. R., Everyday Conversation, Sage, 1991
Logic Problems and Questions
TRUTH TABLES.
Critical Thinking Lecture 2 Arguments
Logical and Rule-Based Reasoning Part I
Nofsinger. R., Everyday Conversation, Sage, 1991
Presentation transcript:

Conditionality What does TFF mean?

The paradox of material implication p ⊨ q ⊃ p is valid (by the definition of the truth table of ⊃ ) but trivially wrong in application Two responses to the paradox The truth table for ⊃ is a good model for the truth values of conditionals. We then should attempt to explain why the paradoxes seem odd. The truth table for ⊃ is not a good model for the truth values of conditionals. The gap between ⊃ and ‘if’ then explains why the paradoxes seem so odd.

Truth and assertibility (Grice: Logic and conversation) A proposition is true if what it says is the way things are. A proposition is assertible if it is appropriate or reasonable to assert. – You ought to make assertions you believe to be true, and not make assertions you believe to be untrue.

Grice’s maxim of relevance I ought not say more than is necessary, and I ought not say less than is necessary. If what I say more or less than necessary then it is not assertible. Griceian answer to the paradox: The inference from p to q ⊃ p seems odd because we hardly ever assert q ⊃ p on the grounds that p.

Conditional Probability (Frank Jackson) Assertibility of a conditional p ⊃ q varies with the conditional probability Pr(q|p) – Pr(q|p) the probability that q obtains, given that p obtains Given the special role that conditionals play in our own reasoning (such as in dealing with hypothetical situations, and their use in the context of limited information), conditionals ought to be robust in the context of increasing information, and that this motivates the definition of its assertibility in terms of conditional probability. Robust: it survives into the new context in the discourse

Another paradoxical example: tautology (p ⊃ q) v (q ⊃ r) is a tautology but wrong Either, if the Pope is a Catholic, Queensland wins the Sheffield Shield, or if Queensland wins the Sheffield Shield, the moon is made of green cheese.

Another approach: material conditional is not conditional (Bertrand Russell) Truth table of p ⊃ q = the truth table of ~(p&~q) (draw them) I shall now write ‘if p then q’ as ‘p→ q’, to make clear that we are not necessarily assuming the material conditional, but arguing that the conditional we use is the material conditional. The argument: If p→q is true then if p is true, q must be true (that is what a conditional says, after all) so you do not have p true and q false, so p&~q is not true, and consequently ~(p&~q) is true. Conversely, if ~(p&~q) is true, consider what happens if p is true. In that case, you don’t have q false, since p&~q is not true (that is what we have assumed: ~(p&~q) is true.) So, if you don’t have q false, q must be true. So, if p is true, so is q. In other words, p→q is true.

The problematic part: – Conversely, if ~(p&~q) is true, consider what happens if p is true. In that case, you don’t have q false, since p&~q is not true (that is what we have assumed: ~(p&~q) is true.) So, if you don’t have q false, q must be true. So, if p is true, so is q. In other words, p→q is true. P: I’m dead Q: I’m alive Then – ~(p&~q) is true – p→q is false

The problem If ~(p&~q) is true, then what happens if p is true. – when p is true is that I’m dead. In this case, you don’t have q false, since p&~q is not true. – This seems wrong: In the situations in which I am dead, we do have q false. The reasoning presumes that we can still call on the truth of our original assumption ~(p&~q) in a situation in which we have assumed that p is true. – If I am dead, it is no longer true that I’m not both dead and not alive.

Introducing necessity □~(p&~q) □: one-place connective of necessity □ is not truth-functional □ is a modal operator □A does not depend merely on the truth value of A Some propositions p might be true, while □p is false (p might be true by accident) Other propositions p might be true with □p true