15 ideas
| 15544 | If what is actual might have been impossible, we need S4 modal logic [Armstrong, by 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] |
| 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] |
| 7024 | Properties are universals, which are always instantiated [Armstrong, by Heil] |
| 9478 | Even if all properties are categorical, they may be denoted by dispositional predicates [Armstrong, by Bird] |
| 10729 | Universals explain resemblance and causal power [Armstrong, by Oliver] |
| 4031 | It doesn't follow that because there is a predicate there must therefore exist a property [Armstrong] |
| 10558 | Abstract objects are actually constituted by the properties by which we conceive them [Zalta] |
| 10024 | The type-token distinction is the universal-particular distinction [Armstrong, by Hodes] |
| 10728 | A thing's self-identity can't be a universal, since we can know it a priori [Armstrong, by Oliver] |
| 10557 | Abstract objects are captured by second-order modal logic, plus 'encoding' formulas [Zalta] |