Combining Philosophers

All the ideas for Engelbretsen,G/Sayward,C, Mark Colyvan and Keith Hossack

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


58 ideas

4. Formal Logic / A. Syllogistic Logic / 1. Aristotelian Logic
The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward]
Syllogistic logic has one rule: what is affirmed/denied of wholes is affirmed/denied of their parts [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 2. Syllogistic Logic
Syllogistic can't handle sentences with singular terms, or relational terms, or compound sentences [Engelbretsen/Sayward]
4. Formal Logic / A. Syllogistic Logic / 3. Term Logic
Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward]
4. Formal Logic / E. Nonclassical Logics / 2. Intuitionist Logic
Showing a disproof is impossible is not a proof, so don't eliminate double negation [Colyvan]
Rejecting double negation elimination undermines reductio proofs [Colyvan]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The Axiom of Choice is a non-logical principle of set-theory [Hossack]
The Axiom of Choice guarantees a one-one correspondence from sets to ordinals [Hossack]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / d. Naïve logical sets
Predicativism says only predicated sets exist [Hossack]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / e. Iterative sets
The iterative conception has to appropriate Replacement, to justify the ordinals [Hossack]
4. Formal Logic / F. Set Theory ST / 5. Conceptions of Set / f. Limitation of Size
Limitation of Size justifies Replacement, but then has to appropriate Power Set [Hossack]
4. Formal Logic / F. Set Theory ST / 8. Critique of Set Theory
Maybe we reduce sets to ordinals, rather than the other way round [Hossack]
4. Formal Logic / G. Formal Mereology / 3. Axioms of Mereology
Extensional mereology needs two definitions and two axioms [Hossack]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward]
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
Excluded middle says P or not-P; bivalence says P is either true or false [Colyvan]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / d. and
The connective 'and' can have an order-sensitive meaning, as 'and then' [Hossack]
5. Theory of Logic / E. Structures of Logic / 6. Relations in Logic
'Before' and 'after' are not two relations, but one relation with two orders [Hossack]
5. Theory of Logic / F. Referring in Logic / 2. Descriptions / b. Definite descriptions
Plural definite descriptions pick out the largest class of things that fit the description [Hossack]
5. Theory of Logic / G. Quantification / 6. Plural Quantification
Plural reference will refer to complex facts without postulating complex things [Hossack]
Plural reference is just an abbreviation when properties are distributive, but not otherwise [Hossack]
A plural comprehension principle says there are some things one of which meets some condition [Hossack]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
Löwenheim proved his result for a first-order sentence, and Skolem generalised it [Colyvan]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
Axioms are 'categorical' if all of their models are isomorphic [Colyvan]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward]
5. Theory of Logic / L. Paradox / 5. Paradoxes in Set Theory / d. Russell's paradox
Plural language can discuss without inconsistency things that are not members of themselves [Hossack]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
The theory of the transfinite needs the ordinal numbers [Hossack]
Ordinal numbers represent order relations [Colyvan]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
I take the real numbers to be just lengths [Hossack]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Intuitionists only accept a few safe infinities [Colyvan]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / h. Ordinal infinity
Transfinite ordinals are needed in proof theory, and for recursive functions and computability [Hossack]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / j. Infinite divisibility
Infinitesimals were sometimes zero, and sometimes close to zero [Colyvan]
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
Reducing real numbers to rationals suggested arithmetic as the foundation of maths [Colyvan]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / e. Peano arithmetic 2nd-order
A plural language gives a single comprehensive induction axiom for arithmetic [Hossack]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
Transfinite induction moves from all cases, up to the limit ordinal [Colyvan]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / a. Mathematics is set theory
In arithmetic singularists need sets as the instantiator of numeric properties [Hossack]
Set theory is the science of infinity [Hossack]
Most mathematical proofs are using set theory, but without saying so [Colyvan]
6. Mathematics / B. Foundations for Mathematics / 6. Mathematics as Set Theory / b. Mathematics is not set theory
Numbers are properties, not sets (because numbers are magnitudes) [Hossack]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / a. Structuralism
Structuralism say only 'up to isomorphism' matters because that is all there is to it [Colyvan]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / e. Structuralism critique
If 'in re' structures relies on the world, does the world contain rich enough structures? [Colyvan]
6. Mathematics / C. Sources of Mathematics / 1. Mathematical Platonism / a. For mathematical platonism
We can only mentally construct potential infinities, but maths needs actual infinities [Hossack]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / a. Ontological commitment
We are committed to a 'group' of children, if they are sitting in a circle [Hossack]
9. Objects / C. Structure of Objects / 5. Composition of an Object
Complex particulars are either masses, or composites, or sets [Hossack]
The relation of composition is indispensable to the part-whole relation for individuals [Hossack]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
The fusion of five rectangles can decompose into more than five parts that are rectangles [Hossack]
Leibniz's Law argues against atomism - water is wet, unlike water molecules [Hossack]
14. Science / C. Induction / 6. Bayes's Theorem
Probability supports Bayesianism better as degrees of belief than as ratios of frequencies [Colyvan]
14. Science / D. Explanation / 2. Types of Explanation / e. Lawlike explanations
Mathematics can reveal structural similarities in diverse systems [Colyvan]
14. Science / D. Explanation / 2. Types of Explanation / f. Necessity in explanations
Mathematics can show why some surprising events have to occur [Colyvan]
14. Science / D. Explanation / 2. Types of Explanation / m. Explanation by proof
Proof by cases (by 'exhaustion') is said to be unexplanatory [Colyvan]
Reductio proofs do not seem to be very explanatory [Colyvan]
If inductive proofs hold because of the structure of natural numbers, they may explain theorems [Colyvan]
Can a proof that no one understands (of the four-colour theorem) really be a proof? [Colyvan]
15. Nature of Minds / C. Capacities of Minds / 5. Generalisation by mind
Mathematical generalisation is by extending a system, or by abstracting away from it [Colyvan]
18. Thought / A. Modes of Thought / 1. Thought
A thought can refer to many things, but only predicate a universal and affirm a state of affairs [Hossack]
27. Natural Reality / C. Space / 2. Space
We could ignore space, and just talk of the shape of matter [Hossack]