Combining Philosophers

All the ideas for Mary Wollstonecraft, D.J. O'Connor and Feferman / Feferman

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

21 ideas

3. Truth / A. Truth Problems / 5. Truth Bearers
3745 Must sentences make statements to qualify for truth? [O'Connor]
3. Truth / C. Correspondence Truth / 1. Correspondence Truth
3742 Beliefs must match facts, but also words must match beliefs [O'Connor]
3. Truth / F. Semantic Truth / 2. Semantic Truth
3744 The semantic theory requires sentences as truth-bearers, not propositions [O'Connor]
3749 What does 'true in English' mean? [O'Connor]
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 / A. Overview of Logic / 4. Pure Logic
3746 Logic seems to work for unasserted sentences [O'Connor]
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]
7. Existence / B. Change in Existence / 4. Events / c. Reduction of events
3747 Events are fast changes which are of interest to us [O'Connor]
11. Knowledge Aims / A. Knowledge / 4. Belief / a. Beliefs
3748 Without language our beliefs are particular and present [O'Connor]
3743 We can't contemplate our beliefs until we have expressed them [O'Connor]
24. Political Theory / D. Ideologies / 12. Feminism
21006 If women share rights with men, they will exhibit similar virtues [Wollstonecraft]