Combining Texts

All the ideas for 'A Pragmatic Conception of the A Priori', 'Alfred Tarski: life and logic' and 'In Defense of a Dogma'

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

20 ideas

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 / 1. Overview of Logic
9358 There are several logics, none of which will ever derive falsehoods from truth [Lewis,CI]
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
9357 Excluded middle is just our preference for a simplified dichotomy in experience [Lewis,CI]
5. Theory of Logic / F. Referring in Logic / 1. Naming / a. Names
9364 Names represent a uniformity in experience, or they name nothing [Lewis,CI]
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]
10. Modality / A. Necessity / 11. Denial of Necessity
9362 Necessary truths are those we will maintain no matter what [Lewis,CI]
12. Knowledge Sources / A. A Priori Knowledge / 7. A Priori from Convention
9365 We can maintain a priori principles come what may, but we can also change them [Lewis,CI]
18. Thought / E. Abstraction / 2. Abstracta by Selection
9361 We have to separate the mathematical from physical phenomena by abstraction [Lewis,CI]
19. Language / A. Nature of Meaning / 8. Synonymy
7319 If we give up synonymy, we have to give up significance, meaning and sense [Grice/Strawson]
26. Natural Theory / D. Laws of Nature / 8. Scientific Essentialism / a. Scientific essentialism
9363 Science seeks classification which will discover laws, essences, and predictions [Lewis,CI]