Combining Philosophers

All the ideas for Luitzen E.J. Brouwer, Paul Ricoeur and Feferman / Feferman

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

23 ideas

1. Philosophy / H. Continental Philosophy / 3. Hermeneutics
5438 Hermeneutics of tradition is sympathetic, hermeneutics of suspicion is hostile [Ricoeur, by Mautner]
4. Formal Logic / E. Nonclassical Logics / 7. Paraconsistency
12452 Our dislike of contradiction in logic is a matter of psychology, not mathematics [Brouwer]
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]
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
15941 For intuitionists excluded middle is an outdated historical convention [Brouwer]
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 / 1. Mathematics
18119 Mathematics is a mental activity which does not use language [Brouwer, by Bostock]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / h. Reals from Cauchy
18247 Brouwer saw reals as potential, not actual, and produced by a rule, or a choice [Brouwer, by Shapiro]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / g. Applying mathematics
18118 Brouwer regards the application of mathematics to the world as somehow 'wicked' [Brouwer, by Bostock]
12451 Scientific laws largely rest on the results of counting and measuring [Brouwer]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / b. Intuitionism
12454 Intuitionists only accept denumerable sets [Brouwer]
12453 Neo-intuitionism abstracts from the reuniting of moments, to intuit bare two-oneness [Brouwer]
8728 Intuitionist mathematics deduces by introspective construction, and rejects unknown truths [Brouwer]
19. Language / A. Nature of Meaning / 5. Meaning as Verification
10117 Intuitonists in mathematics worried about unjustified assertion, as well as contradiction [Brouwer, by George/Velleman]