75 ideas
| 17892 | For clear questions posed by reason, reason can also find clear answers [Gödel] |
| 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] |
| 17751 | Gödel proved the completeness of first order predicate logic in 1930 [Gödel, by Walicki] |
| 15413 | With four tense operators, all complex tenses reduce to fourteen basic cases [Burgess] |
| 15415 | The temporal Barcan formulas fix what exists, which seems absurd [Burgess] |
| 15430 | Is classical logic a part of intuitionist logic, or vice versa? [Burgess] |
| 15431 | It is still unsettled whether standard intuitionist logic is complete [Burgess] |
| 15429 | Relevance logic's → is perhaps expressible by 'if A, then B, for that reason' [Burgess] |
| 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] |
| 15404 | Technical people see logic as any formal system that can be studied, not a study of argument validity [Burgess] |
| 15405 | Classical logic neglects the non-mathematical, such as temporality or modality [Burgess] |
| 15427 | The Cut Rule expresses the classical idea that entailment is transitive [Burgess] |
| 15421 | Classical logic neglects counterfactuals, temporality and modality, because maths doesn't use them [Burgess] |
| 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] |
| 15403 | Philosophical logic is a branch of logic, and is now centred in computer science [Burgess] |
| 15407 | Formalising arguments favours lots of connectives; proving things favours having very few [Burgess] |
| 15424 | Asserting a disjunction from one disjunct seems odd, but can be sensible, and needed in maths [Burgess] |
| 15409 | All occurrences of variables in atomic formulas are free [Burgess] |
| 15414 | The denotation of a definite description is flexible, rather than rigid [Burgess] |
| 10042 | Reference to a totality need not refer to a conjunction of all its elements [Gödel] |
| 15406 | 'Induction' and 'recursion' on complexity prove by connecting a formula to its atomic components [Burgess] |
| 15425 | The sequent calculus makes it possible to have proof without transitivity of entailment [Burgess] |
| 15426 | We can build one expanding sequence, instead of a chain of deductions [Burgess] |
| 10620 | Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel] |
| 15408 | 'Tautologies' are valid formulas of classical sentential logic - or substitution instances in other logics [Burgess] |
| 15418 | Validity (for truth) and demonstrability (for proof) have correlates in satisfiability and consistency [Burgess] |
| 15416 | We aim to get the technical notion of truth in all models matching intuitive truth in all instances [Burgess] |
| 15412 | Models leave out meaning, and just focus on truth values [Burgess] |
| 15411 | We only need to study mathematical models, since all other models are isomorphic to these [Burgess] |
| 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] |
| 18062 | Set-theory paradoxes are no worse than sense deception in physics [Gödel] |
| 15428 | The Liar seems like a truth-value 'gap', but dialethists see it as a 'glut' [Burgess] |
| 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] |
| 10185 | Set theory is the standard background for modern mathematics [Burgess] |
| 10184 | Structuralists take the name 'R' of the reals to be a variable ranging over structures, not a structure [Burgess] |
| 10189 | There is no one relation for the real number 2, as relations differ in different models [Burgess] |
| 10186 | If set theory is used to define 'structure', we can't define set theory structurally [Burgess] |
| 10187 | Abstract algebra concerns relations between models, not common features of all the models [Burgess] |
| 10188 | How can mathematical relations be either internal, or external, or intrinsic? [Burgess] |
| 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] |
| 15420 | De re modality seems to apply to objects a concept intended for sentences [Burgess] |
| 15419 | General consensus is S5 for logical modality of validity, and S4 for proof [Burgess] |
| 15417 | Logical necessity has two sides - validity and demonstrability - which coincide in classical logic [Burgess] |
| 15422 | Three conditionals theories: Materialism (material conditional), Idealism (true=assertable), Nihilism (no truth) [Burgess] |
| 15423 | It is doubtful whether the negation of a conditional has any clear meaning [Burgess] |
| 20653 | Six reduction levels: groups, lives, cells, molecules, atoms, particles [Putnam/Oppenheim, by Watson] |
| 3192 | Basic logic can be done by syntax, with no semantics [Gödel, by Rey] |