Combining Philosophers

All the ideas for Engelbretsen,G/Sayward,C, Ian Hacking and Marian David

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]
3. Truth / A. Truth Problems / 2. Defining Truth
If truths are just identical with facts, then truths will make themselves true [David]
3. Truth / B. Truthmakers / 2. Truthmaker Relation
Examples show that truth-making is just non-symmetric, not asymmetric [David]
3. Truth / B. Truthmakers / 4. Truthmaker Necessitarianism
It is assumed that a proposition is necessarily true if its truth-maker exists [David]
3. Truth / B. Truthmakers / 5. What Makes Truths / a. What makes truths
Two different propositions can have the same fact as truth-maker [David]
3. Truth / B. Truthmakers / 5. What Makes Truths / b. Objects make truths
What matters is truth-making (not truth-makers) [David]
3. Truth / B. Truthmakers / 11. Truthmaking and Correspondence
Correspondence is symmetric, while truth-making is taken to be asymmetric [David]
Correspondence is an over-ambitious attempt to explain truth-making [David]
Correspondence theorists see facts as the only truth-makers [David]
3. Truth / C. Correspondence Truth / 1. Correspondence Truth
Correspondence theory likes ideal languages, that reveal the structure of propositions [David]
3. Truth / C. Correspondence Truth / 2. Correspondence to Facts
One proposition can be made true by many different facts [David]
What makes a disjunction true is simpler than the disjunctive fact it names [David]
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 / 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]
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]
In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward]
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 / 6. Classical Logic
Classical logic rests on truth and models, where constructivist logic rests on defence and refutation [Engelbretsen/Sayward]
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 / 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 / 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 / 3. Löwenheim-Skolem Theorems
If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
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]
8. Modes of Existence / A. Relations / 4. Formal Relations / a. Types of relation
A reflexive relation entails that the relation can't be asymmetric [David]
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]