60 ideas
| 17892 | For clear questions posed by reason, reason can also find clear answers [Gödel] |
| 5750 | Consistency is modal, saying propositions are consistent if they could be true together [Melia] |
| 10041 | Impredicative Definitions refer to the totality to which the object itself belongs [Gödel] |
| 21752 | Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine] |
| 5737 | Predicate logic has connectives, quantifiers, variables, predicates, equality, names and brackets [Melia] |
| 17751 | Gödel proved the completeness of first order predicate logic in 1930 [Gödel, by Walicki] |
| 5744 | First-order predicate calculus is extensional logic, but quantified modal logic is intensional (hence dubious) [Melia] |
| 8679 | We perceive the objects of set theory, just as we perceive with our senses [Gödel] |
| 17835 | Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M] |
| 9942 | Gödel proved the classical relative consistency of the axiom V = L [Gödel, by Putnam] |
| 21716 | In simple type theory the axiom of Separation is better than Reducibility [Gödel, by Linsky,B] |
| 9188 | Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett] |
| 10035 | Mathematical Logic is a non-numerical branch of mathematics, and the supreme science [Gödel] |
| 10042 | Reference to a totality need not refer to a conjunction of all its elements [Gödel] |
| 5740 | Second-order logic needs second-order variables and quantification into predicate position [Melia] |
| 10620 | Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel] |
| 5741 | If every model that makes premises true also makes conclusion true, the argument is valid [Melia] |
| 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] |
| 17883 | Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner] |
| 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] |
| 10038 | A logical system needs a syntactical survey of all possible expressions [Gödel] |
| 6007 | If you know your father, but don't recognise your father veiled, you know and don't know the same person [Eubulides, by Dancy,R] |
| 18062 | Set-theory paradoxes are no worse than sense deception in physics [Gödel] |
| 6006 | If you say truly that you are lying, you are lying [Eubulides, by Dancy,R] |
| 6008 | Removing one grain doesn't destroy a heap, so a heap can't be destroyed [Eubulides, by Dancy,R] |
| 10132 | There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman] |
| 10046 | The generalized Continuum Hypothesis asserts a discontinuity in cardinal numbers [Gödel] |
| 10868 | The Continuum Hypothesis is not inconsistent with the axioms of set theory [Gödel, by Clegg] |
| 13517 | If set theory is consistent, we cannot refute or prove the Continuum Hypothesis [Gödel, by Hart,WD] |
| 17885 | Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner] |
| 10614 | The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel] |
| 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] |
| 10039 | Some arithmetical problems require assumptions which transcend arithmetic [Gödel] |
| 10043 | Mathematical objects are as essential as physical objects are for perception [Gödel] |
| 10271 | Basic mathematics is related to abstract elements of our empirical ideas [Gödel] |
| 10045 | Impredicative definitions are admitted into ordinary mathematics [Gödel] |
| 8747 | Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro] |
| 5736 | No sort of plain language or levels of logic can express modal facts properly [Melia] |
| 5735 | Maybe names and predicates can capture any fact [Melia] |
| 5746 | The Identity of Indiscernibles is contentious for qualities, and trivial for non-qualities [Melia] |
| 5738 | We may be sure that P is necessary, but is it necessarily necessary? [Melia] |
| 5732 | 'De re' modality is about things themselves, 'de dicto' modality is about propositions [Melia] |
| 5739 | Sometimes we want to specify in what ways a thing is possible [Melia] |
| 5734 | Possible worlds make it possible to define necessity and counterfactuals without new primitives [Melia] |
| 5742 | In possible worlds semantics the modal operators are treated as quantifiers [Melia] |
| 5743 | If possible worlds semantics is not realist about possible worlds, logic becomes merely formal [Melia] |
| 5749 | Possible worlds could be real as mathematics, propositions, properties, or like books [Melia] |
| 5751 | The truth of propositions at possible worlds are implied by the world, just as in books [Melia] |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |
| 5748 | We accept unverifiable propositions because of simplicity, utility, explanation and plausibility [Melia] |