Combining Philosophers

All the ideas for Antiphon, Michle Friend and Herbert B. Enderton

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


83 ideas

2. Reason / D. Definition / 8. Impredicative Definition
An 'impredicative' definition seems circular, because it uses the term being defined [Friend]
2. Reason / D. Definition / 10. Stipulative Definition
Classical definitions attempt to refer, but intuitionist/constructivist definitions actually create objects [Friend]
2. Reason / E. Argument / 5. Reductio ad Absurdum
Reductio ad absurdum proves an idea by showing that its denial produces contradiction [Friend]
3. Truth / A. Truth Problems / 8. Subjective Truth
Anti-realists see truth as our servant, and epistemically contrained [Friend]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Until the 1960s the only semantics was truth-tables [Enderton]
In classical/realist logic the connectives are defined by truth-tables [Friend]
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Double negation elimination is not valid in intuitionist logic [Friend]
4. Formal Logic / E. Nonclassical Logics / 6. Free Logic
Free logic was developed for fictional or non-existent objects [Friend]
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
∈ says the whole set is in the other; ⊆ says the members of the subset are in the other [Enderton]
A 'linear or total ordering' must be transitive and satisfy trichotomy [Enderton]
The 'ordered pair' <x,y> is defined to be {{x}, {x,y}} [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 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]
A 'proper subset' of A contains only members of A, but not all of them [Friend]
A 'powerset' is all the subsets of a set [Friend]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
Note that {Φ} =/= Φ, because Φ ∈ {Φ} but Φ ∉ Φ [Enderton]
The empty set may look pointless, but many sets can be constructed from it [Enderton]
Set theory makes a minimum ontological claim, that the empty set exists [Friend]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / c. Unit (Singleton) Sets
The singleton is defined using the pairing axiom (as {x,x}) [Enderton]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / d. Infinite Sets
Infinite sets correspond one-to-one with a subset [Friend]
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]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
Major set theories differ in their axioms, and also over the additional axioms of choice and infinity [Friend]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
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
We can only define functions if Choice tells us which items are involved [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 / D. Assumptions for Logic / 2. Excluded Middle
The law of excluded middle is syntactic; it just says A or not-A, not whether they are true or false [Friend]
5. Theory of Logic / G. Quantification / 7. Unorthodox Quantification
Intuitionists read the universal quantifier as "we have a procedure for checking every..." [Friend]
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]
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / a. Set theory paradoxes
Paradoxes can be solved by talking more loosely of 'classes' instead of 'sets' [Friend]
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / c. Burali-Forti's paradox
The Burali-Forti paradox asks whether the set of all ordinals is itself an ordinal [Friend]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / b. Types of number
The 'integers' are the positive and negative natural numbers, plus zero [Friend]
The 'rational' numbers are those representable as fractions [Friend]
A number is 'irrational' if it cannot be represented as a fraction [Friend]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / c. Priority of numbers
The natural numbers are primitive, and the ordinals are up one level of abstraction [Friend]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / f. Cardinal numbers
Cardinal numbers answer 'how many?', with the order being irrelevant [Friend]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
The 'real' numbers (rationals and irrationals combined) is the Continuum, which has no gaps [Friend]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / h. Ordinal infinity
Raising omega to successive powers of omega reveal an infinity of infinities [Friend]
The first limit ordinal is omega (greater, but without predecessor), and the second is twice-omega [Friend]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / j. Infinite divisibility
Between any two rational numbers there is an infinite number of rational numbers [Friend]
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
Is mathematics based on sets, types, categories, models or topology? [Friend]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
Most mathematical theories can be translated into the language of set theory [Friend]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
The number 8 in isolation from the other numbers is of no interest [Friend]
In structuralism the number 8 is not quite the same in different structures, only equivalent [Friend]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / b. Varieties of structuralism
Are structures 'ante rem' (before reality), or are they 'in re' (grounded in physics)? [Friend]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / c. Nominalist structuralism
Structuralist says maths concerns concepts about base objects, not base objects themselves [Friend]
Structuralism focuses on relations, predicates and functions, with objects being inessential [Friend]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / d. Platonist structuralism
'In re' structuralism says that the process of abstraction is pattern-spotting [Friend]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / b. Against mathematical platonism
The big problem for platonists is epistemic: how do we perceive, intuit, know or detect mathematical facts? [Friend]
6. Mathematics / C. Sources of Mathematics / 4. Mathematical Empiricism / b. Indispensability of mathematics
Mathematics should be treated as true whenever it is indispensable to our best physical theory [Friend]
6. Mathematics / C. Sources of Mathematics / 7. Formalism
Formalism is unconstrained, so cannot indicate importance, or directions for research [Friend]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / a. Constructivism
Constructivism rejects too much mathematics [Friend]
6. Mathematics / C. Sources of Mathematics / 10. Constructivism / b. Intuitionism
Intuitionists typically retain bivalence but reject the law of excluded middle [Friend]
9. Objects / A. Existence of Objects / 2. Abstract Objects / a. Nature of abstracta
Structuralists call a mathematical 'object' simply a 'place in a structure' [Friend]
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]
17. Mind and Body / E. Mind as Physical / 2. Reduction of Mind
Studying biology presumes the laws of chemistry, and it could never contradict them [Friend]
18. Thought / D. Concepts / 1. Concepts / a. Nature of concepts
Concepts can be presented extensionally (as objects) or intensionally (as a characterization) [Friend]
22. Metaethics / A. Ethics Foundations / 2. Source of Ethics / j. Ethics by convention
We should follow the law in public, and nature in private [Antiphon]
To gain the greatest advantage only treat law as important when other people are present [Antiphon]
23. Ethics / C. Virtue Theory / 2. Elements of Virtue Theory / e. Character
The way you spend your time will form your character [Antiphon]
24. Political Theory / D. Ideologies / 2. Anarchism
Nothing is worse for mankind than anarchy [Antiphon]