20 ideas
13591 | Quantified modal logic collapses if essence is withdrawn [Quine] |
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] |
23445 | Naïve set theory says any formula defines a set, and coextensive sets are identical [Linnebo] |
23447 | In classical semantics singular terms refer, and quantifiers range over domains [Linnebo] |
23444 | To investigate axiomatic theories, mathematics needs its own foundational axioms [Linnebo] |
23443 | The axioms of group theory are not assertions, but a definition of a structure [Linnebo] |
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] |
23446 | You can't prove consistency using a weaker theory, but you can use a consistent theory [Linnebo] |
23448 | Mathematics is the study of all possible patterns, and is thus bound to describe the world [Linnebo] |
23441 | Logical truth is true in all models, so mathematical objects can't be purely logical [Linnebo] |
23442 | Game Formalism has no semantics, and Term Formalism reduces the semantics [Linnebo] |
13590 | Essences can make sense in a particular context or enquiry, as the most basic predicates [Quine] |
8483 | Necessity is relative to context; it is what is assumed in an inquiry [Quine] |
13589 | Possible worlds are a way to dramatise essentialism, and yet they presuppose essentialism [Quine] |
13588 | A rigid designator (for all possible worlds) picks out an object by its essential traits [Quine] |
13592 | Beliefs can be ascribed to machines [Quine] |