display all the ideas for this combination of texts
7 ideas
8077 | Stoic propositional logic is like chemistry - how atoms make molecules, not the innards of atoms [Chrysippus, by Devlin] |
Full Idea: In Stoic logic propositions are treated the way atoms are treated in present-day chemistry, where the focus is on the way atoms fit together to form molecules, rather than on the internal structure of the atoms. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by Keith Devlin - Goodbye Descartes Ch.2 | |
A reaction: A nice analogy to explain the nature of Propositional Logic, which was invented by the Stoics (N.B. after Aristotle had invented predicate logic). |
20791 | Chrysippus has five obvious 'indemonstrables' of reasoning [Chrysippus, by Diog. Laertius] |
Full Idea: Chrysippus has five indemonstrables that do not need demonstration:1) If 1st the 2nd, but 1st, so 2nd; 2) If 1st the 2nd, but not 2nd, so not 1st; 3) Not 1st and 2nd, the 1st, so not 2nd; 4) 1st or 2nd, the 1st, so not 2nd; 5) 1st or 2nd, not 2nd, so 1st. | |
From: report of Chrysippus (fragments/reports [c.240 BCE]) by Diogenes Laertius - Lives of Eminent Philosophers 07.80-81 | |
A reaction: [from his lost text 'Dialectics'; squashed to fit into one quote] 1) is Modus Ponens, 2) is Modus Tollens. 4) and 5) are Disjunctive Syllogisms. 3) seems a bit complex to be an indemonstrable. |
10888 | Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo] |
Full Idea: We can define a set by 'enumeration' (by listing the items, within curly brackets), or by 'abstraction' (by specifying the elements as instances of a property), pretending that they form a determinate totality. The latter is written {x | x is P}. | |
From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) |
10889 | The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo] |
Full Idea:
The 'Cartesian Product' of two sets, written A x B, is the relation which pairs every element of A with every element of B. So A x B = { |
|
From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
10890 | A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo] |
Full Idea: A binary relation in a set is a 'partial ordering' just in case it is reflexive, antisymmetric and transitive. | |
From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.6) |
10886 | Determinacy: an object is either in a set, or it isn't [Zalabardo] |
Full Idea: Principle of Determinacy: For every object a and every set S, either a is an element of S or a is not an element of S. | |
From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.2) |
10887 | Specification: Determinate totals of objects always make a set [Zalabardo] |
Full Idea: Principle of Specification: Whenever we can specify a determinate totality of objects, we shall say that there is a set whose elements are precisely the objects that we have specified. | |
From: José L. Zalabardo (Introduction to the Theory of Logic [2000], §1.3) | |
A reaction: Compare the Axiom of Specification. Zalabardo says we may wish to consider sets of which we cannot specify the members. |