Combining Texts

All the ideas for 'Locke on Essences and Kinds', 'A Serious Proposal to the Ladies I' and 'On Formally Undecidable Propositions'

unexpand these ideas     |    start again     |     specify just one area for these texts


23 ideas

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]
     Full Idea: Gödel's proof wrought an abrupt turn in the philosophy of mathematics. We had supposed that truth, in mathematics, consisted in provability.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Willard Quine - Forward to Gödel's Unpublished
     A reaction: This explains the crisis in the early 1930s, which Tarski's theory appeared to solve.
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Gödel show that the incompleteness of set theory was a necessity [Gödel, by Hallett,M]
     Full Idea: Gödel's incompleteness results of 1931 show that all axiom systems precise enough to satisfy Hilbert's conception are necessarily incomplete.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Michael Hallett - Introduction to Zermelo's 1930 paper p.1215
     A reaction: [Hallett italicises 'necessarily'] Hilbert axioms have to be recursive - that is, everything in the system must track back to them.
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
The limitations of axiomatisation were revealed by the incompleteness theorems [Gödel, by Koellner]
     Full Idea: The inherent limitations of the axiomatic method were first brought to light by the incompleteness theorems.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Koellner - On the Question of Absolute Undecidability 1.1
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]
     Full Idea: Second Incompleteness Theorem: roughly, nice theories that include enough basic arithmetic can't prove their own consistency.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.5
     A reaction: On the face of it, this sounds less surprising than the First Theorem. Philosophers have often noticed that it seems unlikely that you could use reason to prove reason, as when Descartes just relies on 'clear and distinct ideas'.
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]
     Full Idea: Gödel showed PA cannot be proved consistent from with PA. But 'reflection principles' can be added, which are axioms partially expressing the soundness of PA, by asserting what is provable. A Global Reflection Principle asserts full soundness.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Halbach,V/Leigh,G.E. - Axiomatic Theories of Truth (2013 ver) 1.2
     A reaction: The authors point out that this needs a truth predicate within the language, so disquotational truth won't do, and there is a motivation for an axiomatic theory of truth.
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Gödel's First Theorem sabotages logicism, and the Second sabotages Hilbert's Programme [Smith,P on Gödel]
     Full Idea: Where Gödel's First Theorem sabotages logicist ambitions, the Second Theorem sabotages Hilbert's Programme.
     From: comment on Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 36
     A reaction: Neo-logicism (Crispin Wright etc.) has a strategy for evading the First Theorem.
The undecidable sentence can be decided at a 'higher' level in the system [Gödel]
     Full Idea: My undecidable arithmetical sentence ...is not at all absolutely undecidable; rather, one can always pass to 'higher' systems in which the sentence in question is decidable.
     From: Kurt Gödel (On Formally Undecidable Propositions [1931]), quoted by Peter Koellner - On the Question of Absolute Undecidability 1.1
     A reaction: [a 1931 MS] He says the reals are 'higher' than the naturals, and the axioms of set theory are higher still. The addition of a truth predicate is part of what makes the sentence become decidable.
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]
     Full Idea: Gödel's far-reaching work on the nature of logic and formal systems reveals that there can be no single consistent theory from which all mathematical truths can be derived.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.8
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Gödel showed that arithmetic is either incomplete or inconsistent [Gödel, by Rey]
     Full Idea: Gödel's theorem states that either arithmetic is incomplete, or it is inconsistent.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.7
First Incompleteness: arithmetic must always be incomplete [Gödel, by Smith,P]
     Full Idea: First Incompleteness Theorem: any properly axiomatised and consistent theory of basic arithmetic must remain incomplete, whatever our efforts to complete it by throwing further axioms into the mix.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 1.2
     A reaction: This is because it is always possible to formulate a well-formed sentence which is not provable within the theory.
Arithmetical truth cannot be fully and formally derived from axioms and inference rules [Gödel, by Nagel/Newman]
     Full Idea: The vast continent of arithmetical truth cannot be brought into systematic order by laying down a fixed set of axioms and rules of inference from which every true mathematical statement can be formally derived. For some this was a shocking revelation.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by E Nagel / JR Newman - Gödel's Proof VII.C
     A reaction: Good news for philosophy, I'd say. The truth cannot be worked out by mechanical procedures, so it needs the subtle and intuitive intelligence of your proper philosopher (Parmenides is the role model) to actually understand reality.
Gödel's Second says that semantic consequence outruns provability [Gödel, by Hanna]
     Full Idea: Gödel's Second Incompleteness Theorem says that true unprovable sentences are clearly semantic consequences of the axioms in the sense that they are necessarily true if the axioms are true. So semantic consequence outruns provability.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Robert Hanna - Rationality and Logic 5.3
First Incompleteness: a decent consistent system is syntactically incomplete [Gödel, by George/Velleman]
     Full Idea: First Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S is syntactically incomplete.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6
     A reaction: Gödel found a single sentence, effectively saying 'I am unprovable in S', which is neither provable nor refutable in S.
