Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Axiomatic Theories of Truth (2013 ver)' and 'Review of 'Aenesidemus''

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

23 ideas

2. Reason / D. Definition / 3. Types of Definition
13838 A decent modern definition should always imply a semantics [Hacking]
3. Truth / A. Truth Problems / 2. Defining Truth
19125 If we define truth, we can eliminate it [Halbach/Leigh]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / b. Satisfaction and truth
19128 If a language cannot name all objects, then satisfaction must be used, instead of unary truth [Halbach/Leigh]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / c. Meta-language for truth
19120 Semantic theories need a powerful metalanguage, typically including set theory [Halbach/Leigh]
3. Truth / F. Semantic Truth / 2. Semantic Truth
19127 The T-sentences are deductively weak, and also not deductively conservative [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 1. Axiomatic Truth
19124 A natural theory of truth plays the role of reflection principles, establishing arithmetic's soundness [Halbach/Leigh]
19126 If deflationary truth is not explanatory, truth axioms should be 'conservative', proving nothing new [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 2. FS Truth Axioms
19129 The FS axioms use classical logical, but are not fully consistent [Halbach/Leigh]
3. Truth / G. Axiomatic Truth / 3. KF Truth Axioms
19130 KF is formulated in classical logic, but describes non-classical truth, which allows truth-value gluts [Halbach/Leigh]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
13834 Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
13835 Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
13833 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
5. Theory of Logic / A. Overview of Logic / 4. Pure Logic
13845 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
13840 First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
13844 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
13842 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
13837 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
13839 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
13843 If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
8. Modes of Existence / B. Properties / 12. Denial of Properties
19121 We can reduce properties to true formulas [Halbach/Leigh]
8. Modes of Existence / E. Nominalism / 1. Nominalism / c. Nominalism about abstracta
19122 Nominalists can reduce theories of properties or sets to harmless axiomatic truth theories [Halbach/Leigh]
11. Knowledge Aims / C. Knowing Reality / 3. Idealism / a. Idealism
22062 Mental presentation are not empirical, but concern the strivings of the self [Fichte]
11. Knowledge Aims / C. Knowing Reality / 3. Idealism / b. Transcendental idealism
22015 The thing-in-itself is an empty dream [Fichte, by Pinkard]