3425
|
Reduction has been defined as deriving one theory from another by logic and maths [Nagel,E, by Kim]
|
|
Full Idea:
Ernest Nagel defines reduction as the possibility of deriving all laws of one theory by logic and mathematics to another theory, with appropriate 'bridging principles' (either definitions, or empirical laws) connecting the expressions of the two theories.
|
|
From:
report of Ernest Nagel (The Structure of Science [1961]) by Jaegwon Kim - Philosophy of Mind p.213
|
|
A reaction:
This has been labelled as 'weak' reduction, where 'strong' reduction would be identity, as when lightning is reduced to electrical discharge. You reduce x by showing that it is y in disguise.
|
13764
|
Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? [Edgington]
|
|
Full Idea:
Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? Are they non-truth-functional, like 'because' or 'before'? Do the values of A and B, in some cases, leave open the value of 'If A,B'?
|
|
From:
Dorothy Edgington (Conditionals [2001], 17.1)
|
|
A reaction:
I would say they are not truth-functional, because the 'if' asserts some further dependency relation that goes beyond the truth or falsity of A and B. Logical ifs, causal ifs, psychological ifs... The material conditional ⊃ is truth-functional.
|
13765
|
'If A,B' must entail ¬(A & ¬B); otherwise we could have A true, B false, and If A,B true, invalidating modus ponens [Edgington]
|
|
Full Idea:
If it were possible to have A true, B false, and If A,B true, it would be unsafe to infer B from A and If A,B: modus ponens would thus be invalid. Hence 'If A,B' must entail ¬(A & ¬B).
|
|
From:
Dorothy Edgington (Conditionals [2001], 17.1)
|
|
A reaction:
This is a firm defence of part of the truth-functional view of conditionals, and seems unassailable. The other parts of the truth table are open to question, though, if A is false, or they are both true.
|