Ibn Sina s explanation of reductio ad absurdum. Wilfrid Hodges Herons Brook, Sticklepath, Okehampton November 2011

Similar documents
Propositional Logic: Part II - Syntax & Proofs 0-0

Relational Reasoning in Natural Language

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Natural Deduction for Propositional Logic

Proseminar on Semantic Theory Fall 2013 Ling 720 Propositional Logic: Syntax and Natural Deduction 1

A Little Deductive Logic

8. Reductio ad absurdum

Meta-logic derivation rules

Collins' notes on Lemmon's Logic

Handout on Logic, Axiomatic Methods, and Proofs MATH Spring David C. Royster UNC Charlotte

8. Reductio ad absurdum

Proof strategies, or, a manual of logical style

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

First-Degree Entailment

Introduction to Metalogic

Formal (natural) deduction in propositional logic

A Little Deductive Logic

A Quick Lesson on Negation

Manual of Logical Style

Formal Logic. Critical Thinking

Relevant Logic. Daniel Bonevac. March 20, 2013

Manual of Logical Style (fresh version 2018)

15414/614 Optional Lecture 1: Propositional Logic

The paradox of knowability, the knower, and the believer

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

Propositional Logic Arguments (5A) Young W. Lim 11/29/16

Propositional Logic Review

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

Consequence Relations and Natural Deduction

The Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Propositional Logic Arguments (5A) Young W. Lim 11/30/16

Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.

THE LOGIC OF COMPOUND STATEMENTS

A SIMPLE AXIOMATIZATION OF LUKASIEWICZ S MODAL LOGIC

On the scope of diagonal argument and on contradictory equivalence.

In this chapter, we specify a deductive apparatus for PL.

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

INTENSIONS MARCUS KRACHT

Chapter 1 Elementary Logic

Proof Techniques (Review of Math 271)

A Critical Examination of Ibn-Sina s Theory of the Conditional Syllogism

Introducing Proof 1. hsn.uk.net. Contents

FORMAL PROOFS DONU ARAPURA

Mathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy

Intermediate Logic. Natural Deduction for TFL

SKETCHY NOTES FOR WEEKS 7 AND 8

The λ-calculus and Curry s Paradox Drew McDermott , revised

Ibn Sīnā s syllogistic: a logic between modal and many-valued

Warm-Up Problem. Write a Resolution Proof for. Res 1/32

Gödel s Completeness Theorem

Propositional Logic: Deductive Proof & Natural Deduction Part 1

Philosophy 5340 Epistemology. Topic 3: Analysis, Analytically Basic Concepts, Direct Acquaintance, and Theoretical Terms. Part 2: Theoretical Terms

35 Chapter CHAPTER 4: Mathematical Proof

MAI0203 Lecture 7: Inference and Predicate Calculus

cis32-ai lecture # 18 mon-3-apr-2006

Logic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014

Physicalism Feb , 2014

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Natural deduction for truth-functional logic

Final Exam Theory Quiz Answer Page

To every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.

Russell s logicism. Jeff Speaks. September 26, 2007

Discrete Structures Proofwriting Checklist

240 Metaphysics. Frege s Puzzle. Chapter 26

Class 29 - November 3 Semantics for Predicate Logic

17. Some advanced topics in logic

Supplementary Logic Notes CSE 321 Winter 2009

Logic for Computer Science - Week 5 Natural Deduction

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Propositional logic (revision) & semantic entailment. p. 1/34

Syllogistic Logic and its Extensions

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have

Generalized Quantifiers Logical and Linguistic Aspects

INTRODUCTION TO LOGIC 8 Identity and Definite Descriptions

Natural Logic Welcome to the Course!

Diodorus s Master Argument Nino B. Cocchiarella For Classes IC and IIC Students of Professor Giuseppe Addona

Logic: Propositional Logic (Part I)

Intelligent Systems. Propositional Logic. Dieter Fensel and Dumitru Roman. Copyright 2008 STI INNSBRUCK

Artificial Intelligence: Knowledge Representation and Reasoning Week 2 Assessment 1 - Answers

(Refer Slide Time: 02:20)

~ 3 ~ -LOGIC WITH UNIVERSAL GENERALIZATIONS- Validity

Overview of Logic and Computation: Notes

ESSLLI 2007 COURSE READER. ESSLLI is the Annual Summer School of FoLLI, The Association for Logic, Language and Information

Lecture Notes for MATH Mathematical Logic 1

Maximal Introspection of Agents

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Logic for Computer Science Handout Week 8 DERIVED RULE MODUS TOLLENS DERIVED RULE RAA DERIVED RULE TND

Advanced Topics in LP and FP

Lecture 5 : Proofs DRAFT

Inference in Propositional Logic

INTRODUCTION TO LOGIC

