Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Tarski on Truth and Logical Consequence' and 'Modality'

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


30 ideas

2. Reason / A. Nature of Reason / 1. On Reason
Consistency is modal, saying propositions are consistent if they could be true together [Melia]
2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / c. Meta-language for truth
'Snow is white' depends on meaning; whether snow is white depends on snow [Etchemendy]
3. Truth / G. Axiomatic Truth / 1. Axiomatic Truth
We can get a substantive account of Tarski's truth by adding primitive 'true' to the object language [Etchemendy]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
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]
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
4. Formal Logic / C. Predicate Calculus PC / 1. Predicate Calculus PC
Predicate logic has connectives, quantifiers, variables, predicates, equality, names and brackets [Melia]
4. Formal Logic / D. Modal Logic ML / 1. Modal Logic
First-order predicate calculus is extensional logic, but quantified modal logic is intensional (hence dubious) [Melia]
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 / G. Quantification / 5. Second-Order Quantification
Second-order logic needs second-order variables and quantification into predicate position [Melia]
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
If every model that makes premises true also makes conclusion true, the argument is valid [Melia]
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]
7. Existence / D. Theories of Reality / 8. Facts / a. Facts
No sort of plain language or levels of logic can express modal facts properly [Melia]
Maybe names and predicates can capture any fact [Melia]
9. Objects / F. Identity among Objects / 7. Indiscernible Objects
The Identity of Indiscernibles is contentious for qualities, and trivial for non-qualities [Melia]
10. Modality / A. Necessity / 2. Nature of Necessity
We may be sure that P is necessary, but is it necessarily necessary? [Melia]
10. Modality / A. Necessity / 4. De re / De dicto modality
'De re' modality is about things themselves, 'de dicto' modality is about propositions [Melia]
10. Modality / B. Possibility / 1. Possibility
Sometimes we want to specify in what ways a thing is possible [Melia]
10. Modality / E. Possible worlds / 1. Possible Worlds / a. Possible worlds
Possible worlds make it possible to define necessity and counterfactuals without new primitives [Melia]
In possible worlds semantics the modal operators are treated as quantifiers [Melia]
If possible worlds semantics is not realist about possible worlds, logic becomes merely formal [Melia]
Possible worlds could be real as mathematics, propositions, properties, or like books [Melia]
10. Modality / E. Possible worlds / 2. Nature of Possible Worlds / b. Worlds as fictions
The truth of propositions at possible worlds are implied by the world, just as in books [Melia]
19. Language / A. Nature of Meaning / 5. Meaning as Verification
We accept unverifiable propositions because of simplicity, utility, explanation and plausibility [Melia]