13 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] |
| 10429 | It is best to say that a name designates iff there is something for it to designate [Sainsbury] |
| 10425 | Definite descriptions may not be referring expressions, since they can fail to refer [Sainsbury] |
| 10438 | Definite descriptions are usually rigid in subject, but not in predicate, position [Sainsbury] |
| 17894 | We have no argument to show a statement is absolutely undecidable [Koellner] |
| 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] |
| 22591 | We know perfection when we see what is imperfect [Murdoch] |
| 10432 | A new usage of a name could arise from a mistaken baptism of nothing [Sainsbury] |
| 10434 | Even a quantifier like 'someone' can be used referentially [Sainsbury] |
| 10431 | Things are thought to have a function, even when they can't perform them [Sainsbury] |