11 ideas
| 15527 | Defining terms either enables elimination, or shows that they don't require elimination [Lewis] |
| 8720 | A logic is 'relevant' if premise and conclusion are connected, and 'paraconsistent' allows contradictions [Priest,G, by Friend] |
| 13768 | Validity can preserve certainty in mathematics, but conditionals about contingents are another matter [Edgington] |
| 13770 | There are many different conditional mental states, and different conditional speech acts [Edgington] |
| 13764 | Are conditionals truth-functional - do the truth values of A and B determine the truth value of 'If A, B'? [Edgington] |
| 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] |
| 15530 | A logically determinate name names the same thing in every possible world [Lewis] |
| 15531 | The Ramsey sentence of a theory says that it has at least one realisation [Lewis] |
| 15528 | A Ramsey sentence just asserts that a theory can be realised, without saying by what [Lewis] |
| 15526 | There is a method for defining new scientific terms just using the terms we already understand [Lewis] |
| 15529 | It is better to have one realisation of a theory than many - but it may not always be possible [Lewis] |