Archive for November, 2009

Craig Smorynski reviews IGT

Monday, November 30th, 2009

I hadn’t noticed that Craig Smorynski has reviewed my Introduction to Gödel’s Theorems in Philosophia Mathematica — thanks to Eckart Menzler for alerting me.

Smorynski says some very nice things:

The goal of the book is not to introduce the reader to Gödel’s Theorems, which can be done in far fewer pages than the roughly 350 pages of the book, but to introduce the whole problem area initiated by the appearance of Gödel’s paper. The author succeeds in this broader goal as well as can be expected.

And

Smith does as thorough a job in presenting and proving Gödel’s Theorems as one could hope for in a book of this type. I do not hesitate to recommend the book as an introduction to the whole circle of Gödel’s Theorems and the issues surrounding them to the major portion of Smith’s audience: the ‘philosophy students taking an advanced course’. For them, Smith’s book is about as good as it gets.

Given how much I admire Smorynski’s own classic presentation in his Barwise Handbook article (and of course other work of his), this is praise indeed, and I’m delighted! Let me just add a few comments on some of his comments.

  1. I did advertise the book as not just being suitable for philosophers but also for ‘mathematicians who want a more accessible exposition’. I was being hopeful, of course! Smorynski says “I cannot whole-heartedly recommend the book” for them. The book is too leisurely, and there too many philosophical asides. Well, I didn’t say that all mathematicians will like it! — but judging from the occasional email, some do like the pace and the asides. But yes, mathematicians will just have to look to see if it works for them — there are plenty of  alternative presentations with a more “hard core mathmo” style.
  2. In Chap. 6, I give an incompleteness theorem (with a weaker conclusion than Gödel’s) that I said was “due to” Tim Smiley — I learnt it from him in lectures, and he told me that he’d worked it out himself. I also said that, as far as I knew, the first published version was by Hunter in his Metalogic 1971. Smorynski reports that the same argument can in fact be found in Michael Arbib’s 1964 book Brains, Machines, and Mathematics.
  3. “Speaking as a mathematician, I gleefully note that Smith’s attempt on page 16 to snipe at mathematicians … backfires.” That puzzled me. There is no sniping. I did say that it’s “a trivial arithmetical puzzle” to write down a pairing function that zig-zags through the ordered pairs of numbers. I meant: it involves nothing conceptually difficult. Which is true, and snipes at no one! :-)
  4. “Smith’s statement of the Chinese Remainder Theorem in footnote 6, p. 112, is not a statement of the Chinese Remainder Theorem, but of the key idea behind a popular combinatorial proof of the same, a proof that in fact does not formalise directly in PA without one’s already having shown how to deal in some other way with finite sequences.” Oops. Yes, the labelling is indeed careless. And the point that the proof doesn’t formalize unless we are already able to deal with finite sequences is interesting when it comes to the second theorem.
  5. In a footnote on p. 78, I say “To be strictly accurate, Presburger—then a young graduate student— proved the completeness not of P but of a slightly different and less elegant theory (whose primitive expressions were ‘0′, ‘1′ and ‘+’).” I confess I was relying on second-hand information. Smorynski puts me right: “Presburger’s paper proved the completeness and decid ability of the theory of addition of the integers, including the negative ones. This is a genuinely easier result. However, in the same volume in which Presburger did this, he also published an addendum announcing, without proof, that the results carried over when the order relation was added as a primitive. Hilbert and Bernays, 1934, presents the first published proof [for P] along Presburger’s lines.”
  6. Finally, on p. 210 (p. 211 in the current printing), I write “The first example of a more natural, non-Gödelian, arithmetical statement which is true, statable in the language of basic arithmetic, yet demonstrably not provable in PA, was found by Jeff Paris and Leo Harrington in 1977.” I’m more than a bit embarrassed that this survives into the fourth printing, for Smorynski isn’t the first to point out to me that, as in a sense I knew perfectly well, “This is simply false. … The first ‘natural, non-Gödelian arithmetical statement’ unprovable in PA was induction up to ε0, shown underivable by Gentzen in his Habilitationschrift in 1939. Following that, there was the unprovability of the totality of certain recursive functions as emphasized by Kreisel circa 1958.” Indeed.

Still, Smorynski’s overall verdict remains pleasingly positive.

Rum and Reason revived

Sunday, November 29th, 2009

The daughter’s quite excellent cooking blog has kicked into life again … Always worth a read. Not that I’m biased or anything.

Readings for New(ish) Philosophers

Saturday, November 28th, 2009

On the Philosophy Faculty website, we have some “suggestions for those intending to read philosophy and/or beginning a philosophy course“. But this is an elderly document which I first put together about ten years ago, and which hasn’t been revised since 2002. Well, I’ve been asked to update it. But since I no longer do any undergraduate teaching except formal/mathematical logic stuff of one kind or another, I really haven’t been keeping an eye on recent good introductory philosophy books — whether general books, or on particular areas of philosophy — of the right kind of level. So I’d really welcome any suggestions, pointers to other departments’ comparable lists, etc. etc. All comments very gratefully received.

