Combining Texts

All the ideas for 'The Gettier Problem', 'Conditionals' and 'Philosophical Logic: Intro to Advanced Topics'

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

18 ideas

4. Formal Logic / A. Syllogistic Logic / 1. Aristotelian Logic
13913 The four 'perfect syllogisms' are called Barbara, Celarent, Darii and Ferio [Engelbretsen/Sayward]
13914 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
13915 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
13916 Term logic uses expression letters and brackets, and '-' for negative terms, and '+' for compound terms [Engelbretsen/Sayward]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
13850 In modern logic all formal validity can be characterised syntactically [Engelbretsen/Sayward]
5. Theory of Logic / A. Overview of Logic / 6. Classical Logic
13849 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 / 4. Identity in Logic
13851 Unlike most other signs, = cannot be eliminated [Engelbretsen/Sayward]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / a. Logical connectives
14352 '¬', '&', and 'v' are truth functions: the truth of the compound is fixed by the truth of the components [Jackson]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
13852 Axioms are ω-incomplete if the instances are all derivable, but the universal quantification isn't [Engelbretsen/Sayward]
10. Modality / B. Possibility / 8. Conditionals / b. Types of conditional
14360 Possible worlds for subjunctives (and dispositions), and no-truth for indicatives? [Jackson]
10. Modality / B. Possibility / 8. Conditionals / c. Truth-function conditionals
14353 Modus ponens requires that A→B is F when A is T and B is F [Jackson]
14354 When A and B have the same truth value, A→B is true, because A→A is a logical truth [Jackson]
14355 (A&B)→A is a logical truth, even if antecedent false and consequent true, so it is T if A is F and B is T [Jackson]
10. Modality / B. Possibility / 8. Conditionals / d. Non-truthfunction conditionals
14358 In the possible worlds account of conditionals, modus ponens and modus tollens are validated [Jackson]
14359 Only assertions have truth-values, and conditionals are not proper assertions [Jackson]
14357 Possible worlds account, unlike A⊃B, says nothing about when A is false [Jackson]
10. Modality / B. Possibility / 8. Conditionals / f. Pragmatics of conditionals
14356 We can't insist that A is relevant to B, as conditionals can express lack of relevance [Jackson]
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / b. Gettier problem
19699 A Gettier case is a belief which is true, and its fallible justification involves some luck [Hetherington]