19 ideas
| 10146 | Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman] |
| Full Idea: The Axiom of Choice is a pure existence statement, without defining conditions. It was necessary to provide a foundation for Cantor's theory of transfinite cardinals and ordinal numbers, but its nonconstructive character engendered heated controversy. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int I) |
| 10147 | The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman] |
| Full Idea: In 1938 Gödel proved that the Axiom of Choice is consistent with the other axioms of set theory. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int I) | |
| A reaction: Hence people now standardly accept ZFC, rather than just ZF. |
| 10150 | The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman] |
| Full Idea: The Trichotomy Principle (any number is less, equal to, or greater than, another number) turned out to be equivalent to the Axiom of Choice. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int I) | |
| A reaction: [He credits Sierpinski (1918) with this discovery] |
| 10148 | Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman] |
| Full Idea: Zermelo's Axiom of Choice asserts that for any set of non-empty sets that (pairwise) have no elements in common, then there is a set that 'simultaneously chooses' exactly one element from each set. Note that this is an existential claim. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int I) | |
| A reaction: The Axiom is now widely accepted, after much debate in the early years. Even critics of the Axiom turn out to be relying on it. |
| 10149 | Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman] |
| Full Idea: The Axiom of Choice seems clearly true from the Platonistic point of view, independently of how sets may be defined, but is rejected by those who think such existential claims must show how to pick out or define the object claimed to exist. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int I) | |
| A reaction: The typical critics are likely to be intuitionists or formalists, who seek for both rigour and a plausible epistemology in our theory. |
| 15943 | Limitation of Size is not self-evident, and seems too strong [Lavine on Neumann] |
| Full Idea: Von Neumann's Limitation of Size axiom is not self-evident, and he himself admitted that it seemed too strong. | |
| From: comment on John von Neumann (An Axiomatization of Set Theory [1925]) by Shaughan Lavine - Understanding the Infinite VII.1 |
| 10158 | A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman] |
| Full Idea: A structure is said to be a 'model' of an axiom system if each of its axioms is true in the structure (e.g. Euclidean or non-Euclidean geometry). 'Model theory' concerns which structures are models of a given language and axiom system. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
| A reaction: This strikes me as the most interesting aspect of mathematical logic, since it concerns the ways in which syntactic proof-systems actually connect with reality. Tarski is the central theoretician here, and his theory of truth is the key. |
| 10162 | Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman] |
| Full Idea: In the late 1950s Tarski and Vaught defined and established basic properties of the relation of elementary equivalence between two structures, which holds when they make true exactly the same first-order sentences. This is fundamental to model theory. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
| A reaction: This is isomorphism, which clarifies what a model is by giving identity conditions between two models. Note that it is 'first-order', and presumably founded on classical logic. |
| 10160 | Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman] |
| Full Idea: The Löwenheim-Skolem Theorem, the earliest in model theory, states that if a countable set of sentences in a first-order language has a model, then it has a countable model. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) | |
| A reaction: There are 'upward' (sentences-to-model) and 'downward' (model-to-sentences) versions of the theory. |
| 10159 | Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman] |
| Full Idea: Before Tarski's work in the 1930s, the main results in model theory were the Löwenheim-Skolem Theorem, and Gödel's establishment in 1929 of the completeness of the axioms and rules for the classical first-order predicate (or quantificational) calculus. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) |
| 10161 | If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman] |
| Full Idea: Completeness is when, if a sentences holds in every model of a theory, then it is logically derivable from that theory. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int V) |
| 10156 | 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman] |
| Full Idea: 'Recursion theory' is the subject of what can and cannot be solved by computing machines | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Ch.9) | |
| A reaction: This because 'recursion' will grind out a result step-by-step, as long as the steps will 'halt' eventually. |
| 10155 | Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman] |
| Full Idea: In 1936 Church showed that Principia Mathematica is undecidable if it is ω-consistent, and a year later Rosser showed that Peano Arithmetic is undecidable, and any consistent extension of it. | |
| From: Feferman / Feferman (Alfred Tarski: life and logic [2004], Int IV) |
| 13672 | All the axioms for mathematics presuppose set theory [Neumann] |
| Full Idea: There is no axiom system for mathematics, geometry, and so forth that does not presuppose set theory. | |
| From: John von Neumann (An Axiomatization of Set Theory [1925]), quoted by Stewart Shapiro - Foundations without Foundationalism 8.2 | |
| A reaction: Von Neumann was doubting whether set theory could have axioms, and hence the whole project is doomed, and we face relativism about such things. His ally was Skolem in this. |
| 7658 | Obviously there can't be a functional anaylsis of qualia if they are defined by intrinsic properties [Dennett] |
| Full Idea: If you define qualia as intrinsic properties of experiences considered in isolation from all their causes and effects, logically independent of all dispositional properties, then they are logically guaranteed to elude all broad functional analysis. | |
| From: Daniel C. Dennett (Sweet Dreams [2005], Ch.8) | |
| A reaction: This is a good point - it seems daft to reify qualia and imagine them dangling in mid-air with all their vibrant qualities - but that is a long way from saying there is nothing more to qualia than functional roles. Functions must be exlained too. |
| 7655 | The work done by the 'homunculus in the theatre' must be spread amongst non-conscious agencies [Dennett] |
| Full Idea: All the work done by the imagined homunculus in the Cartesian Theater must be distributed among various lesser agencies in the brain, none of which is conscious. | |
| From: Daniel C. Dennett (Sweet Dreams [2005], Ch.3) | |
| A reaction: Dennett's account crucially depends on consciousness being much more fragmentary than most philosophers claim it to be. It is actually full of joints, which can come apart. He may be right. |
| 7657 | Intelligent agents are composed of nested homunculi, of decreasing intelligence, ending in machines [Dennett] |
| Full Idea: As long as your homunculi are more stupid and ignorant than the intelligent agent they compose, the nesting of homunculi within homunculi can be finite, bottoming out, eventually, with agents so unimpressive they can be replaced by machines. | |
| From: Daniel C. Dennett (Sweet Dreams [2005], Ch.6) | |
| A reaction: [Dennett first proposed this in 'Brainstorms' 1978]. This view was developed well by Lycan. I rate it as one of the most illuminating ideas in the modern philosophy of mind. All complex systems (like aeroplanes) have this structure. |
| 7656 | I don't deny consciousness; it just isn't what people think it is [Dennett] |
| Full Idea: I don't maintain, of course, that human consciousness does not exist; I maintain that it is not what people often think it is. | |
| From: Daniel C. Dennett (Sweet Dreams [2005], Ch.3) | |
| A reaction: I consider Dennett to be as near as you can get to an eliminativist, but he is not stupid. As far as I can see, the modern philosopher's bogey-man, the true total eliminativist, simply doesn't exist. Eliminativists usually deny propositional attitudes. |
| 7654 | What matters about neuro-science is the discovery of the functional role of the chemistry [Dennett] |
| Full Idea: Neuro-science matters because - and only because - we have discovered that the many different neuromodulators and other chemical messengers that diffuse throughout the brain have functional roles that make important differences. | |
| From: Daniel C. Dennett (Sweet Dreams [2005], Ch.1) | |
| A reaction: I agree with Dennett that this is the true ground for pessimism about spectacular breakthroughs in artificial intelligence, rather than abstract concerns about irreducible features of the mind like 'qualia' and 'rationality'. |