Combining Texts

All the ideas for 'What is Logic?st1=Ian Hacking', 'Reply to 'Rorarius' 2nd ed' and 'Logic in Mathematics'

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


32 ideas

2. Reason / D. Definition / 3. Types of Definition
A 'constructive' (as opposed to 'analytic') definition creates a new sign [Frege]
     Full Idea: We construct a sense out of its constituents and introduce an entirely new sign to express this sense. This may be called a 'constructive definition', but we prefer to call it a 'definition' tout court. It contrasts with an 'analytic' definition.
     From: Gottlob Frege (Logic in Mathematics [1914], p.210)
     A reaction: An analytic definition is evidently a deconstruction of a past constructive definition. Fregean definition is a creative activity.
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.
2. Reason / D. Definition / 10. Stipulative Definition
Frege suggested that mathematics should only accept stipulative definitions [Frege, by Gupta]
     Full Idea: Frege has defended the austere view that, in mathematics at least, only stipulative definitions should be countenanced.
     From: report of Gottlob Frege (Logic in Mathematics [1914]) by Anil Gupta - Definitions 1.3
     A reaction: This sounds intriguingly at odds with Frege's well-known platonism about numbers (as sets of equinumerous sets). It makes sense for other mathematical concepts.
2. Reason / E. Argument / 6. Conclusive Proof
We must be clear about every premise and every law used in a proof [Frege]
     Full Idea: It is so important, if we are to have a clear insight into what is going on, for us to be able to recognise the premises of every inference which occurs in a proof and the law of inference in accordance with which it takes place.
     From: Gottlob Frege (Logic in Mathematics [1914], p.212)
     A reaction: Teachers of logic like natural deduction, because it reduces everything to a few clear laws, which can be stated at each step.
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 / 3. Value of Logic
Logic not only proves things, but also reveals logical relations between them [Frege]
     Full Idea: A proof does not only serve to convince us of the truth of what is proved: it also serves to reveal logical relations between truths. Hence we find in Euclid proofs of truths that appear to stand in no need of proof because they are obvious without one.
     From: Gottlob Frege (Logic in Mathematics [1914], p.204)
     A reaction: This is a key idea in Frege's philosophy, and a reason why he is the founder of modern analytic philosophy, with logic placed at the centre of the subject. I take the value of proofs to be raising questions, more than giving answers.
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 / A. Overview of Logic / 8. Logic of Mathematics
Does some mathematical reasoning (such as mathematical induction) not belong to logic? [Frege]
     Full Idea: Are there perhaps modes of inference peculiar to mathematics which …do not belong to logic? Here one may point to inference by mathematical induction from n to n+1.
     From: Gottlob Frege (Logic in Mathematics [1914], p.203)
     A reaction: He replies that it looks as if induction can be reduced to general laws, and those can be reduced to logic.
The closest subject to logic is mathematics, which does little apart from drawing inferences [Frege]
     Full Idea: Mathematics has closer ties with logic than does almost any other discipline; for almost the entire activity of the mathematician consists in drawing inferences.
     From: Gottlob Frege (Logic in Mathematics [1914], p.203)
     A reaction: The interesting question is who is in charge - the mathematician or the logician?
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 / E. Structures of Logic / 8. Theories in Logic
'Theorems' are both proved, and used in proofs [Frege]
     Full Idea: Usually a truth is only called a 'theorem' when it has not merely been obtained by inference, but is used in turn as a premise for a number of inferences in the science. ….Proofs use non-theorems, which only occur in that proof.
     From: Gottlob Frege (Logic in Mathematics [1914], p.204)
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.
5. Theory of Logic / K. Features of Logics / 1. Axiomatisation
Tracing inference backwards closes in on a small set of axioms and postulates [Frege]
     Full Idea: We can trace the chains of inference backwards, …and the circle of theorems closes in more and more. ..We must eventually come to an end by arriving at truths can cannot be inferred, …which are the axioms and postulates.
     From: Gottlob Frege (Logic in Mathematics [1914], p.204)
     A reaction: The rival (more modern) view is that that all theorems are equal in status, and axioms are selected for convenience.
The essence of mathematics is the kernel of primitive truths on which it rests [Frege]
     Full Idea: Science must endeavour to make the circle of unprovable primitive truths as small as possible, for the whole of mathematics is contained in this kernel. The essence of mathematics has to be defined by this kernel of truths.
     From: Gottlob Frege (Logic in Mathematics [1914], p.204-5)
     A reaction: [compressed] I will make use of this thought, by arguing that mathematics may be 'explained' by this kernel.
Axioms are truths which cannot be doubted, and for which no proof is needed [Frege]
     Full Idea: The axioms are theorems, but truths for which no proof can be given in our system, and no proof is needed. It follows from this that there are no false axioms, and we cannot accept a thought as an axiom if we are in doubt about its truth.
     From: Gottlob Frege (Logic in Mathematics [1914], p.205)
     A reaction: He struggles to be as objective as possible, but has to concede that whether we can 'doubt' the axiom is one of the criteria.
A truth can be an axiom in one system and not in another [Frege]
     Full Idea: It is possible for a truth to be an axiom in one system and not in another.
     From: Gottlob Frege (Logic in Mathematics [1914], p.205)
     A reaction: Frege aspired to one huge single system, so this is a begrudging concession, one which modern thinkers would probably take for granted.
