38 ideas
| 17926 | Rejecting double negation elimination undermines reductio proofs [Colyvan] |
| 17925 | Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan] |
| 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] |
| 17924 | Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan] |
| 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] |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| 17929 | Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan] |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| 17930 | Axioms are 'categorical' if all of their models are isomorphic [Colyvan] |
| 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] |
| 17928 | Ordinal numbers represent order relations [Colyvan] |
| 17923 | Intuitionists only accept a few safe infinities [Colyvan] |
| 17941 | Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan] |
| 17922 | Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan] |
| 17936 | Transfinite induction moves from all cases, up to the limit ordinal [Colyvan] |
| 17940 | Most mathematical proofs are using set theory, but without saying so [Colyvan] |
| 17931 | Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan] |
| 17932 | If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan] |
| 17943 | Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan] |
| 17939 | Mathematics can reveal structural similarities in diverse systems [Colyvan] |
| 17938 | Mathematics can show why some surprising events have to occur [Colyvan] |
| 17934 | Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan] |
| 17933 | Reductio proofs do not seem to be very explanatory [Colyvan] |
| 17935 | If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan] |
| 17942 | Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan] |
| 17937 | Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan] |
| 20239 | Unlike us, the early Greeks thought envy was a good thing, and hope a bad thing [Hesiod, by Nietzsche] |