Combining Texts

Ideas for 'fragments/reports', 'Comments on a Certain Broadsheet' and 'Intensional Logic'

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

display all the ideas for this combination of texts


4 ideas

5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
Classical logic is deliberately extensional, in order to model mathematics [Fitting]
     Full Idea: Mathematics is typically extensional throughout (we write 3+2=2+3 despite the two terms having different meanings). ..Classical first-order logic is extensional by design since it primarily evolved to model the reasoning of mathematics.
     From: Melvin Fitting (Intensional Logic [2007], §1)
5. Theory of Logic / B. Logical Consequence / 5. Modus Ponens
Modus ponens is one of five inference rules identified by the Stoics [Chrysippus, by Devlin]
     Full Idea: Modus ponens is just one of the five different inference rules identified by the Stoics.
     From: report of Chrysippus (fragments/reports [c.240 BCE]) by Keith Devlin - Goodbye Descartes Ch.2
     A reaction: Modus ponens strikes me as being more like a definition of implication than a 'rule'. Implication is what gets you from one truth to another. All the implications of a truth must also be true.
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
Every proposition is either true or false [Chrysippus, by Cicero]
     Full Idea: We hold fast to the position, defended by Chrysippus, that every proposition is either true or false.
     From: report of Chrysippus (fragments/reports [c.240 BCE]) by M. Tullius Cicero - On Fate ('De fato') 38
     A reaction: I am intrigued to know exactly how you defend this claim. It may depend what you mean by a proposition. A badly expressed proposition may have indeterminate truth, quite apart from the vague, the undecidable etc.
5. Theory of Logic / F. Referring in Logic / 3. Property (λ-) Abstraction
λ-abstraction disambiguates the scope of modal operators [Fitting]
     Full Idea: λ-abstraction can be used to abstract and disambiguate a predicate. De re is [λx◊P(x)](f) - f has the possible-P property - and de dicto is ◊[λxP(x)](f) - possibly f has the P-property. Also applies to □.
     From: Melvin Fitting (Intensional Logic [2007], §3.3)
     A reaction: Compare the Barcan formula. Originated with Church in the 1930s, and Carnap 1947, but revived by Stalnaker and Thomason 1968. Because it refers to the predicate, it has a role in intensional versions of logic, especially modal logic.