Combining Philosophers

All the ideas for Anaxarchus, Jody Azzouni and Feferman / Feferman

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

25 ideas

3. Truth / B. Truthmakers / 12. Rejecting Truthmakers
12442 'Mickey Mouse is a fictional mouse' is true without a truthmaker [Azzouni]
3. Truth / H. Deflationary Truth / 1. Redundant Truth
12439 Truth is dispensable, by replacing truth claims with the sentence itself [Azzouni]
3. Truth / H. Deflationary Truth / 2. Deflationary Truth
12437 Truth lets us assent to sentences we can't explicitly exhibit [Azzouni]
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 / F. Referring in Logic / 1. Naming / e. Empty names
12446 Names function the same way, even if there is no object [Azzouni]
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 / 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 / A. Nature of Existence / 6. Criterion for Existence
12447 That all existents have causal powers is unknowable; the claim is simply an epistemic one [Azzouni]
7. Existence / D. Theories of Reality / 7. Fictionalism
12445 If fictional objects really don't exist, then they aren't abstract objects [Azzouni]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / a. Ontological commitment
12449 Modern metaphysics often derives ontology from the logical forms of sentences [Azzouni]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / b. Commitment of quantifiers
12440 If objectual quantifiers ontologically commit, so does the metalanguage for its semantics [Azzouni]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
12438 In the vernacular there is no unequivocal ontological commitment [Azzouni]
12441 We only get ontology from semantics if we have already smuggled it in [Azzouni]
9. Objects / A. Existence of Objects / 4. Impossible objects
12448 Things that don't exist don't have any properties [Azzouni]
13. Knowledge Criteria / D. Scepticism / 1. Scepticism
3061 Anaxarchus said that he was not even sure that he knew nothing [Anaxarchus, by Diog. Laertius]
27. Natural Reality / F. Chemistry / 3. Periodic Table
12450 The periodic table not only defines the elements, but also excludes other possible elements [Azzouni]