Combining Texts

All the ideas for 'fragments/reports', 'What are Sets and What are they For?' and 'A Mathematical Introduction to Logic (2nd)'

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


42 ideas

4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
'F(x)' is the unique value which F assumes for a value of x [Enderton]
'fld R' indicates the 'field' of all objects in the relation [Enderton]
'ran R' indicates the 'range' of objects being related to [Enderton]
'dom R' indicates the 'domain' of objects having a relation [Enderton]
We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
The 'powerset' of a set is all the subsets of a given set [Enderton]
Two sets are 'disjoint' iff their intersection is empty [Enderton]
A relation is 'symmetric' on a set if every ordered pair has the relation in both directions [Enderton]
A relation is 'transitive' if it can be carried over from two ordered pairs to a third [Enderton]
A 'relation' is a set of ordered pairs [Enderton]
A 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton]
A function 'maps A into B' if the relating things are set A, and the things related to are all in B [Enderton]
A function 'maps A onto B' if the relating things are set A, and the things related to are set B [Enderton]
A relation is 'reflexive' on a set if every member bears the relation to itself [Enderton]
A 'function' is a relation in which each object is related to just one other object [Enderton]
A relation satisfies 'trichotomy' if all pairs are either relations, or contain identical objects [Enderton]
A set is 'dominated' by another if a one-to-one function maps the first set into a subset of the second [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is something, not nothing! [Oliver/Smiley]
The empty set is usually derived from Separation, but it also seems to need Infinity [Oliver/Smiley]
We don't need the empty set to express non-existence, as there are other ways to do that [Oliver/Smiley]
Maybe we can treat the empty set symbol as just meaning an empty term [Oliver/Smiley]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The unit set may be needed to express intersections that leave a single member [Oliver/Smiley]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / e. Equivalence classes
We 'partition' a set into distinct subsets, according to each relation on its objects [Enderton]
An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Inference not from content, but from the fact that it was said, is 'conversational implicature' [Enderton]
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Validity is either semantic (what preserves truth), or proof-theoretic (following procedures) [Enderton]
5. Theory of Logic / G. Quantification / 6. Plural Quantification
If you only refer to objects one at a time, you need sets in order to refer to a plurality [Oliver/Smiley]
We can use plural language to refer to the set theory domain, to avoid calling it a 'set' [Oliver/Smiley]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A logical truth or tautology is a logical consequence of the empty set [Enderton]
Logical truths are true no matter what exists - but predicate calculus insists that something exists [Oliver/Smiley]
5. Theory of Logic / I. Semantics of Logic / 4. Satisfaction
A truth assignment to the components of a wff 'satisfy' it if the wff is then True [Enderton]
5. Theory of Logic / K. Features of Logics / 3. Soundness
A proof theory is 'sound' if its valid inferences entail semantic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 4. Completeness
A proof theory is 'complete' if semantically valid inferences entail proof-theoretic validity [Enderton]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Proof in finite subsets is sufficient for proof in an infinite set [Enderton]
5. Theory of Logic / K. Features of Logics / 7. Decidability
Expressions are 'decidable' if inclusion in them (or not) can be proved [Enderton]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
For a reasonable language, the set of valid wff's can always be enumerated [Enderton]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / g. Applying mathematics
If mathematics purely concerned mathematical objects, there would be no applied mathematics [Oliver/Smiley]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Sets might either represent the numbers, or be the numbers, or replace the numbers [Oliver/Smiley]
10. Modality / B. Possibility / 8. Conditionals / f. Pragmatics of conditionals
Sentences with 'if' are only conditionals if they can read as A-implies-B [Enderton]
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]