Combining Texts

All the ideas for 'On What Grounds What', 'In Defence of Convention T' and 'Alfred Tarski: life and logic'

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


25 ideas

1. Philosophy / E. Nature of Metaphysics / 1. Nature of Metaphysics
Modern Quinean metaphysics is about what exists, but Aristotelian metaphysics asks about grounding [Schaffer,J]
1. Philosophy / E. Nature of Metaphysics / 3. Metaphysical Systems
If you tore the metaphysics out of philosophy, the whole enterprise would collapse [Schaffer,J]
2. Reason / B. Laws of Thought / 6. Ockham's Razor
We should not multiply basic entities, but we can have as many derivative entities as we like [Schaffer,J]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The Axiom of Choice is consistent with the other axioms of set theory [Feferman/Feferman]
Axiom of Choice: a set exists which chooses just one element each of any set of sets [Feferman/Feferman]
Platonist will accept the Axiom of Choice, but others want criteria of selection or definition [Feferman/Feferman]
The Trichotomy Principle is equivalent to the Axiom of Choice [Feferman/Feferman]
Cantor's theories needed the Axiom of Choice, but it has led to great controversy [Feferman/Feferman]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A structure is a 'model' when the axioms are true. So which of the structures are models? [Feferman/Feferman]
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
Löwenheim-Skolem Theorem, and Gödel's completeness of first-order logic, the earliest model theory [Feferman/Feferman]
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
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
'Recursion theory' concerns what can be solved by computing machines [Feferman/Feferman]
Both Principia Mathematica and Peano Arithmetic are undecidable [Feferman/Feferman]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
If 'there are red roses' implies 'there are roses', then 'there are prime numbers' implies 'there are numbers' [Schaffer,J]
7. Existence / C. Structure of Existence / 1. Grounding / a. Nature of grounding
Grounding is unanalysable and primitive, and is the basic structuring concept in metaphysics [Schaffer,J]
7. Existence / C. Structure of Existence / 5. Supervenience / a. Nature of supervenience
Supervenience is just modal correlation [Schaffer,J]
7. Existence / C. Structure of Existence / 7. Abstract/Concrete / a. Abstract/concrete
The cosmos is the only fundamental entity, from which all else exists by abstraction [Schaffer,J]
7. Existence / E. Categories / 4. Category Realism
Maybe categories are just the different ways that things depend on basic substances [Schaffer,J]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
There exist heaps with no integral unity, so we should accept arbitrary composites in the same way [Schaffer,J]
The notion of 'grounding' can explain integrated wholes in a way that mere aggregates can't [Schaffer,J]
10. Modality / E. Possible worlds / 1. Possible Worlds / b. Impossible worlds
Belief in impossible worlds may require dialetheism [Schaffer,J]
11. Knowledge Aims / B. Certain Knowledge / 2. Common Sense Certainty
'Moorean certainties' are more credible than any sceptical argument [Schaffer,J]
19. Language / C. Assigning Meanings / 5. Fregean Semantics
A theory of meaning comes down to translating sentences into Fregean symbolic logic [Davidson, by Macey]