30 ideas
10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
10301 | The axiom of choice is controversial, but it could be replaced [Shapiro] |
10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
10588 | First-order logic is Complete, and Compact, with the Löwenheim-Skolem Theorems [Shapiro] |
10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
10298 | Some say that second-order logic is mathematics, not logic [Shapiro] |
10299 | If the aim of logic is to codify inferences, second-order logic is useless [Shapiro] |
10300 | Logical consequence can be defined in terms of the logical terminology [Shapiro] |
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] |
10290 | Second-order variables also range over properties, sets, relations or functions [Shapiro] |
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] |
10297 | The Löwenheim-Skolem theorem seems to be a defect of first-order logic [Shapiro] |
10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
10590 | Up Löwenheim-Skolem: if natural numbers satisfy wffs, then an infinite domain satisfies them [Shapiro] |
10292 | Downward Löwenheim-Skolem: if there's an infinite model, there is a countable model [Shapiro] |
10296 | The Löwenheim-Skolem Theorems fail for second-order languages with standard semantics [Shapiro] |
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] |
10294 | Second-order logic has the expressive power for mathematics, but an unworkable model theory [Shapiro] |
10591 | Logicians use 'property' and 'set' interchangeably, with little hanging on it [Shapiro] |
1748 | Archelaus was the first person to say that the universe is boundless [Archelaus, by Diog. Laertius] |
5989 | Archelaus said life began in a primeval slime [Archelaus, by Schofield] |