20 ideas
10911 | Part-whole is the key relation among truth-makers [Mulligan/Simons/Smith] |
10906 | Moments (objects which cannot exist alone) may serve as truth-makers [Mulligan/Simons/Smith] |
10909 | Truth-makers cannot be the designata of the sentences they make true [Mulligan/Simons/Smith] |
10907 | The truth-maker for a sentence may not be unique, or may be a combination, or several separate items [Mulligan/Simons/Smith] |
10912 | Despite negative propositions, truthmakers are not logical complexes, but ordinary experiences [Mulligan/Simons/Smith] |
10908 | Correspondence has to invoke facts or states of affairs, just to serve as truth-makers [Mulligan/Simons/Smith] |
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] |
13373 | Typically, paradoxes are dealt with by dividing them into two groups, but the division is wrong [Priest,G] |
13368 | The 'least indefinable ordinal' is defined by that very phrase [Priest,G] |
13370 | 'x is a natural number definable in less than 19 words' leads to contradiction [Priest,G] |
13369 | By diagonalization we can define a real number that isn't in the definable set of reals [Priest,G] |
13366 | The least ordinal greater than the set of all ordinals is both one of them and not one of them [Priest,G] |
13367 | The next set up in the hierarchy of sets seems to be both a member and not a member of it [Priest,G] |
13371 | If you know that a sentence is not one of the known sentences, you know its truth [Priest,G] |
13372 | There are Liar Pairs, and Liar Chains, which fit the same pattern as the basic Liar [Priest,G] |
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] |