36 ideas
| 4036 | What matters is not how many entities we postulate, but how many kinds of entities [Armstrong, by Mellor/Oliver] |
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| 17886 | The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner] |
| 10071 | Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P] |
| 19123 | If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh] |
| 10621 | Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel] |
| 17888 | The undecidable sentence can be decided at a 'higher' level in the system [Gödel] |
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| 3198 | Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey] |
| 10072 | First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P] |
| 9590 | Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman] |
| 11069 | Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna] |
| 10118 | First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman] |
| 10122 | Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman] |
| 10611 | There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P] |
| 10867 | 'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg] |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| 15754 | Without properties we would be unable to express the laws of nature [Armstrong] |
| 4034 | Whether we apply 'cold' or 'hot' to an object is quite separate from its change of temperature [Armstrong] |
| 8535 | To the claim that every predicate has a property, start by eliminating failure of application of predicate [Armstrong] |
| 8537 | Tropes fall into classes, because exact similarity is symmetrical and transitive [Armstrong] |
| 8538 | Trope theory needs extra commitments, to symmetry and non-transitivity, unless resemblance is exact [Armstrong] |
| 8539 | Universals are required to give a satisfactory account of the laws of nature [Armstrong] |
| 8529 | Deniers of properties and relations rely on either predicates or on classes [Armstrong] |
| 8532 | Resemblances must be in certain 'respects', and they seem awfully like properties [Armstrong] |
| 8530 | Change of temperature in objects is quite independent of the predicates 'hot' and 'cold' [Armstrong] |
| 8536 | We want to know what constituents of objects are grounds for the application of predicates [Armstrong] |
| 8531 | In most sets there is no property common to all the members [Armstrong] |
| 15753 | Essences might support Resemblance Nominalism, but they are too coarse and ill-defined [Armstrong] |
| 18284 | Particulars can be verified or falsified, but general statements can only be falsified (conclusively) [Popper] |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
| 8533 | Predicates need ontological correlates to ensure that they apply [Armstrong] |
| 4035 | There must be some explanation of why certain predicates are applicable to certain objects [Armstrong] |
| 8541 | Regularities theories are poor on causal connections, counterfactuals and probability [Armstrong] |
| 8540 | The introduction of sparse properties avoids the regularity theory's problem with 'grue' [Armstrong] |