Combining Texts

All the ideas for 'Conditionals', 'works' and 'Morals and Modals'

unexpand these ideas     |    start again     |     specify just one area for these texts


7 ideas

10. Modality / B. Possibility / 8. Conditionals / a. Conditionals
Validity can preserve certainty in mathematics, but conditionals about contingents are another matter [Edgington]
     Full Idea: If your interest in logic is confined to applications to mathematics or other a priori matters, it is fine for validity to preserve certainty, ..but if you use conditionals when arguing about contingent matters, then great caution will be required.
     From: Dorothy Edgington (Conditionals [2001], 17.2.1)
10. Modality / B. Possibility / 8. Conditionals / b. Types of conditional
There are many different conditional mental states, and different conditional speech acts [Edgington]
     Full Idea: As well as conditional beliefs, there are conditional desires, hopes, fears etc. As well as conditional statements, there are conditional commands, questions, offers, promises, bets etc.
     From: Dorothy Edgington (Conditionals [2001], 17.3.4)
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
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.
'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.
10. Modality / C. Sources of Modality / 1. Sources of Necessity
If we are told the source of necessity, this seems to be a regress if the source is not already necessary [Blackburn]
     Full Idea: If we ask why A must be the case, and A is then proved from B, that explains it if B must be so. If the eventual source cites some truth F, then if F just is so, there is strong pressure to feel that the original necessity has not been explained.
     From: Simon Blackburn (Morals and Modals [1987], 1)
     A reaction: [compressed] Ross Cameron wrote a reply to this which I like. I'm fishing for the idea that essence is the source of necessity (as Kit Fine says), but that essence itself is not necessary (as only I say, apparently!).
If something underlies a necessity, is that underlying thing necessary or contingent? [Blackburn, by Hale/Hoffmann,A]
     Full Idea: Blackburn asks of what theorists propose as underlying the necessity of a proposition, the question whether they themselves are conceived as obtaining of necessity or merely contingently.
     From: report of Simon Blackburn (Morals and Modals [1987], p.120-1) by Bob Hale/ Aviv Hoffmann - Introduction to 'Modality' 1
     A reaction: I've seen a reply to this somewhere: I think the thought was that a necessity wouldn't be any less necessary if it had a contingent source, any more than the father of a world champion boxer has to be a world champion boxer.
18. Thought / B. Mechanics of Thought / 6. Artificial Thought / c. Turing Test
A fast machine could pass all behavioural tests with a vast lookup table [Block, by Rey]
     Full Idea: Ned Block proposes a machine (a 'blockhead') which could pass the Turing Test just by looking up responses in a vast look-up table.
     From: report of Ned Block (works [1984]) by Georges Rey - Contemporary Philosophy of Mind 5.3
     A reaction: Once you suspected you were talking to a blockhead, I think you could catch it out in a Turing Test. How can the lookup table keep up to date with immediate experience? Ask it about your new poem.