Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Philosophy of Logic' and 'Review of Tait 'Provenance of Pure Reason''

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


39 ideas

2. Reason / B. Laws of Thought / 3. Non-Contradiction
If you say that a contradiction is true, you change the meaning of 'not', and so change the subject [Quine]
2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
3. Truth / F. Semantic Truth / 2. Semantic Truth
Talk of 'truth' when sentences are mentioned; it reminds us that reality is the point of sentences [Quine]
3. Truth / H. Deflationary Truth / 1. Redundant Truth
Truth is redundant for single sentences; we do better to simply speak the sentence [Quine]
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 / B. Propositional Logic PL / 2. Tools of Propositional Logic / e. Axioms of PL
We can eliminate 'or' from our basic theory, by paraphrasing 'p or q' as 'not(not-p and not-q)' [Quine]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The old problems with the axiom of choice are probably better ascribed to the law of excluded middle [Parsons,C]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
My logical grammar has sentences by predication, then negation, conjunction, and existential quantification [Quine]
5. Theory of Logic / A. Overview of Logic / 3. Value of Logic
Maybe logical truth reflects reality, but in different ways in different languages [Quine]
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
Quine rejects second-order logic, saying that predicates refer to multiple objects [Quine, by Hodes]
Quantifying over predicates is treating them as names of entities [Quine]
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
5. Theory of Logic / D. Assumptions for Logic / 2. Excluded Middle
Excluded middle has three different definitions [Quine]
5. Theory of Logic / D. Assumptions for Logic / 4. Identity in Logic
Quantification theory can still be proved complete if we add identity [Quine]
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 / F. Referring in Logic / 1. Naming / f. Names eliminated
Names are not essential, because naming can be turned into predication [Quine]
5. Theory of Logic / G. Quantification / 1. Quantification
Universal quantification is widespread, but it is definable in terms of existential quantification [Quine]
5. Theory of Logic / G. Quantification / 4. Substitutional Quantification
You can't base quantification on substituting names for variables, if the irrationals cannot all be named [Quine]
Some quantifications could be false substitutionally and true objectually, because of nameless objects [Quine]
5. Theory of Logic / G. Quantification / 5. Second-Order Quantification
Putting a predicate letter in a quantifier is to make it the name of an entity [Quine]
5. Theory of Logic / I. Semantics of Logic / 3. Logical Truth
A sentence is logically true if all sentences with that grammatical structure are true [Quine]
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]
6. Mathematics / C. Sources of Mathematics / 8. Finitism
If functions are transfinite objects, finitists can have no conception of them [Parsons,C]
7. Existence / D. Theories of Reality / 11. Ontological Commitment / e. Ontological commitment problems
If a mathematical structure is rejected from a physical theory, it retains its mathematical status [Parsons,C]
8. Modes of Existence / B. Properties / 12. Denial of Properties
Predicates are not names; predicates are the other parties to predication [Quine]
9. Objects / A. Existence of Objects / 1. Physical Objects
A physical object is the four-dimensional material content of a portion of space-time [Quine]
9. Objects / E. Objects over Time / 4. Four-Dimensionalism
Four-d objects helps predication of what no longer exists, and quantification over items from different times [Quine]
10. Modality / B. Possibility / 8. Conditionals / b. Types of conditional
Some conditionals can be explained just by negation and conjunction: not(p and not-q) [Quine]
19. Language / A. Nature of Meaning / 8. Synonymy
Single words are strongly synonymous if their interchange preserves truth [Quine]
19. Language / D. Propositions / 6. Propositions Critique
It makes no sense to say that two sentences express the same proposition [Quine]
There is no rule for separating the information from other features of sentences [Quine]
We can abandon propositions, and just talk of sentences and equivalence [Quine]
19. Language / F. Communication / 5. Pragmatics / a. Contextual meaning
A good way of explaining an expression is saying what conditions make its contexts true [Quine]