Combining Philosophers

All the ideas for Richard Price, Thoralf Skolem and Feferman / Feferman

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

18 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
17879 Axiomatising set theory makes it all relative [Skolem]
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]
10146 Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
4. Formal Logic / F. Set Theory ST / 8. Critique of Set Theory
13536 Skolem did not believe in the existence of uncountable sets [Skolem]
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]
17878 If a 1st-order proposition is satisfied, it is satisfied in a denumerably infinite domain [Skolem]
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 / B. Foundations for Mathematics / 1. Foundations for Mathematics
17880 Integers and induction are clear as foundations, but set-theory axioms certainly aren't [Skolem]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / b. Against mathematical platonism
17881 Mathematician want performable operations, not propositions about objects [Skolem]
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / c. Ethical intuitionism
7258 The forefather of modern intuitionism is Richard Price [Price,R, by Dancy,J]