Combining Texts

All the ideas for 'On the Question of Absolute Undecidability', 'works' and 'What is Logic?'

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

22 ideas

2. Reason / D. Definition / 3. Types of Definition
13838 A decent modern definition should always imply a semantics [Hacking]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
13833 'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
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]
4. Formal Logic / F. Set Theory ST / 1. Set Theory
17884 Mathematical set theory has many plausible stopping points, such as finitism, and predicativism [Koellner]
17893 'Reflection principles' say the whole truth about sets can't be captured [Koellner]
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]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
17894 We have no argument to show a statement is absolutely undecidable [Koellner]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / i. Cardinal infinity
17890 There are at least eleven types of large cardinal, of increasing logical strength [Koellner]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
17887 PA is consistent as far as we can accept, and we expand axioms to overcome limitations [Koellner]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
17891 Arithmetical undecidability is always settled at the next stage up [Koellner]
15. Nature of Minds / B. Features of Minds / 4. Intentionality / a. Nature of intentionality
15473 How does anything get outside itself? [Fodor, by Martin,CB]
15. Nature of Minds / B. Features of Minds / 4. Intentionality / b. Intentionality theories
2981 Is intentionality outwardly folk psychology, inwardly mentalese? [Lyons on Fodor]
17. Mind and Body / D. Property Dualism / 3. Property Dualism
2985 Are beliefs brains states, but picked out at a "higher level"? [Lyons on Fodor]
18. Thought / B. Mechanics of Thought / 6. Artificial Thought / a. Artificial Intelligence
3135 Is thought a syntactic computation using representations? [Fodor, by Rey]
18. Thought / C. Content / 1. Content
2983 Maybe narrow content is physical, broad content less so [Lyons on Fodor]