14 ideas
| 15527 | Defining terms either enables elimination, or shows that they don't require elimination [Lewis] |
| 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] |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| 18119 | Mathematics is a mental activity which does not use language [Brouwer, by Bostock] |
| 18118 | Brouwer regards the application of mathematics to the world as somehow 'wicked' [Brouwer, by Bostock] |
| 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] |
| 15530 | A logically determinate name names the same thing in every possible world [Lewis] |
| 15531 | The Ramsey sentence of a theory says that it has at least one realisation [Lewis] |
| 15528 | A Ramsey sentence just asserts that a theory can be realised, without saying by what [Lewis] |
| 15526 | There is a method for defining new scientific terms just using the terms we already understand [Lewis] |
| 15529 | It is better to have one realisation of a theory than many - but it may not always be possible [Lewis] |