Precis of Aristotle s Modal Syllogistic

Transcription:

1 Ibn Sina s explanation of reductio ad absurdum. Wilfrid Hodges Herons Brook, Sticklepath, Okehampton November 2011 http://wilfridhodges.co.uk

2 WESTERN LOGIC THE BIG NAMES Latin line through Boethius ABELARD Scholastics LEIBNIZ FREGE MODERNS ARISTOTLE CHRYSIPPUS Roman Empire commentators Greek line through Alexandrians IBN SINA Later Arabic logicians

3 Reductio ad absurdum (RAA): to prove φ from known facts ψ we argue φ ψ

4 How to justify using this derivation as a demonstration of φ given ψ? Ibn Sīnā s answer: Here as often, we mean more than we say. Common practice is to introduce the false assumption φ with if, but not repeat If φ when we derive things from it, although in strict logic the condition is needed. Restoring the implied condition gives a richer derivation as follows.

5 We restore the implied If φ then... on φ itself and every formula that depends on it: READ φ ψ NB the richer derivation is still valid, and ( φ φ) is a self-evident axiom. THINK ( φ φ) ψ ( φ ) φ

6 Strictly Ibn Sīnā describes a more complicated derivation: ( φ φ) ψ ( φ χ) φ χ

7 Two probable reasons why he adds χ: 1. To express that the reasoner must not just deduce a contradiction, but also know that the contradiction is a contradiction. 2. To separate the assumption part of RAA from the constructively dubious part. 2 interprets Aristotle. Ibn Sīnā thinks the constructively dubious part is a minor problem, and the challenge is to make sense of an assumption made and later discharged. His explanation covers this, not just for RAA.

8 In what follows we consider: (I) what Ibn Sīnā counted as justifying RAA; (II) his evidence for the missing conditions; (III) his reason for thinking that the derivation remains valid when the conditions are added.

9 (I) What counts as justifying RAA? Today we require explanations to be precise and unambiguous. Any general principles invoked should be universally true. Traditional justifications were more like answers to a child s question Why?. Hard to find anything universally true about natural language. For Ibn Sīnā, medical reasoning was one paradigm, and all general principles in medicine are true in most cases (akt arī).

10 For Ibn Sīnā and many traditional logicians, explaining a rule of reasoning means showing how someone using it could be rightly convinced of what it proves. So the explanation should use only concepts and principles already available to people who use the rule. Thus Ibn Sīnā rejects justifications that (1) are unreasonably complicated, or that (2) bring in metatheory or (3) use an artificial language.

11 [One commentator makes various alterations and additions which] lengthen the discussion but give us no new information. [By contrast] the account we have given is exactly the RAA syllogism itself, no more and no less. (Ibn Sīnā, Šifā viii.3) This is an exaggeration, obviously. To repeat the original argument, no more and no less, would hardly be a justification of it. But Ibn Sīnā can claim that his justification uses no new concepts and no added steps.

12 Ibn Sīnā also rejects justifications based on dialogue, as for example: The form in which Euclid argues, supposes an opponent; and the whole argument then stands as follows. When X is Y, you grant that P is Q; but you grant that P is not Q. I say that X is not Y. If you deny this you must affirm that X is Y, of which you admit it to be a consequence that P is Q. But you grant that P is not Q; therefore (etc. etc.) (De Morgan, Elements of Trigonometry p. 5) (This is a figment of De Morgan s imagination. It draws on Aristotle, not on Euclid.)

13 Ibn Sīnā often refers to dialogues where we show our opponent that she is wrong to believe φ, by taslīm, i.e. granting φ and deducing something clearly false. For Ibn Sīnā, talking about taslīm is a way of talking about inference from assumptions (Ableitung), as opposed to demonstration that something is true (Schluss). He doesn t use it for RAA, presumably because in scientific proofs there simply is no opponent.

14 Ibn Sīnā also rejects explanations of RAA based on counterfactual reasoning. Reason: according to Ibn Sīnā, counterfactual inference is non-monotonic. When we adopt a counterfactual assumption, we overrule some previous inferences by kicking out of reach the premises on which they were based. In scientific discourse this is not allowed.

15 It s not true that if we stipulate that m = 2n then it follows that m is even. One can stipulate an impossibility that prevents that.... But what we do [in the sciences] is to add a condition (šarṭ) which kicks out any conditions (šurūṭ) that prevent the inference. For example If m = 2n and nothing impossible is attributed to m, then m is even. (Qiyās 274.5 15)

16 Background on Ibn Sīnā s view of language For Ibn Sīnā, sentences have a basic structure and (usually) pieces added on. He variously calls the added pieces condition (šarṭ, plural šurūṭ) attachment (iḍāfa) addition (ziyāda)

