31 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) |
| 10775 | The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp] |
| Full Idea: The main objection to the axiom of choice was that it had to be given by some law or definition, but since sets are arbitrary this seems irrelevant. Formalists consider it meaningless, but set-theorists consider it as true, and practically obvious. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) |
| 10766 | Logic is either for demonstration, or for characterizing structures [Tharp] |
| Full Idea: One can distinguish at least two quite different senses of logic: as an instrument of demonstration, and perhaps as an instrument for the characterization of structures. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: This is trying to capture the proof-theory and semantic aspects, but merely 'characterizing' something sounds like a rather feeble aspiration for the semantic side of things. Isn't it to do with truth, rather than just rule-following? |
| 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? |
| 10767 | Elementary logic is complete, but cannot capture mathematics [Tharp] |
| Full Idea: Elementary logic cannot characterize the usual mathematical structures, but seems to be distinguished by its completeness. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 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. |
| 10769 | Second-order logic isn't provable, but will express set-theory and classic problems [Tharp] |
| Full Idea: The expressive power of second-order logic is too great to admit a proof procedure, but is adequate to express set-theoretical statements, and open questions such as the continuum hypothesis or the existence of big cardinals are easily stated. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 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) |
| 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. |
| 10762 | In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp] |
| Full Idea: In sentential logic there is a simple proof that all truth functions, of any number of arguments, are definable from (say) 'not' and 'and'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §0) | |
| A reaction: The point of 'say' is that it can be got down to two connectives, and these are just the usual preferred pair. |
| 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... |
| 10776 | The main quantifiers extend 'and' and 'or' to infinite domains [Tharp] |
| Full Idea: The symbols ∀ and ∃ may, to start with, be regarded as extrapolations of the truth functional connectives ∧ ('and') and ∨ ('or') to infinite domains. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §5) |
| 10774 | There are at least five unorthodox quantifiers that could be used [Tharp] |
| Full Idea: One might add to one's logic an 'uncountable quantifier', or a 'Chang quantifier', or a 'two-argument quantifier', or 'Shelah's quantifier', or 'branching quantifiers'. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §3) | |
| A reaction: [compressed - just listed for reference, if you collect quantifiers, like collecting butterflies] |
| 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. |
| 10777 | Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp] |
| Full Idea: Skolem deduced from the Löwenheim-Skolem theorem that 'the absolutist conceptions of Cantor's theory' are 'illusory'. I think it is clear that this conclusion would not follow even if elementary logic were in some sense the true logic, as Skolem assumed. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §7) | |
| A reaction: [Tharp cites Skolem 1962 p.47] Kit Fine refers to accepters of this scepticism about the arithmetic of infinities as 'Skolemites'. |
| 10773 | The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp] |
| Full Idea: The Löwenheim-Skolem property seems to be undesirable, in that it states a limitation concerning the distinctions the logic is capable of making, such as saying there are uncountably many reals ('Skolem's Paradox'). | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10765 | Soundness would seem to be an essential requirement of a proof procedure [Tharp] |
| Full Idea: Soundness would seem to be an essential requirement of a proof procedure, since there is little point in proving formulas which may turn out to be false under some interpretation. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10763 | Completeness and compactness together give axiomatizability [Tharp] |
| Full Idea: Putting completeness and compactness together, one has axiomatizability. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §1) |
| 10770 | If completeness fails there is no algorithm to list the valid formulas [Tharp] |
| Full Idea: In general, if completeness fails there is no algorithm to list the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: I.e. the theory is not effectively enumerable. |
| 10771 | Compactness is important for major theories which have infinitely many axioms [Tharp] |
| Full Idea: It is strange that compactness is often ignored in discussions of philosophy of logic, since the most important theories have infinitely many axioms. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: An example of infinite axioms is the induction schema in first-order Peano Arithmetic. |
| 10772 | Compactness blocks infinite expansion, and admits non-standard models [Tharp] |
| Full Idea: The compactness condition seems to state some weakness of the logic (as if it were futile to add infinitely many hypotheses). To look at it another way, formalizations of (say) arithmetic will admit of non-standard models. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10764 | A complete logic has an effective enumeration of the valid formulas [Tharp] |
| Full Idea: A complete logic has an effective enumeration of the valid formulas. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) |
| 10768 | Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp] |
| Full Idea: Despite completeness, the mere existence of an effective enumeration of the valid formulas will not, by itself, provide knowledge. For example, one might be able to prove that there is an effective enumeration, without being able to specify one. | |
| From: Leslie H. Tharp (Which Logic is the Right Logic? [1975], §2) | |
| A reaction: The point is that completeness is supposed to ensure knowledge (of what is valid but unprovable), and completeness entails effective enumerability, but more than the latter is needed to do the key job. |
| 10580 | Mathematics is both necessary and a priori because it really consists of logical truths [Yablo] |
| Full Idea: Mathematics seems necessary because the real contents of mathematical statements are logical truths, which are necessary, and it seems a priori because logical truths really are a priori. | |
| From: Stephen Yablo (Abstract Objects: a Case Study [2002], 10) | |
| A reaction: Yablo says his logicism has a Kantian strain, because numbers and sets 'inscribed on our spectacles', but he takes a different view (in the present Idea) from Kant about where the necessity resides. Personally I am tempted by an a posteriori necessity. |
| 10579 | Putting numbers in quantifiable position (rather than many quantifiers) makes expression easier [Yablo] |
| Full Idea: Saying 'the number of Fs is 5', instead of using five quantifiers, puts the numeral in quantifiable position, which brings expressive advantages. 'There are more sheep in the field than cows' is an infinite disjunction, expressible in finite compass. | |
| From: Stephen Yablo (Abstract Objects: a Case Study [2002], 08) | |
| A reaction: See Hofweber with similar thoughts. This idea I take to be a key one in explaining many metaphysical confusions. The human mind just has a strong tendency to objectify properties, relations, qualities, categories etc. - for expression and for reasoning. |
| 10577 | Concrete objects have few essential properties, but properties of abstractions are mostly essential [Yablo] |
| Full Idea: Objects like me have a few essential properties, and numerous accidental ones. Abstract objects are a different story. The intrinsic properties of the empty set are mostly essential. The relations of numbers are also mostly essential. | |
| From: Stephen Yablo (Abstract Objects: a Case Study [2002], 01) |
| 10578 | We are thought to know concreta a posteriori, and many abstracta a priori [Yablo] |
| Full Idea: Our knowledge of concreta is a posteriori, but our knowledge of numbers, at least, has often been considered a priori. | |
| From: Stephen Yablo (Abstract Objects: a Case Study [2002], 02) |