22 ideas
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
7746 | We don't normally think of names as having senses (e.g. we don't give definitions of them) [Searle] |
7747 | How can a proper name be correlated with its object if it hasn't got a sense? [Searle] |
7748 | 'Aristotle' means more than just 'an object that was christened "Aristotle"' [Searle] |
7749 | Reference for proper names presupposes a set of uniquely referring descriptions [Searle] |
7750 | Proper names are logically connected with their characteristics, in a loose way [Searle] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
10763 | Completeness and compactness together give axiomatizability [Tharp] |
10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
14401 | Every proposition is entirely about being [Lewis] |