more from this thinker     |     more from this text


Single Idea 14273

[filed under theme 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL ]

Full Idea

Conditional Proof seems sound: 'From X and Y, it follows that Z. So from X it follows that if Y,Z'. Yet for no reading of 'if' which is stronger that the truth-functional reading is CP valid, at least if we accept ¬(A&¬B);A; therefore B.

Gist of Idea

Conditional Proof is only valid if we accept the truth-functional reading of 'if'

Source

Dorothy Edgington (Conditionals (Stanf) [2006], 2.2)

Book Ref

'Stanford Online Encyclopaedia of Philosophy', ed/tr. Stanford University [plato.stanford.edu], p.5


A Reaction

See the section of ideas on Conditionals (filed under 'Modality') for a fuller picture of this issue. Edgington offers it as one of the main arguments in favour of the truth-functional reading of 'if' (though she rejects that reading).

Related Idea

Idea 14274 Inferring conditionals from disjunctions or negated conjunctions gives support to truth-functionalism [Edgington]


The 14 ideas with the same theme [basic rules used in proofs of propositional logic]:

DN: Given A, we may derive ¬¬A [Lemmon]
A: we may assume any proposition at any stage [Lemmon]
∧E: Given A∧B, we may derive either A or B separately [Lemmon]
∧I: Given A and B, we may derive A∧B [Lemmon]
CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon]
MPP: Given A and A→B, we may derive B [Lemmon]
∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon]
RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon]
MTT: Given ¬B and A→B, we derive ¬A [Lemmon]
∨I: Given either A or B separately, we may derive A∨B [Lemmon]
Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD]
Conditional Proof is only valid if we accept the truth-functional reading of 'if' [Edgington]
Three traditional names of rules are 'Simplification', 'Addition' and 'Disjunctive Syllogism' [Read]
Deduction Theorem: T∪{P}|-Q, then T|-(P→Q), which justifies Conditional Proof [Wolf,RS]