27 ideas
14239 | The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley] |
14240 | The empty set is something, not nothing! [Oliver/Smiley] |
14241 | We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley] |
14242 | Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley] |
14243 | The unit set may be needed to express intersections that leave a single member [Oliver/Smiley] |
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] |
10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
14234 | If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley] |
14237 | We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
14245 | Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [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] |
14246 | If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley] |
14247 | Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley] |
7489 | Joshua said, Sun, stand thou still [Anon (Josh)] |