Combining Texts

All the ideas for 'The Gettier Problem', 'Aspects of the Theory of Syntax' and 'Elements of Set Theory'

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

---

10 ideas

4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST

13201

∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton]

13204

The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [Enderton]

13206

A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton]

4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set

13200

Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton]

13199

The empty set may look pointless, but many sets can be constructed from it [Enderton]

4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets

13203

The singleton is defined using the pairing axiom (as {x,x}) [Enderton]

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII

13202

Fraenkel added Replacement, to give a theory of ordinal numbers [Enderton]

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX

13205

We can only define functions if Choice tells us which items are involved [Enderton]

13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / b. Gettier problem

19699

A Gettier case is a belief which is true, and its fallible justification involves some luck [Hetherington]

19. Language / C. Assigning Meanings / 1. Syntax

18006

Chomsky's 'interpretative semantics' says syntax comes first, and is then interpreted [Chomsky, by Magidor]