20 ideas
13838 | 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. |
13833 | '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. |
13834 | 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). |
13835 | 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) |
15375 | If terms change their designations in different states, they are functions from states to objects [Fitting] |
Full Idea: The common feature of every designating term is that designation may change from state to state - thus it can be formalized by a function from states to objects. | |
From: Melvin Fitting (Intensional Logic [2007], 3) | |
A reaction: Specifying the objects sounds OK, but specifying states sounds rather tough. |
15376 | Intensional logic adds a second type of quantification, over intensional objects, or individual concepts [Fitting] |
Full Idea: To first order modal logic (with quantification over objects) we can add a second kind of quantification, over intensions. An intensional object, or individual concept, will be modelled by a function from states to objects. | |
From: Melvin Fitting (Intensional Logic [2007], 3.3) |
15378 | Awareness logic adds the restriction of an awareness function to epistemic logic [Fitting] |
Full Idea: Awareness logic enriched Hintikka's epistemic models with an awareness function, mapping each state to the set of formulas we are aware of at that state. This reflects some bound on the resources we can bring to bear. | |
From: Melvin Fitting (Intensional Logic [2007], 3.6.1) | |
A reaction: [He cites Fagin and Halpern 1988 for this] |
15379 | Justication logics make explicit the reasons for mathematical truth in proofs [Fitting] |
Full Idea: In justification logics, the logics of knowledge are extended by making reasons explicit. A logic of proof terms was created, with a semantics. In this, mathematical truths are known for explicit reasons, and these provide a measure of complexity. | |
From: Melvin Fitting (Intensional Logic [2007], 3.6.1) |
13845 | 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? |
13840 | 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) |
13844 | 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. |
13842 | 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) |
11026 | Classical logic is deliberately extensional, in order to model mathematics [Fitting] |
Full Idea: Mathematics is typically extensional throughout (we write 3+2=2+3 despite the two terms having different meanings). ..Classical first-order logic is extensional by design since it primarily evolved to model the reasoning of mathematics. | |
From: Melvin Fitting (Intensional Logic [2007], §1) |
13837 | 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. |
13839 | 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... |
11028 | λ-abstraction disambiguates the scope of modal operators [Fitting] |
Full Idea: λ-abstraction can be used to abstract and disambiguate a predicate. De re is [λx◊P(x)](f) - f has the possible-P property - and de dicto is ◊[λxP(x)](f) - possibly f has the P-property. Also applies to □. | |
From: Melvin Fitting (Intensional Logic [2007], §3.3) | |
A reaction: Compare the Barcan formula. Originated with Church in the 1930s, and Carnap 1947, but revived by Stalnaker and Thomason 1968. Because it refers to the predicate, it has a role in intensional versions of logic, especially modal logic. |
13843 | 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. |
3291 | Emergent properties appear at high levels of complexity, but aren't explainable by the lower levels [Nagel] |
Full Idea: The supposition that a diamond or organism should truly have emergent properties is that they appear at certain complex levels of organisation, but are not explainable (even in principle) in terms of any more fundamental properties of the system. | |
From: Thomas Nagel (Panpsychism [1979], p.186) |
15377 | Definite descriptions pick out different objects in different possible worlds [Fitting] |
Full Idea: Definite descriptions pick out different objects in different possible worlds quite naturally. | |
From: Melvin Fitting (Intensional Logic [2007], 3.4) | |
A reaction: A definite description can pick out the same object in another possible world, or a very similar one, or an object which has almost nothing in common with the others. |
3290 | Given the nature of heat and of water, it is literally impossible for water not to boil at the right heat [Nagel] |
Full Idea: Given what heat is and what water is, it is literally impossible for water to be heated beyond a certain point at normal atmospheric pressure without boiling. | |
From: Thomas Nagel (Panpsychism [1979], p.186) |