more on this theme     |     more from this text


Single Idea 13839

[filed under theme 5. Theory of Logic / E. Structures of Logic / 4. Variables in Logic ]

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.

Gist of Idea

Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers

Source

Ian Hacking (What is Logic? [1979], §11)

Book Ref

'A Philosophical Companion to First-Order Logic', ed/tr. Hughes,R.I.G. [Hackett 1993], p.242


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...


The 19 ideas from Ian Hacking

Probability was fully explained between 1654 and 1812 [Hacking]
Probability is statistical (behaviour of chance devices) or epistemological (belief based on evidence) [Hacking]
Follow maths for necessary truths, and jurisprudence for contingent truths [Hacking]
Epistemological probability based either on logical implications or coherent judgments [Hacking]
In the medieval view, only deduction counted as true evidence [Hacking]
Formerly evidence came from people; the new idea was that things provided evidence [Hacking]
An experiment is a test, or an adventure, or a diagnosis, or a dissection [Hacking, by PG]
Gassendi is the first great empiricist philosopher [Hacking]
'Thinning' ('dilution') is the key difference between deduction (which allows it) and induction [Hacking]
Gentzen's Cut Rule (or transitivity of deduction) is 'If A |- B and B |- C, then A |- C' [Hacking]
Only Cut reduces complexity, so logic is constructive without it, and it can be dispensed with [Hacking]
With a pure notion of truth and consequence, the meanings of connectives are fixed syntactically [Hacking]
A decent modern definition should always imply a semantics [Hacking]
Perhaps variables could be dispensed with, by arrows joining places in the scope of quantifiers [Hacking]
If it is a logic, the Löwenheim-Skolem theorem holds for it [Hacking]
First-order logic is the strongest complete compact theory with Löwenheim-Skolem [Hacking]
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
Second-order completeness seems to need intensional entities and possible worlds [Hacking]
The various logics are abstractions made from terms like 'if...then' in English [Hacking]