Combining Texts

All the ideas for 'Defending the Axioms', 'Is Mathematics purely Linguistic?' and 'Alfred Tarski: life and logic'

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

20 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
10147 The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman]
10148 Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman]
10149 Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman]
10150 The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman]
17610 The Axiom of Choice paradoxically allows decomposing a sphere into two identical spheres [Maddy]
10146 Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
5. Theory of Logic / C. Ontology of Logic / 3. If-Thenism
17620 Critics of if-thenism say that not all starting points, even consistent ones, are worth studying [Maddy]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10158 A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
10162 Tarski and Vaught established the equivalence relations between first-order structures [Feferman/Feferman]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
10160 Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
10159 Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
17605 Hilbert's geometry and Dedekind's real numbers were role models for axiomatization [Maddy]
17625 If two mathematical themes coincide, that suggest a single deep truth [Maddy]
5. Theory of Logic / K. Features of Logics / 4. Completeness
10161 If a sentence holds in every model of a theory, then it is logically derivable from the theory [Feferman/Feferman]
5. Theory of Logic / K. Features of Logics / 7. Decidability
10156 'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
10155 Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / g. Continuum Hypothesis
17615 Every infinite set of reals is either countable or of the same size as the full set of reals [Maddy]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
17618 Set-theory tracks the contours of mathematical depth and fruitfulness [Maddy]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / c. Against mathematical empiricism
17614 The connection of arithmetic to perception has been idealised away in modern infinitary mathematics [Maddy]
6. Mathematics / C. Sources of Mathematics / 7. Formalism
21570 Numbers are just verbal conveniences, which can be analysed away [Russell]