18 ideas
| 13913 | The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward] |
| Full Idea: There are four 'perfect syllogisms': Barbara (every M is P, every S is M, so every S is P); Celarent (no M is P, every S is M, so no S is P); Darii (every M is P, some S is M, so some S is P); Ferio (no M is P, some S is M, so some S is not P). | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], 8) | |
| A reaction: The four names are mnemonics from medieval universities. |
| 13914 | Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward] |
| Full Idea: It has often been claimed (e.g. by Leibniz) that a single rule governs all syllogistic validity, called 'dictum de omni et null', which says that what is affirmed or denied of any whole is affirmed or denied of any part of that whole. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], 8) | |
| A reaction: This seems to be the rule which is captured by Venn Diagrams. |
| 13915 | Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward] |
| Full Idea: Three common kinds of sentence cannot be put into syllogistic ('categorical') form: ones using singular terms ('Mars is red'), ones using relational terms ('every painter owns some brushes'), and compound sentences. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], 8) |
| 13916 | Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward] |
| Full Idea: Term logic begins with expressions and two 'term functors'. Any simple letter is a 'term', any term prefixed by a minus ('-') is a 'negative term', and any pair of terms flanking a plus ('+') is a 'compound term'. Parenthese are used for grouping. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], 8) | |
| A reaction: [see Engelbretsen and Sayward for the full formal system] |
| 13850 | In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward] |
| Full Idea: One of the key ideas of modern formal logic is that all formally valid inferences can be specified in strictly syntactic terms. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], Ch.2) |
| 13849 | Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward] |
| Full Idea: Classical logic rests on the concepts of truth and falsity (and usually makes use of a semantic theory based on models), whereas constructivist logic accounts for inference in terms of defense and refutation. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], Intro) | |
| A reaction: My instincts go with the classical view, which is that inferences do not depend on the human capacity to defend them, but sit there awaiting revelation. My view isn't platonist, because I take the inferences to be rooted in the physical world. |
| 13851 | Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward] |
| Full Idea: Unlike ∨, →, ↔, and ∀, the sign = is not eliminable from a logic. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], Ch.3) |
| 14352 | '¬', '&', and 'v' are truth functions: the truth of the compound is fixed by the truth of the components [Jackson] |
| Full Idea: It is widely agreed that '¬', '&', and 'v' are 'truth functions': the truth value of a compound sentence formed using them is fully determined by the truth value or values of the component sentences. | |
| From: Frank Jackson (Conditionals [2006], 'Equiv') | |
| A reaction: A candidate for not being a truth function might be a conditional →, where the arrow adds something over and above the propositions it connects. The relationship has an additional truth value? Does A depend on B? |
| 13852 | Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward] |
| Full Idea: A set of axioms is said to be ω-incomplete if, for some universal quantification, each of its instances is derivable from those axioms but the quantification is not thus derivable. | |
| From: Engelbretsen,G/Sayward,C (Philosophical Logic: Intro to Advanced Topics [2011], 7) |
| 14360 | Possible worlds for subjunctives (and dispositions), and no-truth for indicatives? [Jackson] |
| Full Idea: Subjunctive conditionals are intimately connected with dispositional properties and causation. ...Consequently, a position some find attractive is that possible worlds theory applies to subjunctives, while the no-truth theory applies to indicatives. | |
| From: Frank Jackson (Conditionals [2006], 'Indicative') | |
| A reaction: My intuitions are to reject this and favour a unified account, where both sorts of conditionals are mappings of the relationships among the facts of actuality. Nice slogan! |
| 14353 | Modus ponens requires that A→B is F when A is T and B is F [Jackson] |
| Full Idea: Modus ponens is intuitively valid, but in A,A→B|B if A is true and B is false that must be because A→B is false. So A→B is false when A is true and B is false. | |
| From: Frank Jackson (Conditionals [2006], 'Equiv') | |
| A reaction: This is his first step in showing how the truth functional account of A→B acquires its truth table. If you are giving up the truth functional view of conditionals, presumably you are not also going to give up modus ponens? |
| 14354 | When A and B have the same truth value, A→B is true, because A→A is a logical truth [Jackson] |
| Full Idea: (A→A) is a logical truth, so some conditionals with antecedent and consequent the same truth value are true. But if '→' is a truth function, that will be true for all cases. Hence whenever A and B are alike in truth value, (A→B) is true. | |
| From: Frank Jackson (Conditionals [2006], 'Equiv') | |
| A reaction: His second step in demonstrating the truth table for →, assuming it is truth functional. |
| 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] |
| Full Idea: (A&B)→A is a logical truth, but A can be true and B false, so that (A&B) is false. So some conditionals with false antecedent and true consequent are true. If → is a truth function, then whenever A is false and B is true (A→B) is true. | |
| From: Frank Jackson (Conditionals [2006], 'Equiv') | |
| A reaction: This is his third and final step in showing the truth table of → if it is truth functional. |
| 14358 | In the possible worlds account of conditionals, modus ponens and modus tollens are validated [Jackson] |
| Full Idea: In the possible worlds account modus ponens is validated (the closest world, the actual, is a B-world just if B is true), and modus tollens is validated (if B is false, the actual world is not an A-world, so A is false). | |
| From: Frank Jackson (Conditionals [2006], 'Famous') | |
| A reaction: [see Jackson for slightly fuller versions] This looks like a minimal requirement for a decent theory of conditionals, so Jackson explains the attractions of the possible worlds view very persuasively. |
| 14359 | Only assertions have truth-values, and conditionals are not proper assertions [Jackson] |
| Full Idea: In the no-truth theory of conditionals they have justified assertion or acceptability conditions but not truth conditions. ...The motivation is that only assertions have truth values, and conditionals are arguments, not proper assertions. | |
| From: Frank Jackson (Conditionals [2006], 'No-truth') | |
| A reaction: Once I trim this idea down to its basics, it suddenly looks very persuasive. Except that I am inclined to think that conditional truths do state facts about the world - perhaps as facts about how more basic truths are related to each other. |
| 14357 | Possible worlds account, unlike A⊃B, says nothing about when A is false [Jackson] |
| Full Idea: In the possible worlds account of conditionals A⊃B is not sufficient for A→B. If A is false then A⊃B is true, but here nothing is implied about whether the world most like the actual world except that A is true is or is not a B-world. | |
| From: Frank Jackson (Conditionals [2006], 'Possible') | |
| A reaction: The possible worlds account seems to be built on Ramsey's idea of just holding A true and seeing what you get. Being committed to B being automatically true if A is false seems highly counterintuitive. |
| 14356 | We can't insist that A is relevant to B, as conditionals can express lack of relevance [Jackson] |
| Full Idea: One addition to the truth functional account of conditionals is that A be somehow relevant to B. However, sometimes we use conditionals to express lack of relevance, as in 'If Fred works he will fail, and if Fred doesn't work he will fail'. | |
| From: Frank Jackson (Conditionals [2006], 'Possible') | |
| A reaction: This certainly seems to put paid to an attractive instant solution to the problem. |
| 19699 | A Gettier case is a belief which is true, and its fallible justification involves some luck [Hetherington] |
| Full Idea: A Gettier case contains a belief which is true and well justified without being knowledge. Its justificatory support is also fallible, ...and there is considerable luck in how the belief combnes being true with being justified. | |
| From: Stephen Hetherington (The Gettier Problem [2011], 5) | |
| A reaction: This makes luck the key factor. 'Luck' is a rather vague concept, and so the sort of luck involved must first be spelled out. Or the varieties of luck that can produce this outcome. |