Combining Texts

All the ideas for 'Classical Cosmology (frags)', 'Introduction to the Theory of Logic' and 'Set Theory and Its Philosophy'

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

33 ideas

4. Formal Logic / F. Set Theory ST / 1. Set Theory
10888 Sets can be defined by 'enumeration', or by 'abstraction' (based on a property) [Zalabardo]
10702 Set theory's three roles: taming the infinite, subject-matter of mathematics, and modes of reasoning [Potter]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
10889 The 'Cartesian Product' of two sets relates them by pairing every element with every element [Zalabardo]
10890 A 'partial ordering' is reflexive, antisymmetric and transitive [Zalabardo]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
10713 Usually the only reason given for accepting the empty set is convenience [Potter]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
10886 Determinacy: an object is either in a set, or it isn't [Zalabardo]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
13044 Infinity: There is at least one limit level [Potter]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / l. Axiom of Specification
10887 Specification: Determinate totals of objects always make a set [Zalabardo]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
10708 Nowadays we derive our conception of collections from the dependence between them [Potter]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
13546 The 'limitation of size' principles say whether properties collectivise depends on the number of objects [Potter]
4. Formal Logic / G. Formal Mereology / 1. Mereology
10707 Mereology elides the distinction between the cards in a pack and the suits [Potter]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
10897 A first-order 'sentence' is a formula with no free variables [Zalabardo]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
10704 We can formalize second-order formation rules, but not inference rules [Potter]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
10893 Γ |= φ for sentences if φ is true when all of Γ is true [Zalabardo]
10899 Γ |= φ if φ is true when all of Γ is true, for all structures and interpretations [Zalabardo]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
10896 Propositional logic just needs ¬, and one of ∧, ∨ and → [Zalabardo]
5. Theory of Logic / H. Proof Systems / 3. Proof from Assumptions
10703 Supposing axioms (rather than accepting them) give truths, but they are conditional [Potter]
5. Theory of Logic / I. Semantics of Logic / 1. Semantics of Logic
10898 The semantics shows how truth values depend on instantiations of properties and relations [Zalabardo]
10902 We can do semantics by looking at given propositions, or by building new ones [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
10892 We make a truth assignment to T and F, which may be true and false, but merely differ from one another [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
10895 'Logically true' (|= φ) is true for every truth-assignment [Zalabardo]
10900 Logically true sentences are true in all structures [Zalabardo]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
10894 A sentence-set is 'satisfiable' if at least one truth-assignment makes them all true [Zalabardo]
10901 Some formulas are 'satisfiable' if there is a structure and interpretation that makes them true [Zalabardo]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
10903 A structure models a sentence if it is true in the model, and a set of sentences if they are all true in the model [Zalabardo]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / c. Counting procedure
10712 If set theory didn't found mathematics, it is still needed to count infinite sets [Potter]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
17882 It is remarkable that all natural number arithmetic derives from just the Peano Axioms [Potter]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
10891 If a set is defined by induction, then proof by induction can be applied to it [Zalabardo]
8. Modes of Existence / A. Relations / 4. Formal Relations / a. Types of relation
13043 A relation is a set consisting entirely of ordered pairs [Potter]
9. Objects / B. Unity of Objects / 2. Substance / b. Need for substance
13042 If dependence is well-founded, with no infinite backward chains, this implies substances [Potter]
9. Objects / C. Structure of Objects / 8. Parts of Objects / b. Sums of parts
13041 Collections have fixed members, but fusions can be carved in innumerable ways [Potter]
10. Modality / A. Necessity / 1. Types of Modality
10709 Priority is a modality, arising from collections and members [Potter]
27. Natural Reality / E. Cosmology / 1. Cosmology
5994 Is the cosmos open or closed, mechanical or teleological, alive or inanimate, and created or eternal? [Robinson,TM, by PG]