Combining Texts

All the ideas for 'Croce and Collingwood', 'Alfred Tarski: life and logic' and 'Plural Quantification Exposed'

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


21 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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
A comprehension axiom is 'predicative' if the formula has no bound second-order variables [Linnebo]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
A 'pure logic' must be ontologically innocent, universal, and without presuppositions [Linnebo]
5. Theory of Logic / G. Quantification / 6. Plural Quantification
Plural quantification depends too heavily on combinatorial and set-theoretic considerations [Linnebo]
Can second-order logic be ontologically first-order, with all the benefits of second-order? [Linnebo]
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]
9. Objects / A. Existence of Objects / 1. Physical Objects
The modern concept of an object is rooted in quantificational logic [Linnebo]
21. Aesthetics / A. Aesthetic Experience / 1. Aesthetics
By 1790 aestheticians were mainly trying to explain individual artistic genius [Kemp]
21. Aesthetics / B. Nature of Art / 4. Art as Expression
Expression can be either necessary for art, or sufficient for art (or even both) [Kemp]
We don't already know what to express, and then seek means of expressing it [Kemp]
The horror expressed in some works of art could equallly be expressed by other means [Kemp]