6. Mathematics / A. Nature of Mathematics / 1. Mathematics
To create order in mathematics we need a full system, guided by patterns of inference [Frege]
     Full Idea: We cannot long remain content with the present fragmentation [of mathematics]. Order can be created only by a system. But to construct a system it is necessary that in any step forward we take we should be aware of the logical inferences involved.
     From: Gottlob Frege (Logic in Mathematics [1914], p.205)
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / a. Axioms for numbers
If principles are provable, they are theorems; if not, they are axioms [Frege]
     Full Idea: If the law [of induction] can be proved, it will be included amongst the theorems of mathematics; if it cannot, it will be included amongst the axioms.
     From: Gottlob Frege (Logic in Mathematics [1914], p.203)
     A reaction: This links Frege with the traditional Euclidean view of axioms. The question, then, is how do we know them, given that we can't prove them.
9. Objects / B. Unity of Objects / 3. Unity Problems / e. Vague objects
Every concept must have a sharp boundary; we cannot allow an indeterminate third case [Frege]
     Full Idea: Of any concept, we must require that it have a sharp boundary. Of any object it must hold either that it falls under the concept or it does not. We may not allow a third case in which it is somehow indeterminate whether an object falls under a concept.
     From: Gottlob Frege (Logic in Mathematics [1914], p.229), quoted by Ian Rumfitt - The Logic of Boundaryless Concepts p.1 n1
     A reaction: This is the voice of the classical logician, which has echoed by Russell. I'm with them, I think, in the sense that logic can only work with precise concepts. The jury is still out. Maybe we can 'precisify', without achieving total precision.
18. Thought / B. Mechanics of Thought / 5. Mental Files
We need definitions to cram retrievable sense into a signed receptacle [Frege]
     Full Idea: If we need such signs, we also need definitions so that we can cram this sense into the receptacle and also take it out again.
     From: Gottlob Frege (Logic in Mathematics [1914], p.209)
     A reaction: Has anyone noticed that Frege is the originator of the idea of the mental file? Has anyone noticed the role that definition plays in his account?
We use signs to mark receptacles for complex senses [Frege]
     Full Idea: We often need to use a sign with which we associate a very complex sense. Such a sign seems a receptacle for the sense, so that we can carry it with us, while being always aware that we can open this receptacle should we need what it contains.
     From: Gottlob Frege (Logic in Mathematics [1914], p.209)
     A reaction: This exactly the concept of a mental file, which I enthusiastically endorse. Frege even talks of 'opening the receptacle'. For Frege a definition (which he has been discussing) is the assigment of a label (the 'definiendum') to the file (the 'definiens').
19. Language / A. Nature of Meaning / 6. Meaning as Use
A sign won't gain sense just from being used in sentences with familiar components [Frege]
     Full Idea: No sense accrues to a sign by the mere fact that it is used in one or more sentences, the other constituents of which are known.
     From: Gottlob Frege (Logic in Mathematics [1914], p.213)
     A reaction: Music to my ears. I've never grasped how meaning could be grasped entirely through use.
19. Language / D. Propositions / 2. Abstract Propositions / a. Propositions as sense
Thoughts are not subjective or psychological, because some thoughts are the same for us all [Frege]
     Full Idea: A thought is not something subjective, is not the product of any form of mental activity; for the thought that we have in Pythagoras's theorem is the same for everybody.
     From: Gottlob Frege (Logic in Mathematics [1914], p.206)
     A reaction: When such thoughts are treated as if the have objective (platonic) existence, I become bewildered. I take a thought (or proposition) to be entirely psychological, but that doesn't stop two people from having the same thought.
A thought is the sense expressed by a sentence, and is what we prove [Frege]
     Full Idea: The sentence is of value to us because of the sense that we grasp in it, which is recognisably the same in a translation. I call this sense the thought. What we prove is not a sentence, but a thought.
     From: Gottlob Frege (Logic in Mathematics [1914], p.206)
     A reaction: The 'sense' is presumably the German 'sinn', and a 'thought' in Frege is what we normally call a 'proposition'. So the sense of a sentence is a proposition, and logic proves propositions. I'm happy with that.
19. Language / D. Propositions / 5. Unity of Propositions
The parts of a thought map onto the parts of a sentence [Frege]
     Full Idea: A sentence is generally a complex sign, so the thought expressed by it is complex too: in fact it is put together in such a way that parts of a thought correspond to parts of the sentence.
     From: Gottlob Frege (Logic in Mathematics [1914], p.207)
     A reaction: This is the compositional view of propositions, as opposed to the holistic view.
27. Natural Reality / D. Time / 1. Nature of Time / b. Relative time
Space and time are the order of all possibilities, and don't just relate to what is actual [Leibniz]
     Full Idea: Space and time taken together constitute the order of possibilities of the one entire universe, so that these orders relate not only to what actually is, but also to anything that could be put in its place.
     From: Gottfried Leibniz (Reply to 'Rorarius' 2nd ed [1702], GP iv 568), quoted by Richard T.W. Arthur - Leibniz 7 'Space and Time'
     A reaction: A very nice idea. Rather like the 'space of reasons', where all rational thought must exist, space and time are the 'space of existence and action'. Their concepts involve more than relations between what actually exists.