Combining Texts

All the ideas for 'Mathematical Methods in Philosophy', 'Abstract Entities' and 'Alfred Tarski: life and logic'

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


25 ideas

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 / A. Overview of Logic / 9. Philosophical Logic
Three stages of philosophical logic: syntactic (1905-55), possible worlds (1963-85), widening (1990-) [Horsten/Pettigrew]
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
Logical formalization makes concepts precise, and also shows their interrelation [Horsten/Pettigrew]
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]
Models are sets with functions and relations, and truth built up from the components [Horsten/Pettigrew]
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]
7. Existence / A. Nature of Existence / 1. Nature of Existence
If 'exist' doesn't express a property, we can hardly ask for its essence [Horsten/Pettigrew]
7. Existence / A. Nature of Existence / 4. Abstract Existence
Some abstract things have a beginning and end, so may exist in time (though not space) [Swoyer]
7. Existence / D. Theories of Reality / 1. Ontologies
Ontologists seek existence and identity conditions, and modal and epistemic status for a thing [Swoyer]
8. Modes of Existence / B. Properties / 1. Nature of Properties
Can properties exemplify other properties? [Swoyer]
9. Objects / A. Existence of Objects / 5. Simples
Quantum field theory suggests that there are, fundamentally, no individual things [Swoyer]
10. Modality / E. Possible worlds / 1. Possible Worlds / a. Possible worlds
A Tarskian model can be seen as a possible state of affairs [Horsten/Pettigrew]
The 'spheres model' was added to possible worlds, to cope with counterfactuals [Horsten/Pettigrew]
10. Modality / E. Possible worlds / 1. Possible Worlds / b. Impossible worlds
Epistemic logic introduced impossible worlds [Horsten/Pettigrew]
10. Modality / E. Possible worlds / 1. Possible Worlds / e. Against possible worlds
Possible worlds models contain sets of possible worlds; this is a large metaphysical commitment [Horsten/Pettigrew]
Using possible worlds for knowledge and morality may be a step too far [Horsten/Pettigrew]