Combining Texts

All the ideas for 'Alfred Tarski: life and logic', 'The Philosophy of Mathematics' and 'Hobbes'

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 / a. Axioms for sets
ZF set theory has variables which range over sets, 'equals' and 'member', and extensionality [Dummett]
The main alternative to ZF is one which includes looser classes as well as sets [Dummett]
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 / D. Assumptions for Logic / 2. Excluded Middle
Intuitionists reject excluded middle, not for a third value, but for possibility of proof [Dummett]
5. Theory of Logic / G. Quantification / 5. Second-Order Quantification
First-order logic concerns objects; second-order adds properties, kinds, relations and functions [Dummett]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
Logical truths and inference are characterized either syntactically or semantically [Dummett]
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 says if the sentences are countable, so is the model [Feferman/Feferman]
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
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 / A. Nature of Mathematics / 3. Nature of Numbers / c. Priority of numbers
Ordinals seem more basic than cardinals, since we count objects in sequence [Dummett]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / e. Structuralism critique
The number 4 has different positions in the naturals and the wholes, with the same structure [Dummett]
13. Knowledge Criteria / D. Scepticism / 1. Scepticism
Without confidence in our beliefs, how should we actually live? [Tuck]