Combining Texts

All the ideas for 'fragments/reports', 'Set Theory' and 'Axiomatic Theories of Truth (2013 ver)'

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


23 ideas

3. Truth / A. Truth Problems / 2. Defining Truth
If we define truth, we can eliminate it [Halbach/Leigh]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / b. Satisfaction and truth
If a language cannot name all objects, then satisfaction must be used, instead of unary truth [Halbach/Leigh]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / c. Meta-language for truth
Semantic theories need a powerful metalanguage, typically including set theory [Halbach/Leigh]
3. Truth / F. Semantic Truth / 2. Semantic Truth
The T-sentences are deductively weak, and also not deductively conservative [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 1. Axiomatic Truth
A natural theory of truth plays the role of reflection principles, establishing arithmetic's soundness [Halbach/Leigh]
If deflationary truth is not explanatory, truth axioms should be 'conservative', proving nothing new [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 2. FS Truth Axioms
The FS axioms use classical logical, but are not fully consistent [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 3. KF Truth Axioms
KF is formulated in classical logic, but describes non-classical truth, which allows truth-value gluts [Halbach/Leigh]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / c. Axiom of Pairing II
Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / d. Axiom of Unions III
Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Choice: ∀A ∃R (R well-orders A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
Set Existence: ∃x (x = x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / o. Axiom of Constructibility V = L
Constructibility: V = L (all sets are constructible) [Kunen]
8. Modes of Existence / B. Properties / 12. Denial of Properties
We can reduce properties to true formulas [Halbach/Leigh]
8. Modes of Existence / E. Nominalism / 1. Nominalism / c. Nominalism about abstracta
Nominalists can reduce theories of properties or sets to harmless axiomatic truth theories [Halbach/Leigh]
25. Social Practice / E. Policies / 5. Education / b. Education principles
Learned men gain more in one day than others do in a lifetime [Posidonius]
27. Natural Reality / D. Time / 1. Nature of Time / d. Time as measure
Time is an interval of motion, or the measure of speed [Posidonius, by Stobaeus]