Combining Philosophers

All the ideas for Hermarchus, Feferman / Feferman and John von Neumann

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

23 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
3340 Von Neumann defines each number as the set of all smaller numbers [Neumann, by Blackburn]
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 / 5. Conceptions of Set / f. Limitation of Size
15943 Limitation of Size is not self-evident, and seems too strong [Lavine on Neumann]
4. Formal Logic / F. Set Theory ST / 8. Critique of Set Theory
3355 Von Neumann wanted mathematical functions to replace sets [Neumann, by Benardete,JA]
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
10159 Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
10160 Löwenheim-Skolem says if the sentences are countable, so is the model [Feferman/Feferman]
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 / 3. Nature of Numbers / c. Priority of numbers
13489 Von Neumann treated cardinals as a special sort of ordinal [Neumann, by Hart,WD]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
12336 A von Neumann ordinal is a transitive set with transitive elements [Neumann, by Badiou]
22716 Von Neumann defined ordinals as the set of all smaller ordinals [Neumann, by Poundstone]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / g. Von Neumann numbers
18179 For Von Neumann the successor of n is n U {n} (rather than {n}) [Neumann, by Maddy]
18180 Von Neumann numbers are preferred, because they continue into the transfinite [Maddy on Neumann]
15925 Each Von Neumann ordinal number is the set of its predecessors [Neumann, by Lavine]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
13672 All the axioms for mathematics presuppose set theory [Neumann]
25. Social Practice / F. Life Issues / 6. Animal Rights
6005 Animals are dangerous and nourishing, and can't form contracts of justice [Hermarchus, by Sedley]