Combining Texts

Ideas for 'works', 'Philosophical Logic: Intro to Advanced Topics' and 'Db (lexicon)'

unexpand these ideas     |    start again     |     choose another area for these texts

display all the ideas for this combination of texts

---

4 ideas

4. Formal Logic / A. Syllogistic Logic / 1. Aristotelian Logic

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.

4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic

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)

4. Formal Logic / A. Syllogistic Logic / 3. Term Logic

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]