When we had our loft extension built a couple of years ago, we had to have the hallways (re)decorated from top to bottom; and so the shabby old William Morris wallpaper needed to be replaced. And because some of the spaces are narrow and potentially dark, we went for a very pale version of Morris’s Poppy. Perhaps we played over-safe; but it is still a delight.
I have always been interested in and hugely admired William Morris. And my Christmas present to myself was this quite beautifully produced book, edited by Anna Mason, and published by the V&A last year to mark the 125th anniversary of his death. There are consistently interesting essays on the man (as a designer, writer, political activist, conservationist), and on the art (from the early painting to the Kelmscott Press, via the furniture, tapestry, wallpaper and more). The many, many illustrations are just terrific. So this is a joy, and very warmly recommended.
I was trying to write a piece about why Elisabeth Brauß’s playing is so extraordinary, but rather failing. So I must return instead to a more familiar theme here (which regular readers will be as tired of as I am!). But with many thanks to those who e-mailed in last-minute comments and corrections, I’ve one last time gone through a complete version of Beginning Mathematical Logic: A Study Guide, making many corrections. You can download a final, final, draft version here (all x + 184 pages of it). I hope you like the wise addition to the very last page …
There are no major changes since the previous online version, but there’s been a fair amount of minor tinkering at the level of changing punctuation, adding a very few more footnotes, etc. It made a remarkable difference having a printed proof copy in book form to work from: all kinds of minor glitches hit the eye in a way they don’t onscreen or even in a stack of print-out.
So the plan is that I send off to get another proof copy for a final typographical check. And then, all being well, we are good to go, and there should be another Big Red Logic Book to buy by the end of next week. Start saving your pennies.
And if you’ve been meaning to let me know about some error you spotted in a previous version, do let me know if it is still there in this current version. But don’t delay!
Added Jan 28 Refresh your browser to download a version which has got the index linking corrected.
Added Jan 29 Half a dozen misleading internal links removed (see comments), and one typo corrected. Keep ’em coming …
Added Jan 30 Today’s version has improved handling of internal links; and silly thinko about cumulative hierarchy corrected.
Added Jan 31 Some tiny changes to make a few pagebreaks in Chapter 12 fall more nicely. One additional reading added to end of Chapter 9. And at this point, unless some egregious error is pointed out, I’m calling a halt to further tinkering. Famous last words.
So a first proof copy of the Study Guide has arrived surprisingly promptly.
Partly this is to check the cover design, but mainly it is for reading through for typos and layout blunders and other typographical mishaps. It is really startling what newly hits the eye when you have a draft in front of you in physical book form, even after you have previously seen piles of print-out.
But I’m pleased with the look of the book. As you’ll have seen, the design inside and out is just like the other Big Red Logic Books — but people say they look pretty smart, so I’ll rest content with that!
I’ve now checked through the complete draft of Beginning Mathematical Logic: A Study Guide, and you can download it here (all viii + 185 pages of it).
I’ve made a few late content changes (the long ‘overview’ sections on FOL and on set theory have been split into two parts, and I’ve added a few paragraphs in each case). Obviously, this is the sort of project that one could keep tinkering with almost without limit. But I’m going to call it a day.
So it will be one final read through for me, for residual typos and to check for aesthetic flaws like hyphenations that cross pages and so on. And I need to design the cover properly and that sort of thing. Meanwhile, this is the last call for corrections and suggestions, before putting it into the Amazon paperback publishing system for those who would like a hard copy. (Yes, yes, I know that using Amazon is not ideal: but I can and will set the price so low that their royalty take will be pennies. And the result will be much cheaper than the alternatives.)
Added January 21 There’s an updated version (some typographical changes, a few typos corrected, some minor changes in Chapters 1, 2, 4 and 5.) I’ve started setting up the KDP paperback process, doing the cover design etc. The paperback will come out at x + 184 pages, unless the last minute changes alter that, and yet still can be priced at £4.99/$5.99, which is a decent bargain. If you’ve seen a paperback of one of the other, same-format, Big Red Logic books, you’ll know that Amazon in fact make an unexpectedly decent job of their cheap print-on-demand paperbacks.
Last Autumn, at the Dvořákova Praha festival, Boris Giltburg with Veronika Jarůšková and Peter Jarůšek of the Pavel Haas Quartet played all four of Dvořák’s Piano Trios to great acclaim. You can now hear the rather monumental third of them from a Dutch radio broadcast, which you can stream here. The first piece in the long concert is the Grieg Piano Concerto with Boris Giltburg. The Dvořák Trio starts about 1 hour 33 min into the broadcast.
Press the purple “Speel” button, and the controller then appears at the bottom of the webpage. Enjoy!
At last, there is a complete draft of Beginning Mathematical Logic: A Study Guide which you can download here (all viii + 183 pages of it).
I need to do a typographical check for typos and thinkos, and there are such exciting tasks as regularizing spacing conventions and so forth. Then, more importantly, I’ll want to make the tone and level of the treatments of different topics as consistent as I can. Then there are a few sections which I know require more work, including the very last one on type theory. But the end is in sight.
Meanwhile, while I’m revising and polishing, all suggestions, comments and corrections for the current draft will be hugely welcome. (If you do comment, please note the date of the draft you are commenting on!).
Update 12 January: I have tidied Chs 1 and 2 very slightly, including making the early part of §2.1 ‘Sets: a checklist of some basics’ rather snappier. The main content change is otherwise in making §11.5(f) rather clearer and more obviously consistent with §2.4 on virtual classes!
Update 13 January: I have now in addition tidied Chs 3 and 4 slightly, with few substantive changes except for a very slight expansion of §3.1 b(ii) on semantics for quantifiers, and added link backs from §11.5 on plural logic to §4.2 and §4.4 on plural logic.
Update 14 January: Chs 5, 6 and 7 now also tidied. Only corrected some minor typos, added a few words here and there and made some minor typographical adjustments. These chapters had been well worked over before, so I do hope that the speed at which I got through just reflects that the chapters were in a pretty good state, rather than that I’m not paying proper attention! Anyway, in terms of pages, that gets me half way through the revision process. Back to it next week!
How much should a mathematical logician care about free logic? Worries about empty domains or empty names aren’t going to give the mathematician much pause. But there is a more interesting case.
The standard semantic story treats function expressions of a FOL language as denoting total functions — for any object of the domain as input, the function yields a value in the domain as output. Mathematically, however, we often work with partial functions: that’s particularly the case in computability theory, where the notion of a partial recursive function is pivotal. Partial recursive functions, recall, are defined by allowing the application of a minimization or least search operator, which is basically a definite description operator which may fail to return a value. So, it might well seem that in order to reason about computable functions we will need a logic which can accommodate partial functions and definite descriptions that fail to refer, and this means we will need a free logic.
Or at least, this is a claim often made by proponents of free logic. And the claim is vigorously pressed e.g. by Oliver and Smiley in Ch. 11 of their Plural Logic (as they set up the singular logic on which they are going to build their plural logic). Yet O&S give no examples at all of places where mathematical reasoners doing recursive function theory actually use arguments that need to be regimented by changing our standard logic. And if we turn to mainstream theoretical treatments of partial recursive functions in books on computability — including those by philosophically minded authors like Enderton, Epstein & Carnielli or Boolos &Jeffrey — we find not a word about needing to revise our standard logic and adopt a free logic. So what’s going on here?
I think we have to distinguish two quite different claims:
Suppose we want to revise the usual first-order language of arithmetic to allow partial recursive functions, and then construct a formal theory in which we can e.g. do computations of the values of the partial recursive functions (when they have one) in the way we can do simpler formal computations as derivations inside (or inside , formal Primitive Recursive Arithmetic). Then this formal theory with its partial functions will need to be equipped with a free logic to allow for reference failures.
When, it comes to proving general results about partial recursive functions in our usual informal mathematical style, we need to deploy reasoning which presumes a free logic.
Now, (1) may be true. But mathematicians in fact seem to have very little interest in that formalization project (though some computer scientists have written around the topic, though what I have read has been pretty unclear). What they care about is the general theory of computability.
And there seems no good reason for supposing (2) is true. Work through a mathematical text on the general theory of computability, and you’ll see that some care is taken to handle cases where a function has no output. For example, we introduce the notation to indicate that indeed has an output for input ; and we introduce the notation to indicate that either (i) both and and or (ii) neither nor is defined. And then our theorems are framed using this sort of notation to ensure that the mathematical propositions which are stated and proved or disproved are straightforwardly true or false (and aren’t threatened with e.g. truth-valueness because of possibly empty terms). In sum, reflection on the arguments actually deployed by Enderton etc. suggests that the silence of those authors on the question of revising our logic is in fact entirely appropriate. Theorists of computability don’t need a free logic.
As I’ve put it before, self-publishing seemed exactly appropriate for the Big Red Logic Books. They are aimed at students, so why not make them available as widely as can be? — free to download as PDFs, for those happy to work from their screens, and at minimal cost for the significant number who prefer to work from a physical copy.
So how did things go over 2021? The headline stats are these:
Intro Formal Logic
Intro Gödel’s Theorems
Gödel Without Tears
The absolute download stats are very difficult to interpret, because if you open a PDF in your browser on different days, I assume that this counts as a new download — and I can’t begin to guess the typical number of downloads per individual reader. But the relative month-by-month figures will more significant: and for IFL and IGT these remain very stable, while those for GWT have increased quite a bit over the year. As for paperback sales, month-by-month, these remain very steady, and the figures are very acceptable. Modified rapture, then!
(Aside: There is hardback version of IFL and GWT available for libraries, and I’ve been paid for some sales to distributors. But how many hardbacks have actually been sold to real buyers I don’t know — only a few dozen, probably. I rather doubt that I will again go through the palaver of arranging hardback versions of any future books.)
I don’t know what general morals can be drawn from my experiences with these three books. As I’ve also put it before, every book is what it is and not another book, and every author’s situation is what it is. But open-access PDF plus very inexpensive but reasonably well produced paperback is obviously a fairly ideal model for getting stuff out there. I’d be delighted if more people followed the model. But I suppose you can only do this if you no longer need the reputational brownie points of publication by a university press (and if you have a good enough eye to use LaTeX or whatever to produce decent typography!). Maybe it is a model for the idle retired among us, who want to finish that book they’ve being meaning to write …