Combining Philosophers

All the ideas for Hermarchus, Wilfrid Hodges and Kurt Gdel

expand these ideas     |    start again     |     specify just one area for these philosophers


57 ideas

2. Reason / A. Nature of Reason / 1. On Reason
For clear questions posed by reason, reason can also find clear answers [Gödel]
2. Reason / D. Definition / 7. Contextual Definition
The idea that groups of concepts could be 'implicitly defined' was abandoned [Hodges,W]
2. Reason / D. Definition / 8. Impredicative Definition
Impredicative Definitions refer to the totality to which the object itself belongs [Gödel]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / a. Tarski's truth definition
Prior to Gödel we thought truth in mathematics consisted in provability [Gödel, by Quine]
4. Formal Logic / C. Predicate Calculus PC / 3. Completeness of PC
Gödel proved the completeness of first order predicate logic in 1930 [Gödel, by Walicki]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
We perceive the objects of set theory, just as we perceive with our senses [Gödel]
Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / o. Axiom of Constructibility V = L
Gödel proved the classical relative consistency of the axiom V = L [Gödel, by Putnam]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / p. Axiom of Reducibility
In simple type theory the axiom of Separation is better than Reducibility [Gödel, by Linsky,B]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is the study of sound argument, or of certain artificial languages (or applying the latter to the former) [Hodges,W]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
Since first-order languages are complete, |= and |- have the same meaning [Hodges,W]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Gödel proved that first-order logic is complete, and second-order logic incomplete [Gödel, by Dummett]
5. Theory of Logic / A. Overview of Logic / 8. Logic of Mathematics
Mathematical Logic is a non-numerical branch of mathematics, and the supreme science [Gödel]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
|= in model-theory means 'logical consequence' - it holds in all models [Hodges,W]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
Reference to a totality need not refer to a conjunction of all its elements [Gödel]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
A formula needs an 'interpretation' of its constants, and a 'valuation' of its variables [Hodges,W]
There are three different standard presentations of semantics [Hodges,W]
I |= φ means that the formula φ is true in the interpretation I [Hodges,W]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
Originally truth was viewed with total suspicion, and only demonstrability was accepted [Gödel]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
|= should be read as 'is a model for' or 'satisfies' [Hodges,W]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
Model theory studies formal or natural language-interpretation using set-theory [Hodges,W]
A 'structure' is an interpretation specifying objects and classes of quantification [Hodges,W]
Models in model theory are structures, not sets of descriptions [Hodges,W]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Down Löwenheim-Skolem: if a countable language has a consistent theory, that has a countable model [Hodges,W]
Up Löwenheim-Skolem: if infinite models, then arbitrarily large models [Hodges,W]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner]
5. Theory of Logic / K. Features of Logics / 2. Consistency
Second Incompleteness: nice theories can't prove their own consistency [Gödel, by Smith,P]
5. Theory of Logic / K. Features of Logics / 3. Soundness
If soundness can't be proved internally, 'reflection principles' can be added to assert soundness [Gödel, by Halbach/Leigh]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Gödel's Theorems did not refute the claim that all good mathematical questions have answers [Gödel, by Koellner]
Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel]
The undecidable sentence can be decided at a 'higher' level in the system [Gödel]
5. Theory of Logic / K. Features of Logics / 6. Compactness
If a first-order theory entails a sentence, there is a finite subset of the theory which entails it [Hodges,W]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
A logical system needs a syntactical survey of all possible expressions [Gödel]
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / a. Set theory paradoxes
Set-theory paradoxes are no worse than sense deception in physics [Gödel]
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
There can be no single consistent theory from which all mathematical truths can be derived [Gödel, by George/Velleman]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / g. Continuum Hypothesis
The generalized Continuum Hypothesis asserts a discontinuity in cardinal numbers [Gödel]
The Continuum Hypothesis is not inconsistent with the axioms of set theory [Gödel, by Clegg]
If set theory is consistent, we cannot refute or prove the Continuum Hypothesis [Gödel, by Hart,WD]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
First-order logic can't discriminate between one infinite cardinal and another [Hodges,W]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Gödel eventually hoped for a generalised completeness theorem leaving nothing undecidable [Gödel, by Koellner]
The real reason for Incompleteness in arithmetic is inability to define truth in a language [Gödel]
Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey]
First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P]
Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman]
Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna]
First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman]
Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman]
There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P]
'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg]
Some arithmetical problems require assumptions which transcend arithmetic [Gödel]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
A 'set' is a mathematically well-behaved class [Hodges,W]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
Mathematical objects are as essential as physical objects are for perception [Gödel]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / a. Mathematical empiricism
Basic mathematics is related to abstract elements of our empirical ideas [Gödel]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
Impredicative definitions are admitted into ordinary mathematics [Gödel]
Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro]
17. Mind and Body / C. Functionalism / 2. Machine Functionalism
Basic logic can be done by syntax, with no semantics [Gödel, by Rey]
25. Social Practice / F. Life Issues / 6. Animal Rights
Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley]