Combining Texts

All the ideas for 'fragments/reports', 'Elements of Geometry' and 'A Mathematical Introduction to Logic (2nd)'

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


43 ideas

2. Reason / E. Argument / 6. Conclusive Proof
Proof reveals the interdependence of truths, as well as showing their certainty [Euclid, by Frege]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / c. Derivations rules of PC
If you pick an arbitrary triangle, things proved of it are true of all triangles [Euclid, by Lemmon]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
'dom R' indicates the 'domain' of objects having a relation [Enderton]
'fld R' indicates the 'field' of all objects in the relation [Enderton]
'ran R' indicates the 'range' of objects being related to [Enderton]
We write F:A→B to indicate that A maps into B (the output of F on A is in B) [Enderton]
'F(x)' is the unique value which F assumes for a value of x [Enderton]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
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]
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 'domain' of a relation is the set of members of ordered pairs in the relation [Enderton]
A 'relation' is a set of ordered pairs [Enderton]
A 'function' is a relation in which each object is related to just one other object [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 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 / e. Equivalence classes
An 'equivalence relation' is a reflexive, symmetric and transitive binary relation [Enderton]
We 'partition' a set into distinct subsets, according to each relation on its objects [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 / I. Semantics of Logic / 3. Logical Truth
A logical truth or tautology is a logical consequence of the empty set [Enderton]
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 / 2. Geometry
Euclid's geometry is synthetic, but Descartes produced an analytic version of it [Euclid, by Resnik]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / b. Types of number
An assumption that there is a largest prime leads to a contradiction [Euclid, by Brown,JR]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / m. One
A unit is that according to which each existing thing is said to be one [Euclid]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Postulate 2 says a line can be extended continuously [Euclid, by Shapiro]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
Euclid relied on obvious properties in diagrams, as well as on his axioms [Potter on Euclid]
Euclid's parallel postulate defines unique non-intersecting parallel lines [Euclid, by Friend]
Euclid needs a principle of continuity, saying some lines must intersect [Shapiro on Euclid]
Euclid says we can 'join' two points, but Hilbert says the straight line 'exists' [Euclid, by Bernays]
Modern geometries only accept various parts of the Euclid propositions [Russell on Euclid]
6. Mathematics / B. Foundations for Mathematics / 5. Definitions of Number / b. Greek arithmetic
Euclid's common notions or axioms are what we must have if we are to learn anything at all [Euclid, by Roochnik]
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]
13. Knowledge Criteria / E. Relativism / 2. Knowledge as Convention
By nature people are close to one another, but culture drives them apart [Hippias]