Gödel Without Tears, again

Saturday, November 28th, 2009

I’ve updated all the episodes so far to give them what I hope are more useful headers (a bullet-pointed list of topics). The last two episodes have also been more significantly revised. You can get the latest, greatest, versions here.

Two more episodes to follow very soon.

Gödel Without Tears — 6

Friday, November 27th, 2009

The latest episode showing how a theory like Q can express/capture primitive recursive functions and relations is now online. [As always, I'll be very glad to hear about typos/thinkos.]

Earlier instalments can be found here.

The end of civilization as we knew it

Tuesday, November 24th, 2009

Well, that really takes the biscuit. The University Library tea room has stopped using china cup and saucers like a civilized place, and started using disposable paper cups.

Ye gods, what is the world coming to?

Once upon a time, when the world was a bit younger, there was a comfortable tea room in the basement, with proper wooden furniture, and proper tea, and proper home-made cakes (made, it seemed, by proper grannies). There you could while away the time, and meet friends, and talk philosophy, or plot the revolution, or flirt, or all three, as the occasion demanded.

But then the tea room was moved and it all went plastic. And the coffee-flavoured beverage became vile, and the cakes beneath description. Now even the Earl Grey has to be drunk out of horrible paper cups. What was a place of some homely comfort — a happy escape from the Borgesian infinity of bookstacks above — now has all the bleak charm of an airport waiting room in one of RyanAir’s more unlovely small destinations. No doubt it saves pennies. But it means you just no longer want to pop over to the Library for tea — and so those chance meetings, those happenstance conversations, those quick browsings, that leaven the academic grind and spark new ideas, won’t happen.

Heck, I’m coming over all Roger Scruton.

Entailment – a blast from the past

Wednesday, November 18th, 2009

I promised — foolishly, as I’m quite snowed under with other things too! —  to introduce a paper of Neil Tennant’s on entailment and deducibility next week at our logic reading group. So as background I thought it might be of interest to take a trip down memory lane, and at the meeting today talk a little about discussions of entailment from Lewy and Smiley that were in the air when Tennant was first tackling entailment. I dashed off some notes today before the reading group: those who don’t know or don’t remember what those Cambridge heroes were up to might be interested in this (necessarily brief and partial) nostalgia trip: ‘Entailment, with nods to Lewy and Smiley‘. [Nov. 20: further slight tidying up.]

The Autonomy of Mathematical Knowledge, §§3.1-3.2

Saturday, November 14th, 2009
Hilbert writes
Just as the physicist investigates his apparatus … the mathematician has to secure his theorems by a critique of this proofs, and for this he needs proof theory. (p. 61)
Indeed: if you are physicist getting surprising results (or worse) thrown up by your apparatus, then you take a hard look at the apparatus — and that’s a matter of doing more physics, of course.  If you are mathematician getting surprising results (or worse, contradictions!) then you’ll want to take a hard look at your purported proofs and the assumptions you’ve been using/smuggling in — and that’s a matter of doing more mathematics. In particular, “Proof theory” is a mathematical tool to help the mathematician put his own house in order, removing any need to search for philosophical “foundations” to ensure consistency. Or at least, that’s the kind of line that we’ve seen Franks attributing to Hilbert.
Sometimes, however, Franks seems to claim more. For example, he comments on the quote from Hilbert above that “Hilbert wants to demonstrate the reliability [of mathematical techniques] is self-witnessing”. Reliability for what? Mathematical truth? Self-witnessing in what sense? Franks doesn’t say.
To see that there is an issue here, suppose you are the kind of set theorist who thinks that mathematics aims to reveal the truth about the universe of pure sets. Then proving consistency is of course not enough. We believe, for example, that ZFC + V = L is consistent, but our set theorist typically doesn’t think that that is the correct theory of the universe of sets. But then what are our techniques for theory-choice here? And what makes them reliable? Proof theory is evidently no help in answering that question for the set-theorist. (To hope to get from consistency-proofs to reliability-for-truth, we’d need to endorse the kind of position Hilbert advances in the Frege-Hilbert correspondence. My point here is that this is a further move, that takes us contentiously beyond the thought that the devices of proof theory might give us a mathematical response to the threat of inconistency.)

Hilbert writes

Just as the physicist investigates his apparatus … the mathematician has to secure his theorems by a critique of this proofs, and for this he needs proof theory. (p. 61)

Indeed: if you are a physicist getting surprising results (or worse) thrown up by your apparatus, then you will take a hard look at the apparatus — but that’s a matter of doing more physics, of course, and doesn’t involve going outside the methods of physics.  If you are mathematician getting surprising results (or worse, contradictions!) then you’ll similarly want to take a hard look at your purported proofs and the assumptions you’ve been using/smuggling in — and that’s a matter of doing more mathematics. In particular, formalization and “proof theory” is a mathematical tool to help the mathematician put his own house in order, removing any need to search for philosophical “foundations” to ensure consistency. Or at least, that’s the kind of line that we’ve seen Franks attributing to Hilbert.

Sometimes, however, Franks seems to claim more for the project of a Hilbertian proof theory. For example, he comments on the quote  above that

Hilbert wants to demonstrate that the reliability [of mathematical techniques] is self-witnessing.

Reliability for what? Mathematical truth? Self-witnessing in what sense? Franks doesn’t say.

I won’t dwell on this, but to see quickly that there is an issue here, suppose you are the kind of set theorist who thinks that mathematics aims to reveal the truth about a unique universe of pure sets which is there for us to explore. For such a theorist, proving consistency of our theory is not enough. We believe, for example, that ZFC + V = L is consistent, but our set theorist typically doesn’t think that that makes it the correct theory of the universe of sets. But then what are the techniques for theory-choice here? And why are they reliable? Proof theory is plainly not much help in answering that question for our set-theorist or for witnessing that his methods are in good order. I’m not saying that the question isn’t answerable from  a naturalist perspective, in a broad sense of “naturalism”– cf. Maddy’s discussions of such questions: I’m just noting that taking a Hilbertian line on the significance of consistency proofs — as explained by Franks — falls well short of completing the job.

That said, the first main point of Franks’s third chapter, which is called ‘Arithmetization’, is to claim that Gödel’s “technique for the arithmetization of syntax is perhaps the most significant positive contribution to Hilbert’s program” (p. 64). Which certainly, at first sight, seems a pretty extravagant claim.

Actually, as an aside, it is not the only strange claim in §3.2. Franks writes

Gödel’s two incompleteness theorems follow without much work from an application of the fixed point theorem of Rudolf Carnap [1934] and the traditional analysis of paradoxical sentences like the “liar sentence”. Thus the substantial analytical work preceded him. The innovation in Gödel’s paper was the technique … of the arithmetization of syntax … and is what allowed Gödel to apply the fixed point theorem and the analysis of paradoxical statements to the case of provability. (p. 67)

This is hopeless. (1) The fixed point theorem wasn’t proved by Carnap until after he learnt of Gödelian incompleteness — so that “substantial analytical work” did not in fact precede Gödel. (2) The fixed point theorem for a suitable theory T is of the form that for every open sentence φ(x) there is a sentence γ such that T proves γ ↔ φ(“γ”), where ”γ” is the Gödel-number, in a given scheme, for γ. So the fixed point theorem cannot precede the arithmetization of syntax: it requires arithmetization for its very statement. (3) And what on earth is “the traditional analysis of paradoxical sentences like the ‘liar sentence’” and how is that supposed to have been applied in Gödel’s incompletness proof?

Back, though, to the extravagant claim that arithmetization is the most — yes, most – significant positive contribution to Hilbert’s program (so much for Gentzen, then, and work in proof-theory downstream from him; so much for what many regard as the direct descendent of Hilbert’s program in the project of reverse mathematics). What can Franks mean?

Well, the thought is that, even if Gödel’s idea of arithmetization did lead to the incompleteness theorems that sabotaged Hilbert’s more ambitious hopes for proof theory, still this was only possible because

the same discovery vindicated Hilbert’s principal philosophical conviction: that by being cast within mathematics itself important questions about mathematics could be investigated without favouring any philosophical tendencies over others. (p. 66)

But I don’t find that particularly convincing as a defence of the extravagant claim. After all, Hilbert already had emphasized the key point that when we go metatheoretical, and move from thinking about sets (for example) to thinking about formalized-theories-about-sets, we move from considering infinite sets to considering suites of finite formal objects (wffs, and finite sequences of wffs) — and we might then hope to bring to bear, at the metatheoretical level, merely finitary formal reasoning about these suites of finite formal objects in order to prove consistency, etc. It’s the formalization that gives us a new, finitary, subject matter apt for formal investigation — apt, in other words, for mathematical treatment. The additional fact that we can arithmetically code up finite objects by mapping them to numbers means we might be able to bring some more, already familiar, mathematics to bear on these objects (just as when we co-ordinatize a space we can bring the arithmetic of the reals to bear on geometrical objects). But just as we don’t need co-ordinatization to vindicate treating geometrical objects mathematically, we don’t need arithmetization to vindicate bringing formal methods to bear on the formal objects given us when we formalize a theory and go metatheoretical.

Nerdy distractions

Tuesday, November 10th, 2009

Moving the blog and other stuff to a new host and getting to know Wordpress just a bit has — what a surprise! — taken up too much time. I’ll try to concentrate now on moving more content (leaving theme-fiddling for later). At the moment, if you are looking for logic book stuff etc. it is still online here.

Next up, I hope, something more about Curtis Franks’s book: watch this space …

Work in progress

Saturday, November 7th, 2009

The plan is to port here the whole old Logic Matters site (including, the pages relating to my recent books and also LaTeX for Logicians) into one better organized, and much-easier-to-update, site. Watch this space. It may take a while …

Meanwhile, all the posts from the blog previously hosted at blogspot have been imported here. I will recategorize them and delete trivia over the coming days, to make the archive more usable.