Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'On the Elements of Being: I' and 'Oldest System Prog. of German Idealism'

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


15 ideas

2. Reason / A. Nature of Reason / 1. On Reason
Highest reason is aesthetic, and truth and good are subordinate to beauty [Hegel]
     Full Idea: I am now convinced that the highest act of reason, which embraces all ideas, is an aesthetic act, and that truth and goodness are brothers only in beauty.
     From: Georg W.F.Hegel (Oldest System Prog. of German Idealism [1796]), quoted by Simon Critchley - Continental Philosophy - V. Short Intro Append
     A reaction: This seems to be the distinctive value framework of the romantic movement and the nineteenth century, where art is destined to replace religion. However, Plato in the Symposium is an interesting ally. Aim for beauty, and the rest follows?
2. Reason / D. Definition / 3. Types of Definition
A decent modern definition should always imply a semantics [Hacking]
     Full Idea: Today we expect that anything worth calling a definition should imply a semantics.
     From: Ian Hacking (What is Logic? [1979], §10)
     A reaction: He compares this with Gentzen 1935, who was attempting purely syntactic definitions of the logical connectives.
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
     Full Idea: 'Dilution' (or 'Thinning') provides an essential contrast between deductive and inductive reasoning; for the introduction of new premises may spoil an inductive inference.
     From: Ian Hacking (What is Logic? [1979], §06.2)
     A reaction: That is, inductive logic (if there is such a thing) is clearly non-monotonic, whereas classical inductive logic is monotonic.
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
     Full Idea: If A |- B and B |- C, then A |- C. This generalises to: If Γ|-A,Θ and Γ,A |- Θ, then Γ |- Θ. Gentzen called this 'cut'. It is the transitivity of a deduction.
     From: Ian Hacking (What is Logic? [1979], §06.3)
     A reaction: I read the generalisation as 'If A can be either a premise or a conclusion, you can bypass it'. The first version is just transitivity (which by-passes the middle step).
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
     Full Idea: Only the cut rule can have a conclusion that is less complex than its premises. Hence when cut is not used, a derivation is quite literally constructive, building up from components. Any theorem obtained by cut can be obtained without it.
     From: Ian Hacking (What is Logic? [1979], §08)
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]
     Full Idea: I don't believe English is by nature classical or intuitionistic etc. These are abstractions made by logicians. Logicians attend to numerous different objects that might be served by 'If...then', like material conditional, strict or relevant implication.
     From: Ian Hacking (What is Logic? [1979], §15)
     A reaction: The idea that they are 'abstractions' is close to my heart. Abstractions from what? Surely 'if...then' has a standard character when employed in normal conversation?
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]
     Full Idea: First-order logic is the strongest complete compact theory with a Löwenheim-Skolem theorem.
     From: Ian Hacking (What is Logic? [1979], §13)
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
     Full Idea: Henkin proved that there is no first-order treatment of branching quantifiers, which do not seem to involve any idea that is fundamentally different from ordinary quantification.
     From: Ian Hacking (What is Logic? [1979], §13)
     A reaction: See Hacking for an example of branching quantifiers. Hacking is impressed by this as a real limitation of the first-order logic which he generally favours.
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
     Full Idea: Second-order logic has no chance of a completeness theorem unless one ventures into intensional entities and possible worlds.
     From: Ian Hacking (What is Logic? [1979], §13)
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]
     Full Idea: My doctrine is that the peculiarity of the logical constants resides precisely in that given a certain pure notion of truth and consequence, all the desirable semantic properties of the constants are determined by their syntactic properties.
     From: Ian Hacking (What is Logic? [1979], §09)
     A reaction: He opposes this to Peacocke 1976, who claims that the logical connectives are essentially semantic in character, concerned with the preservation of truth.
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]
     Full Idea: For some purposes the variables of first-order logic can be regarded as prepositions and place-holders that could in principle be dispensed with, say by a system of arrows indicating what places fall in the scope of which quantifier.
     From: Ian Hacking (What is Logic? [1979], §11)
     A reaction: I tend to think of variables as either pronouns, or as definite descriptions, or as temporary names, but not as prepositions. Must address this new idea...
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]
     Full Idea: A Löwenheim-Skolem theorem holds for anything which, on my delineation, is a logic.
     From: Ian Hacking (What is Logic? [1979], §13)
     A reaction: I take this to be an unusually conservative view. Shapiro is the chap who can give you an alternative view of these things, or Boolos.
8. Modes of Existence / B. Properties / 13. Tropes / a. Nature of tropes
'Socrates is wise' means a concurrence sum contains a member of a similarity set [Williams,DC]
     Full Idea: 'Socrates is wise' means that the concurrence sum (Socrates) includes a trope which is a member of the similarity set (Wisdom).
     From: Donald C. Williams (On the Elements of Being: I [1953], p.119)
     A reaction: Resemblance has to be taken as a basic (and presumably unanalysable) concept, which invites Russell's objection (Idea 4441).
A 'trope' is an abstract particular, the occurrence of an essence [Williams,DC]
     Full Idea: I shall divert the word 'trope' to stand for the abstract particular which is, so to speak, the occurrence of an essence.
     From: Donald C. Williams (On the Elements of Being: I [1953], p.115)
     A reaction: Thus tropes entered philosophical discussion. Presumably the precedent for an 'abstract particular' would be a particular occurrence of the number 7.
A world is completely constituted by its tropes and their connections [Williams,DC]
     Full Idea: Any possible world, and hence, of course, this one, is completely constituted by its tropes and connections of location and similarity.
     From: Donald C. Williams (On the Elements of Being: I [1953], p.116)
     A reaction: Note that Williams regularly referred to possible worlds in 1953. This is a full-blooded trope theory, which asserts that objects are bundles of tropes, so that both particulars and universals are ontologically taken care of.