Combining Texts

Ideas for 'fragments/reports', 'Introduction to Mathematical Logic' and 'Set Theory and its Logic'

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

display all the ideas for this combination of texts


9 ideas

4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
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).
Post proved the consistency of propositional logic in 1921 [Walicki]
     Full Idea: A proof of the consistency of propositional logic was given by Emil Post in 1921.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2.1)
Propositional language can only relate statements as the same or as different [Walicki]
     Full Idea: Propositional language is very rudimentary and has limited powers of expression. The only relation between various statements it can handle is that of identity and difference. As are all the same, but Bs can be different from As.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 7 Intro)
     A reaction: [second sentence a paraphrase] In predicate logic you could represent two statements as being the same except for one element (an object or predicate or relation or quantifier).
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
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.
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Boolean connectives are interpreted as functions on the set {1,0} [Walicki]
     Full Idea: Boolean connectives are interpreted as functions on the set {1,0}.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 5.1)
     A reaction: 1 and 0 are normally taken to be true (T) and false (F). Thus the functions output various combinations of true and false, which are truth tables.
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is useful for defining sets by properties, when the members are not yet known [Walicki]
     Full Idea: The empty set is mainly a mathematical convenience - defining a set by describing the properties of its members in an involved way, we may not know from the very beginning what its members are.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1)
The empty set avoids having to take special precautions in case members vanish [Walicki]
     Full Idea: Without the assumption of the empty set, one would often have to take special precautions for the case where a set happened to contain no elements.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1)
     A reaction: Compare the introduction of the concept 'zero', where special precautions are therefore required. ...But other special precautions are needed without zero. Either he pays us, or we pay him, or ...er. Intersecting sets need the empty set.
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / p. Axiom of Reducibility
Reducibility undermines type ramification, and is committed to the existence of functions [Quine, by Linsky,B]
     Full Idea: Quine charges that the axiom of Reducibility both undoes the effect of the ramification, and commits the theory to a platonist view of propositional functions (which is a theory of sets, once use/mention confusions are cleared up).
     From: report of Willard Quine (Set Theory and its Logic [1963], p.249-58) by Bernard Linsky - Russell's Metaphysical Logic 6.1
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
Ordinals play the central role in set theory, providing the model of well-ordering [Walicki]
     Full Idea: Ordinals play the central role in set theory, providing the paradigmatic well-orderings.
     From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3)
     A reaction: When you draw the big V of the iterative hierarchy of sets (built from successive power sets), the ordinals are marked as a single line up the middle, one ordinal for each level.