Combining Philosophers

All the ideas for Stilpo, Michal Walicki and Ian Hacking

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


39 ideas

1. Philosophy / C. History of Philosophy / 4. Later European Philosophy / b. Seventeenth century philosophy
Gassendi is the first great empiricist philosopher [Hacking]
2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
Post proved the consistency of propositional logic in 1921 [Walicki]
Propositional language can only relate statements as the same or as different [Walicki]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Boolean connectives are interpreted as functions on the set {1,0} [Walicki]
4. Formal Logic / F. Set Theory ST / 3. Types of Set / b. Empty (Null) Set
The empty set is useful for defining sets by properties, when the members are not yet known [Walicki]
The empty set avoids having to take special precautions in case members vanish [Walicki]
4. Formal Logic / F. Set Theory ST / 6. Ordering in Sets
Ordinals play the central role in set theory, providing the model of well-ordering [Walicki]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
To determine the patterns in logic, one must identify its 'building blocks' [Walicki]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
The various logics are abstractions made from terms like 'if...then' in English [Hacking]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking]
5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic
Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki]
If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki]
A compact axiomatisation makes it possible to understand a field as a whole [Walicki]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / e. Ordinal numbers
Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki]
Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki]
The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki]
Two infinite ordinals can represent a single infinite cardinal [Walicki]
Members of ordinals are ordinals, and also subsets of ordinals [Walicki]
6. Mathematics / B. Foundations for Mathematics / 3. Axioms for Geometry
In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
Inductive proof depends on the choice of the ordering [Walicki]
10. Modality / A. Necessity / 2. Nature of Necessity
Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki]
10. Modality / B. Possibility / 6. Probability
Probability was fully explained between 1654 and 1812 [Hacking]
Probability is statistical (behaviour of chance devices) or epistemological (belief based on evidence) [Hacking]
Epistemological probability based either on logical implications or coherent judgments [Hacking]
13. Knowledge Criteria / B. Internal Justification / 3. Evidentialism / a. Evidence
In the medieval view, only deduction counted as true evidence [Hacking]
Formerly evidence came from people; the new idea was that things provided evidence [Hacking]
14. Science / A. Basis of Science / 3. Experiment
An experiment is a test, or an adventure, or a diagnosis, or a dissection [Hacking, by PG]
14. Science / D. Explanation / 2. Types of Explanation / a. Types of explanation
Follow maths for necessary truths, and jurisprudence for contingent truths [Hacking]
28. God / C. Attitudes to God / 5. Atheism
Stilpo said if Athena is a daughter of Zeus, then a statue is only the child of a sculptor, and so is not a god [Stilpo, by Diog. Laertius]