27 ideas
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
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] |
10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
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] |
23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
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] |
23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
12314 | Audience-relative explanation, or metaphysical explanation based on information? [Stanford] |
12313 | Explanation is for curiosity, control, understanding, to make meaningful, or to give authority [Stanford] |
12315 | We can explain by showing constitution, as well as showing causes [Stanford] |