Second Incompleteness: a decent consistent system can't prove its own consistency [Gödel, by George/Velleman]
     Full Idea: Second Incompleteness Theorem: If S is a sufficiently powerful formal system, then if S is consistent then S cannot prove its own consistency
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by A.George / D.J.Velleman - Philosophies of Mathematics Ch.6
     A reaction: This seems much less surprising than the First Theorem (though it derives from it). It was always kind of obvious that you couldn't use reason to prove that reason works (see, for example, the Cartesian Circle).
There is a sentence which a theory can show is true iff it is unprovable [Gödel, by Smith,P]
     Full Idea: The original Gödel construction gives us a sentence that a theory shows is true if and only if it satisfies the condition of being unprovable-in-that-theory.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Peter Smith - Intro to Gödel's Theorems 20.5
'This system can't prove this statement' makes it unprovable either way [Gödel, by Clegg]
     Full Idea: An approximation of Gödel's Theorem imagines a statement 'This system of mathematics can't prove this statement true'. If the system proves the statement, then it can't prove it. If the statement can't prove the statement, clearly it still can't prove it.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Brian Clegg - Infinity: Quest to Think the Unthinkable Ch.15
     A reaction: Gödel's contribution to this simple idea seems to be a demonstration that formal arithmetic is capable of expressing such a statement.
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / d. Predicativism
Realists are happy with impredicative definitions, which describe entities in terms of other existing entities [Gödel, by Shapiro]
     Full Idea: Gödel defended impredicative definitions on grounds of ontological realism. From that perspective, an impredicative definition is a description of an existing entity with reference to other existing entities.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Stewart Shapiro - Thinking About Mathematics 5.3
     A reaction: This is why constructivists must be absolutely precise about definition, where realists only have to do their best. Compare building a car with painting a landscape.
9. Objects / D. Essence of Objects / 13. Nominal Essence
If kinds depend only on what can be observed, many underlying essences might produce the same kind [Eagle]
     Full Idea: If the kinds there are depend not on the essences of the objects but on their observed distinguishing particulars, ...then for any kind that we think there is, it is possible that there are many underlying essences which are observably indistinguishable.
     From: Antony Eagle (Locke on Essences and Kinds [2005], IV)
     A reaction: Eagle is commenting on Locke's reliance on nominal essences. This seems to be the genuine problem with jadeite and nephrite (both taken to be 'jade'), or with 'fool's gold'. This isn't an objection to Locke; it just explains the role of science.
Nominal essence are the observable properties of things [Eagle]
     Full Idea: It is clear the nominal essences really are the properties of the things which have them: they are (a subset of) the observable properties of the things.
     From: Antony Eagle (Locke on Essences and Kinds [2005], IV)
     A reaction: I think this is wrong. The surface characteristics are all that is available to us, so our classifications must be based on those, but it is on the ideas of them, not their intrinsic natures. That is empiricsm! What makes the properties 'essential'?
Nominal essence mistakenly gives equal weight to all underlying properties that produce appearances [Eagle]
     Full Idea: Nominal essence does not allow for gradations in significance for the underlying properties. Those are all essential for the object behaving as it observably does, and they must all be given equal weight when deciding what the object does.
     From: Antony Eagle (Locke on Essences and Kinds [2005], IV)
     A reaction: This is where 'scientific' essentialism comes in. If we take one object, or one kind of object, in isolation, Eagle is right. When we start to compare, and to set up controlled conditions tests, we can dig into the 'gradations' he cares about.
17. Mind and Body / C. Functionalism / 2. Machine Functionalism
Basic logic can be done by syntax, with no semantics [Gödel, by Rey]
     Full Idea: Gödel in his completeness theorem for first-order logic showed that a certain set of syntactically specifiable rules was adequate to capture all first-order valid arguments. No semantics (e.g. reference, truth, validity) was necessary.
     From: report of Kurt Gödel (On Formally Undecidable Propositions [1931]) by Georges Rey - Contemporary Philosophy of Mind 8.2
     A reaction: This implies that a logic machine is possible, but we shouldn't raise our hopes for proper rationality. Validity can be shown for purely algebraic arguments, but rationality requires truth as well as validity, and that needs propositions and semantics.
24. Political Theory / A. Basis of a State / 3. Natural Values / a. Natural freedom
If men are born free, are women born slaves? [Astell]
     Full Idea: If all men are born free, how is it that all women are born slaves?
     From: Mary Astell (A Serious Proposal to the Ladies I [1694]), quoted by Johanna Oksala - Political Philosophy: all that matters Ch.9
     A reaction: What a magnificent question for such an early date. She is said to have been the 'first British feminist'. It is not just a feminist point, but a strong objection to the idea that anyone is 'born free'. Because there is no way to tell if it is true.
26. Natural Theory / B. Natural Kinds / 4. Source of Kinds
Kinds are fixed by the essential properties of things - the properties that make it that kind of thing [Eagle]
     Full Idea: The natural thought is to think that real kinds are given only by classification on the basis of essential properties: properties that make an object the kind of thing that it is.
     From: Antony Eagle (Locke on Essences and Kinds [2005], II)
     A reaction: Circularity alert! Circularity alert! Essence gives a thing its kind - and hence we can see what the kind is? Test for a trivial property! Eagle is not unaware of these issues. Does he mean 'necessary' rather than 'essential'?