17 Example (mine but based on many in Ibn Sīnā) The sentence He is eating contains no reference to the present. Proof: we can say If a person chews and swallows, he is eating. A reference to all times is implied. So the sentence He is eating has an unspoken attachment: He is eating at time t. Then the longer sentence contains an unspoken condition: For all times t, if a person chews and swallows at time t, he is eating at time t. Another unspoken condition: If t is the present, he is eating at time t.

18 (II) Ibn Sīnā s evidence for the missing conditions For Ibn Sīnā, a major part of logical analysis is to uncover (rā c ay) additions which are implied but suppressed (maḥd ūf) in common usage. E.g. In common acceptance things are taken unquantified, while in the sciences they have to be taken quantified. When you pay attention to (rā c ayta) this in the examples above,... what is excellent in a thing has to be excellent absolutely, i.e. excellent without any addition (ziyāda). Being excellent in every respect... is being excellent with an addition (ziyāda), namely in every respect. (Jadal 143.1 5)

19 Or from Ibn Sīnā s Autobiography: The next year and a half I devoted myself entirely to reading Philosophy: I read Logic and all the parts of philosophy once again.... I compiled a set of files for myself, and for each argument that I examined, I recorded the syllogistic premises it contained, the way in which they were composed, and the conclusions which they might yield, and I would also pay attention to the conditions ( urā c ī šurūṭ) of its premises, until I had checked out that particular problem.

20 Ibn Sīnā claims that in common practice, the false assumption θ in RAA is introduced by If θ, but If θ is not repeated when things are derived from θ. We can check this from the Arabic of Euclid s Elements 1 (see the handout). Thus: 1. Ibn Sīnā is right that the false assumption is always introduced with If, not with Let or Suppose. 2. In many cases the If is immediately followed by a Suppose ζ, where ζ includes everything in θ that will be used. Then If ζ is not repeated, but we shouldn t expect it to be. Ibn Sīnā never gives his views on Suppose.

21 3. In a significant number of cases ζ is missing or doesn t cover everything used from θ. In these cases Ibn Sīnā is confirmed; If θ is assumed silently. 4. There is an example where If θ is used silently, after an assumption that was not made for RAA. (In modern terms it was made for E.) 5. There is also an example where during the derivation, θ is stated as a fact, not as a condition. If the condition If θ was added, we would get the If θ then θ which appears in Ibn Sīnā s account.

22 (III) How does Ibn Sīnā know that the derivation remains valid when the implied conditional clauses are added? There is no syllogistic rule that would guarantee it. My answer is a tad speculative, based partly on what Ibn Sīnā doesn t say. Note first that if χ consists of a proposition φ plus additions (conditions etc.) then φ normally occurs positively in χ. For example ψ is a condition in (ψ φ), but presumably not in (φ ψ).

23 Fact (in any standard natural deduction system): Let Γ be a set of formulas and φ, ψ formulas. Let δ(p) be a formula in which p occurs only positively, and p is not in the scope of any quantifier on a variable free in some formula of Γ. Suppose Γ, φ ψ. Then Γ, δ(φ) δ(ψ). Call this Ibn Sīnā s Lemma. It gives exactly what he needs for the preservation of validity.

24 Ibn Sīnā is almost obsessively interested in the difference between affirmative and negative, but he normally shows no awareness of the notion of a positive occurrence. For example he has no notion of scope, and no glimmering of the laws of distribution. Nevertheless his notion of condition seems to have positivity hidden in it. In those terms, Ibn Sīnā s Lemma is a kind of statement of upwards monotonicity.

25 For Ibn Sīnā, the logical properties of propositions are mainly the result of their basic structure. For example he has no examples of valid entailments which depend on additions. He writes as if, other things being equal, making additions in a uniform way to propositions in a valid syllogism leaves the syllogism valid. For example modal syllogisms are predicative syllogisms with modalities added. His discussion of them is almost entirely about what additions of modalities will cancel the validity of the underlying predicative syllogism.

26 Ibn Sīnā often talks about the mental processing of syllogisms. He emphasises that in predicative sentences, the analysis needed for logic never goes inside the subject and the predicate. In this sense, logical rules apply only at the top syntactic level. It was always a problem for traditional logicians to see how we can make inferences that depend on deeper analysis of the propositions. Burley, Buridan, Leibniz, De Morgan all worried at this problem. Burley had the idea of induction on complexity. The others relied on paraphrases, e.g. to bring the deeper structures to the top level.

27 It seems Ibn Sīnā has a solution: Treat the upper layers of the proposition as additions, and apply the logical rules directly at the deeper level. The solution is remarkably close to Frege s. See for example Frege s construction of Begriffsschrift so that modus ponens can be applied directly to positively occurring subformulas at any depth. Frege also has signs of Ibn Sīnā s pretence that the upper syntactic levels can be ignored.