15 ideas
17884 | Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner] |
17893 | 'Reflection principles' say the whole truth about sets can't be captured [Koellner] |
10282 | Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W] |
10283 | A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W] |
10284 | There are three different standard presentations of semantics [Hodges,W] |
10285 | I |= φ means that the formula φ is true in the interpretation I [Hodges,W] |
10288 | Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W] |
10289 | Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W] |
17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
10287 | If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W] |
17890 | There are at least eleven types of large cardinal, of increasing logical strength [Koellner] |
17887 | PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner] |
17891 | Arithmetical undecidability is always settled at the next stage up [Koellner] |
10286 | A 'set' is a mathematically well-behaved class [Hodges,W] |
22591 | We know perfection when we see what is imperfect [Murdoch] |