17 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] |
| 17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
| Full Idea: There are many coherent stopping points in the hierarchy of increasingly strong mathematical systems, starting with strict finitism, and moving up through predicativism to the higher reaches of set theory. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], Intro) |
| 17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
| Full Idea: Roughly speaking, 'reflection principles' assert that anything true in V [the set hierarchy] falls short of characterising V in that it is true within some earlier level. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 2.1) |
| 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) |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| Full Idea: There is at present no solid argument to the effect that a given statement is absolutely undecidable. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 5.3) |
| 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) |
| 17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
| Full Idea: Some of the standard large cardinals (in order of increasing (logical) strength) are: inaccessible, Mahlo, weakly compact, indescribable, Erdös, measurable, strong, Wodin, supercompact, huge etc. (...and ineffable). | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) | |
| A reaction: [I don't understand how cardinals can have 'logical strength', but I pass it on anyway] |
| 17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
| Full Idea: To the extent that we are justified in accepting Peano Arithmetic we are justified in accepting its consistency, and so we know how to expand the axiom system so as to overcome the limitation [of Gödel's Second Theorem]. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.1) | |
| A reaction: Each expansion brings a limitation, but then you can expand again. |
| 17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
| Full Idea: The arithmetical instances of undecidability that arise at one stage of the hierarchy are settled at the next. | |
| From: Peter Koellner (On the Question of Absolute Undecidability [2006], 1.4) |
| 18933 | Not-Being obviously doesn't exist, and the five modes of Being are all impossible [Gorgias, by Diog. Laertius] |
| Full Idea: I. Nothing exists. a) Not-Being does not exist. b) Being does not exist as everlasting, as created, as both, as One, or as Many. II. If anything does exist, it is incomprehensible. III. If existence is comprehensible, it is incommunicable. | |
| From: report of Gorgias (fragments/reports [c.443 BCE], B03) by Diogenes Laertius - Lives of Eminent Philosophers 09 | |
| A reaction: [Also Sextus Empiricus, Against Logicians I.65-] For Part I he works through all the possible modes of being he can think of, and explains why none of them are possible. It is worth remembering that Gorgias loved rhetoric, not philosophy! |
| 5864 | Destroy seriousness with laughter, and laughter with seriousness [Gorgias] |
| Full Idea: Destroy the seriousness of others with laughter, and their laughter with seriousness. | |
| From: Gorgias (fragments/reports [c.443 BCE]), quoted by Aristotle - The Art of Rhetoric 1419b | |
| A reaction: This sounds like brilliant tactical advice, which should be on the wall of every barrister's chambers. This is a case of rhetoric having something to teach us which is nothing at all to do with truth. It is more like learning karate. |
| 9866 | Gorgias says rhetoric is the best of arts, because it enslaves without using force [Gorgias, by Plato] |
| Full Idea: Gorgias insists that the art of persuasion is superior to all others because it enslaves all the rest, with their own consent, not by force, and is therefore by far the best of all the arts. | |
| From: report of Gorgias (fragments/reports [c.443 BCE]) by Plato - Philebus 58a | |
| A reaction: A nice point, and it is not unreasonable to rank the arts in order of their power. To enchant, without achieving agreement, and to speak truth without persuading, are both very fine, but there is something about success that cannot be gainsaid. |