31 ideas
| 13838 | A decent modern definition should always imply a semantics [Hacking] |
| 18806 | Frege thought traditional categories had psychological and linguistic impurities [Frege, by Rumfitt] |
| 13833 | 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking] |
| 13834 | Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking] |
| 13835 | Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking] |
| 13845 | The various logics are abstractions made from terms like 'if...then' in English [Hacking] |
| 13840 | First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking] |
| 13844 | A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking] |
| 13842 | Second-order completeness seems to need intensional entities and possible worlds [Hacking] |
| 14249 | Boolos reinterprets second-order logic as plural logic [Boolos, by Oliver/Smiley] |
| 10830 | Second-order logic metatheory is set-theoretic, and second-order validity has set-theoretic problems [Boolos] |
| 10829 | A sentence can't be a truth of logic if it asserts the existence of certain sets [Boolos] |
| 13837 | With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking] |
| 13839 | Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking] |
| 8490 | First-level functions have objects as arguments; second-level functions take functions as arguments [Frege] |
| 8492 | Relations are functions with two arguments [Frege] |
| 10832 | '∀x x=x' only means 'everything is identical to itself' if the range of 'everything' is fixed [Boolos] |
| 13843 | If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking] |
| 10834 | Weak completeness: if it is valid, it is provable. Strong: it is provable from a set of sentences [Boolos] |
| 13841 | Why should compactness be definitive of logic? [Boolos, by Hacking] |
| 10833 | Many concepts can only be expressed by second-order logic [Boolos] |
| 8487 | Arithmetic is a development of logic, so arithmetical symbolism must expand into logical symbolism [Frege] |
| 18899 | Frege takes the existence of horses to be part of their concept [Frege, by Sommers] |
| 4028 | Frege allows either too few properties (as extensions) or too many (as predicates) [Mellor/Oliver on Frege] |
| 8489 | The concept 'object' is too simple for analysis; unlike a function, it is an expression with no empty place [Frege] |
| 9947 | Concepts are the ontological counterparts of predicative expressions [Frege, by George/Velleman] |
| 10319 | An assertion about the concept 'horse' must indirectly speak of an object [Frege, by Hale] |
| 8488 | A concept is a function whose value is always a truth-value [Frege] |
| 9948 | Unlike objects, concepts are inherently incomplete [Frege, by George/Velleman] |
| 4972 | I may regard a thought about Phosphorus as true, and the same thought about Hesperus as false [Frege] |
| 8491 | The Ontological Argument fallaciously treats existence as a first-level concept [Frege] |