20 ideas
| 21355 | The Pre-Socratics are not simple naturalists, because they do not always 'leave the gods out' [Leroi] |
| Full Idea: The problem with making naturalism the hallmark of Pre-Socratic thought ...is that they do not always 'leave the gods out'; the Divine can usually be found lurking somewhere is their cosmologies. | |
| From: Armand Marie LeRoi (The Lagoon: how Aristotle invented science [2014], 007) | |
| A reaction: An important observation. I've been guilty of this simplistic view. We tend to ignore the religious fragments, or we possess so little that we have no idea where religion figured in their accounts. |
| 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) |
| 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) |
| 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... |
| 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. |
| 8915 | How we refer to abstractions is much less clear than how we refer to other things [Rosen] |
| Full Idea: It is unclear how we manage to refer determinately to abstract entities in a sense in which it is not unclear how we manage to refer determinately to other things. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Way of Ex') | |
| A reaction: This is where problems of abstraction overlap with problems about reference in language. Can we have a 'baptism' account of each abstraction (even very large numbers)? Will descriptions do it? Do abstractions collapse into particulars when we refer? |
| 8917 | The Way of Abstraction used to say an abstraction is an idea that was formed by abstracting [Rosen] |
| Full Idea: The simplest version of the Way of Abstraction would be to say that an object is abstract if it is a referent of an idea that was formed by abstraction, but this is wedded to an outmoded philosophy of mind. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Way of Abs') | |
| A reaction: This presumably refers to Locke, who wields the highly ambiguous term 'idea'. But if we sort out that ambiguity (by using modern talk of mental events, concepts and content?) we might reclaim the view. But do we have a 'genetic fallacy' here? |
| 8912 | Nowadays abstractions are defined as non-spatial, causally inert things [Rosen] |
| Full Idea: If any characterization of the abstract deserves to be regarded as the modern standard one, it is this: an abstract entity is a non-spatial (or non-spatiotemporal) causally inert thing. This view presents a number of perplexities... | |
| From: Gideon Rosen (Abstract Objects [2001], 'Non-spat') | |
| A reaction: As indicated in other ideas, the problem is that some abstractions do seem to be located somewhere in space-time, and to have come into existence, and to pass away. I like 'to exist is to have causal powers'. See Ideas 5992 and 8300. |
| 8913 | Chess may be abstract, but it has existed in specific space and time [Rosen] |
| Full Idea: The natural view of chess is not that it is a non-spatiotemporal mathematical object, but that it was invented at a certain time and place, that it has changed over the years, and so on. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Non-spat') | |
| A reaction: This strikes me as being undeniable, and being an incredibly important point. Logicians seem to want to subsume things like games into the highly abstract world of logic and numbers. In fact the direction of explanation should be reversed. |
| 8914 | Sets are said to be abstract and non-spatial, but a set of books can be on a shelf [Rosen] |
| Full Idea: It is thought that sets are abstract, abstract objects do not exist in space, so sets must not exist in space. But it is not unnatural to say that a set of books is located on a certain shelf in the library. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Non-spat') | |
| A reaction: The arguments against non-spatiality of abstractions seem to me to be conclusive. Not being able to assign a location to the cosine function is on a par with not knowing where my thoughts are located in my brain. |
| 8916 | Conflating abstractions with either sets or universals is a big claim, needing a big defence [Rosen] |
| Full Idea: The Way of Conflation account of abstractions (identifying them sets or with universals) is now relatively rare. The claim sets or universals are the only abstract objects would amount to a substantive metaphysical thesis, in need of defence. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Way of Con') | |
| A reaction: If you produce a concept like 'mammal' by psychological abstraction, you do seem to end up with a set of things with shared properties, so this approach is not silly. I can't think of any examples of abstractions which are not sets or universals. |
| 8918 | Functional terms can pick out abstractions by asserting an equivalence relation [Rosen] |
| Full Idea: On Frege's suggestion, functional terms that pick out abstract expressions (such as 'direction' or 'equinumeral') have a typical form of f(a) = f(b) iff aRb, where R is an equivalence relation, a relation which is reflexive, symmetric and transitive. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Way of Abs') | |
| A reaction: [Wright and Hale are credited with the details] This has become the modern orthodoxy among the logically-minded. Examples of R are 'parallel' or 'just as many as'. It picks out an 'aspect', which isn't far from the old view. |
| 8919 | Abstraction by equivalence relationships might prove that a train is an abstract entity [Rosen] |
| Full Idea: It seems possible to define a train in terms of its carriages and the connection relationship, which would meet the equivalence account of abstraction, but demonstrate that trains are actually abstract. | |
| From: Gideon Rosen (Abstract Objects [2001], 'Way of Abs') | |
| A reaction: [Compressed. See article for more detail] A tricky example, but a suggestive line of criticism. If you find two physical objects which relate to one another reflexively, symmetrically and transitively, they may turn out to be abstract. |