Combining Texts

All the ideas for 'Dialectic of Enlightenment', 'What Required for Foundation for Maths?' and 'Intro to Non-Classical Logic (1st ed)'

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


60 ideas

1. Philosophy / H. Continental Philosophy / 5. Critical Theory
Adorno and Horkheimer subjected the Enlightenment to 'critical theory' analysis [Adorno/Horkheimer, by Finlayson]
2. Reason / D. Definition / 2. Aims of Definition
Definitions make our intuitions mathematically useful [Mayberry]
2. Reason / E. Argument / 6. Conclusive Proof
Proof shows that it is true, but also why it must be true [Mayberry]
4. Formal Logic / E. Nonclassical Logics / 6. Free Logic
Free logic is one of the few first-order non-classical logics [Priest,G]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / a. Symbols of ST
X1 x X2 x X3... x Xn indicates the 'cartesian product' of those sets [Priest,G]
<a,b&62; is a set whose members occur in the order shown [Priest,G]
a ∈ X says a is an object in set X; a ∉ X says a is not in X [Priest,G]
{x; A(x)} is a set of objects satisfying the condition A(x) [Priest,G]
{a1, a2, ...an} indicates that a set comprising just those objects [Priest,G]
Φ indicates the empty set, which has no members [Priest,G]
{a} is the 'singleton' set of a (not the object a itself) [Priest,G]
X⊂Y means set X is a 'proper subset' of set Y [Priest,G]
X⊆Y means set X is a 'subset' of set Y [Priest,G]
X = Y means the set X equals the set Y [Priest,G]
X ∩ Y indicates the 'intersection' of sets X and Y, the objects which are in both sets [Priest,G]
X∪Y indicates the 'union' of all the things in sets X and Y [Priest,G]
Y - X is the 'relative complement' of X with respect to Y; the things in Y that are not in X [Priest,G]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / b. Terminology of ST
The 'relative complement' is things in the second set not in the first [Priest,G]
The 'intersection' of two sets is a set of the things that are in both sets [Priest,G]
The 'union' of two sets is a set containing all the things in either of the sets [Priest,G]
The 'induction clause' says complex formulas retain the properties of their basic formulas [Priest,G]
A 'singleton' is a set with only one member [Priest,G]
A 'member' of a set is one of the objects in the set [Priest,G]
An 'ordered pair' (or ordered n-tuple) is a set with its members in a particular order [Priest,G]
A 'cartesian product' of sets is the set of all the n-tuples with one member in each of the sets [Priest,G]
A 'set' is a collection of objects [Priest,G]
The 'empty set' or 'null set' has no members [Priest,G]
A set is a 'subset' of another set if all of its members are in that set [Priest,G]
A 'proper subset' is smaller than the containing set [Priest,G]
4. Formal Logic / F. Set Theory ST / 2. Mechanics of Set Theory / c. Basic theorems of ST
The empty set Φ is a subset of every set (including itself) [Priest,G]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry]
There is a semi-categorical axiomatisation of set-theory [Mayberry]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Limitation of size is part of the very conception of a set [Mayberry]
5. Theory of Logic / A. Overview of Logic / 2. History of Logic
The mainstream of modern logic sees it as a branch of mathematics [Mayberry]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
First-order logic only has its main theorems because it is so weak [Mayberry]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Only second-order logic can capture mathematical structure up to isomorphism [Mayberry]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry]
Axiomatiation relies on isomorphic structures being essentially the same [Mayberry]
'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry]
5. Theory of Logic / K. Features of Logics / 6. Compactness
No logic which can axiomatise arithmetic can be compact or complete [Mayberry]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / b. Quantity
Greek quantities were concrete, and ratio and proportion were their science [Mayberry]
Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry]
Cantor extended the finite (rather than 'taming the infinite') [Mayberry]
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
If proof and definition are central, then mathematics needs and possesses foundations [Mayberry]
The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry]
Foundations need concepts, definition rules, premises, and proof rules [Mayberry]
Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry]
We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry]
Set theory is not just another axiomatised part of mathematics [Mayberry]
9. Objects / A. Existence of Objects / 2. Abstract Objects / a. Nature of abstracta
Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry]
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / b. Rational ethics
De Sade said it was impossible to rationally argue against murder [Adorno/Horkheimer]