14 ideas
| 8758 | We could talk of open sentences, instead of sets [Chihara, by Shapiro] |
| 14352 | '¬', '&', and 'v' are truth functions: the truth of the compound is fixed by the truth of the components [Jackson] |
| 10265 | Chihara's system is a variant of type theory, from which he can translate sentences [Chihara, by Shapiro] |
| 8759 | We can replace type theory with open sentences and a constructibility quantifier [Chihara, by Shapiro] |
| 10264 | Introduce a constructibility quantifiers (Cx)Φ - 'it is possible to construct an x such that Φ' [Chihara, by Shapiro] |
| 14360 | Possible worlds for subjunctives (and dispositions), and no-truth for indicatives? [Jackson] |
| 14353 | Modus ponens requires that A→B is F when A is T and B is F [Jackson] |
| 14354 | When A and B have the same truth value, A→B is true, because A→A is a logical truth [Jackson] |
| 14355 | (A&B)→A is a logical truth, even if antecedent false and consequent true, so it is T if A is F and B is T [Jackson] |
| 14358 | In the possible worlds account of conditionals, modus ponens and modus tollens are validated [Jackson] |
| 14359 | Only assertions have truth-values, and conditionals are not proper assertions [Jackson] |
| 14357 | Possible worlds account, unlike A⊃B, says nothing about when A is false [Jackson] |
| 14356 | We can't insist that A is relevant to B, as conditionals can express lack of relevance [Jackson] |
| 7628 | Broad rejects the inferential component of the representative theory [Broad, by Maund] |