Combining Texts

All the ideas for 'Saundaranandakavya', 'Alfred Tarski: life and logic' and 'Understanding and Essence'

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

23 ideas

1. Philosophy / D. Nature of Philosophy / 2. Invocation to Philosophy
7910 Pursue truth with the urgency of someone whose clothes are on fire [Ashvaghosha]
1. Philosophy / F. Analytic Philosophy / 4. Conceptual Analysis
19259 If 2-D conceivability can a priori show possibilities, this is a defence of conceptual analysis [Vaidya]
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 / 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]
9. Objects / D. Essence of Objects / 7. Essence and Necessity / c. Essentials are necessary
19262 Essential properties are necessary, but necessary properties may not be essential [Vaidya]
10. Modality / D. Knowledge of Modality / 4. Conceivable as Possible / a. Conceivable as possible
19267 Define conceivable; how reliable is it; does inconceivability help; and what type of possibility results? [Vaidya]
10. Modality / D. Knowledge of Modality / 4. Conceivable as Possible / c. Possible but inconceivable
19268 Inconceivability (implying impossibility) may be failure to conceive, or incoherence [Vaidya]
11. Knowledge Aims / A. Knowledge / 2. Understanding
19265 Can you possess objective understanding without realising it? [Vaidya]
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / b. Gettier problem
19260 Gettier deductive justifications split the justification from the truthmaker [Vaidya]
19266 In a disjunctive case, the justification comes from one side, and the truth from the other [Vaidya]
18. Thought / C. Content / 1. Content
19264 Aboutness is always intended, and cannot be accidental [Vaidya]
29. Religion / C. Spiritual Disciplines / 3. Buddhism
7909 The Eightfold Path concerns morality, wisdom, and tranquillity [Ashvaghosha]
29. Religion / D. Religious Issues / 2. Immortality / d. Heaven
7908 At the end of a saint, he is not located in space, but just ceases to be disturbed [Ashvaghosha]