25 ideas
| 9470 | Modal logic is not an extensional language [Parsons,C] |
| Full Idea: Modal logic is not an extensional language. | |
| From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.159 n8) | |
| A reaction: [I record this for investigation. Possible worlds seem to contain objects] |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| Full Idea: The main objection to the axiom of choice was that it had to be given by some law or definition, but since sets are arbitrary this seems irrelevant. Formalists consider it meaningless, but set-theorists consider it as true, and practically obvious. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) |
| 13418 | The old problems with the axiom of choice are probably better ascribed to the law of excluded middle [Parsons,C] |
| Full Idea: The difficulties historically attributed to the axiom of choice are probably better ascribed to the law of excluded middle. | |
| From: Charles Parsons (Review of Tait 'Provenance of Pure Reason' [2009], §2) | |
| A reaction: The law of excluded middle was a target for the intuitionists, so presumably the debate went off in that direction. |
| 10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
| Full Idea: One can distinguish at least two quite different senses of logic: as an instrument of demonstration, and perhaps as an instrument for the characterization of structures. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: This is trying to capture the proof-theory and semantic aspects, but merely 'characterizing' something sounds like a rather feeble aspiration for the semantic side of things. Isn't it to do with truth, rather than just rule-following? |
| 10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
| Full Idea: Elementary logic cannot characterize the usual mathematical structures, but seems to be distinguished by its completeness. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| Full Idea: The expressive power of second-order logic is too great to admit a proof procedure, but is adequate to express set-theoretical statements, and open questions such as the continuum hypothesis or the existence of big cardinals are easily stated. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
| Full Idea: In sentential logic there is a simple proof that all truth functions, of any number of arguments, are definable from (say) 'not' and 'and'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §0) | |
| A reaction: The point of 'say' is that it can be got down to two connectives, and these are just the usual preferred pair. |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| Full Idea: The symbols ∀ and ∃ may, to start with, be regarded as extrapolations of the truth functional connectives ∧ ('and') and ∨ ('or') to infinite domains. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §5) |
| 9469 | Substitutional existential quantifier may explain the existence of linguistic entities [Parsons,C] |
| Full Idea: I argue (against Quine) that the existential quantifier substitutionally interpreted has a genuine claim to express a concept of existence, which may give the best account of linguistic abstract entities such as propositions, attributes, and classes. | |
| From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
| A reaction: Intuitively I have my doubts about this, since the whole thing sounds like a verbal and conventional game, rather than anything with a proper ontology. Ruth Marcus and Quine disagree over this one. |
| 9468 | On the substitutional interpretation, '(∃x) Fx' is true iff a closed term 't' makes Ft true [Parsons,C] |
| Full Idea: For the substitutional interpretation of quantifiers, a sentence of the form '(∃x) Fx' is true iff there is some closed term 't' of the language such that 'Ft' is true. For the objectual interpretation some object x must exist such that Fx is true. | |
| From: Charles Parsons (A Plea for Substitutional Quantification [1971], p.156) | |
| A reaction: How could you decide if it was true for 't' if you didn't know what object 't' referred to? |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| Full Idea: One might add to one's logic an 'uncountable quantifier', or a 'Chang quantifier', or a 'two-argument quantifier', or 'Shelah's quantifier', or 'branching quantifiers'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) | |
| A reaction: [compressed - just listed for reference, if you collect quantifiers, like collecting butterflies] |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| Full Idea: The Löwenheim-Skolem property seems to be undesirable, in that it states a limitation concerning the distinctions the logic is capable of making, such as saying there are uncountably many reals ('Skolem's Paradox'). | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| Full Idea: Skolem deduced from the Löwenheim-Skolem theorem that 'the absolutist conceptions of Cantor's theory' are 'illusory'. I think it is clear that this conclusion would not follow even if elementary logic were in some sense the true logic, as Skolem assumed. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §7) | |
| A reaction: [Tharp cites Skolem 1962 p.47] Kit Fine refers to accepters of this scepticism about the arithmetic of infinities as 'Skolemites'. |
| 10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
| Full Idea: Soundness would seem to be an essential requirement of a proof procedure, since there is little point in proving formulas which may turn out to be false under some interpretation. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10763 | Completeness and compactness together give axiomatizability [Tharp] |
| Full Idea: Putting completeness and compactness together, one has axiomatizability. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §1) |
| 10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
| Full Idea: In general, if completeness fails there is no algorithm to list the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: I.e. the theory is not effectively enumerable. |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| Full Idea: It is strange that compactness is often ignored in discussions of philosophy of logic, since the most important theories have infinitely many axioms. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: An example of infinite axioms is the induction schema in first-order Peano Arithmetic. |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| Full Idea: The compactness condition seems to state some weakness of the logic (as if it were futile to add infinitely many hypotheses). To look at it another way, formalizations of (say) arithmetic will admit of non-standard models. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
| Full Idea: A complete logic has an effective enumeration of the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
| Full Idea: Despite completeness, the mere existence of an effective enumeration of the valid formulas will not, by itself, provide knowledge. For example, one might be able to prove that there is an effective enumeration, without being able to specify one. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: The point is that completeness is supposed to ensure knowledge (of what is valid but unprovable), and completeness entails effective enumerability, but more than the latter is needed to do the key job. |
| 17447 | Parsons says counting is tagging as first, second, third..., and converting the last to a cardinal [Parsons,C, by Heck] |
| Full Idea: In Parsons's demonstrative model of counting, '1' means the first, and counting says 'the first, the second, the third', where one is supposed to 'tag' each object exactly once, and report how many by converting the last ordinal into a cardinal. | |
| From: report of Charles Parsons (Frege's Theory of Numbers [1965]) by Richard G. Heck - Cardinality, Counting and Equinumerosity 3 | |
| A reaction: This sounds good. Counting seems to rely on that fact that numbers can be both ordinals and cardinals. You don't 'convert' at the end, though, because all the way you mean 'this cardinality in this order'. |
| 18201 | General principles can be obvious in mathematics, but bold speculations in empirical science [Parsons,C] |
| Full Idea: The existence of very general principles in mathematics are universally regarded as obvious, where on an empiricist view one would expect them to be bold hypotheses, about which a prudent scientist would maintain reserve. | |
| From: Charles Parsons (Mathematical Intuition [1980], p.152), quoted by Penelope Maddy - Naturalism in Mathematics | |
| A reaction: This is mainly aimed at Quine's and Putnam's indispensability (to science) argument about mathematics. |
| 13419 | If functions are transfinite objects, finitists can have no conception of them [Parsons,C] |
| Full Idea: The finitist may have no conception of function, because functions are transfinite objects. | |
| From: Charles Parsons (Review of Tait 'Provenance of Pure Reason' [2009], §4) | |
| A reaction: He is offering a view of Tait's. Above my pay scale, but it sounds like a powerful objection to the finitist view. Maybe there is a finitist account of functions that could be given? |
| 13417 | If a mathematical structure is rejected from a physical theory, it retains its mathematical status [Parsons,C] |
| Full Idea: If experience shows that some aspect of the physical world fails to instantiate a certain mathematical structure, one will modify the theory by sustituting a different structure, while the original structure doesn't lose its status as part of mathematics. | |
| From: Charles Parsons (Review of Tait 'Provenance of Pure Reason' [2009], §2) | |
| A reaction: This seems to be a beautifully simple and powerful objection to the Quinean idea that mathematics somehow only gets its authority from physics. It looked like a daft view to begin with, of course. |
| 16745 | No one even knows the nature and properties of a fly - why it has that colour, or so many feet [Bacon,R] |
| Full Idea: No one is so wise regarding the natural world as to know with certainty all the truths that concern the nature and properties of a single fly, or to know the proper causes of its color and why it has so many feet, neither more nor less. | |
| From: Roger Bacon (Opus Maius (major works) [1254], I.10), quoted by Robert Pasnau - Metaphysical Themes 1274-1671 23.6 | |
| A reaction: Pasnau quotes this in the context of 'occult' qualities. It is scientific essentialism, because Bacon clearly takes it that the explanation of these things would be found within the essence of the fly, if we could only get at it. |