<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Logic Matters &#187; Gödel&#8217;s theorems</title>
	<atom:link href="http://www.logicmatters.net/category/logic/goedels-theorems/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.logicmatters.net</link>
	<description>Logic, enthusiasms, sceptical thoughts, and a little LaTeX geekery</description>
	<lastBuildDate>Tue, 24 Jan 2012 15:48:09 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
		<item>
		<title>Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/</link>
		<comments>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/#comments</comments>
		<pubDate>Tue, 24 Jan 2012 14:05:53 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096</guid>
		<description><![CDATA[As &#8216;homework&#8217;, before writing more of the second edition of my Gödel book, I&#8217;m reading through the literature to see how others have handled the First Incompleteness Theorem, both in the early papers from Gödel on, and then in the &#8230; <a href="http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>As &#8216;homework&#8217;, before writing more of the second edition of my Gödel book, I&#8217;m reading through the literature to see how others have handled the First Incompleteness Theorem, both in the early papers from Gödel on, and then in the later textbook tradition. How do is the Theorem stated? How is it proved? </p>
<p>I&#8217;ve started writing notes on the expository history, and<a href="/resources/pdfs/Exposition.pdf"> here&#8217;s the first (19 page) instalment</a>.  The notes don&#8217;t at all aim to be comprehensive, though I&#8217;d like to know about significant omissions as I go along. They have been written, as much as anything, as a rather detailed aide-memoire for myself (and a source of bits and pieces I might use).  I have done some joining up of the dots to make them tolerably readable, but I certainly haven&#8217;t put in the time to spell out everything out in the way a beginning student might want. Still, you shouldn&#8217;t need much background to follow the twists and turns. </p>
<p>The notes come in three parts. Part 1 looks at early papers by the Founding Fathers. Part 2, to follow,  will look at three pivotal works, Mostowki&#8217;s <em> Sentences Undecidable in Formalized Arithmetic</em> and Kleene&#8217;s <em>Introduction to Metamathematics</em> (both from 1952), and then Tarski, Mostowski and Robinson&#8217;s<em> Undecidable Theories</em> (1953). Part III will continue the story on through some sixty years of textbooks. </p>
<p>Make what use of these notes that you will. Though the usual warning applies in spades, as I&#8217;m no historian: <em>caveat lector</em>! Remember how very easy it to LaTeX your work. Just because what you write then looks very pretty doesn&#8217;t mean that it is any more authoritative &#8230;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/feed/</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Carnap and the Diagonalization Lemma (Continued)</title>
		<link>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/</link>
		<comments>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/#comments</comments>
		<pubDate>Mon, 09 Jan 2012 23:32:31 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=3089</guid>
		<description><![CDATA[Let&#8217;s distinguish what I&#8217;ll call the Diagonalization Equivalence from the familiar Diagonalization Lemma. The former is a semantic claim: in the right conditions, for any one-place predicate of theory T there is a corresponding sentence such that is true if &#8230; <a href="http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Let&#8217;s distinguish what I&#8217;ll call the <em>Diagonalization Equivalence</em> from the familiar <em>Diagonalization Lemma</em>. The former is a semantic claim: in the right conditions, for any one-place predicate <img src='http://s.wordpress.com/latex.php?latex=F%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(x)' title='F(x)' class='latex' /> of theory <em>T</em> there is a corresponding sentence <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> such that <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> is true if and only if <img src='http://s.wordpress.com/latex.php?latex=F%28%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(\overline{\ulcorner G \urcorner})' title='F(\overline{\ulcorner G \urcorner})' class='latex' /> is true. The latter is a syntactic claim: in the right conditions, for any one-place predicate <img src='http://s.wordpress.com/latex.php?latex=F%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(x)' title='F(x)' class='latex' /> of theory <em>T</em> there is a corresponding sentence <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> such that <img src='http://s.wordpress.com/latex.php?latex=T%20%5Cvdash%20G%20%5Cleftrightarrow%20F%28%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T \vdash G \leftrightarrow F(\overline{\ulcorner G \urcorner})' title='T \vdash G \leftrightarrow F(\overline{\ulcorner G \urcorner})' class='latex' />.</p>
<p>In the previous post, I claimed that in his §35 Carnap proves the semantic Diagonalization Equivalence, which he uses in §36 to prove the semantic version of Gödel&#8217;s First Theorem. But I said he doesn&#8217;t prove the Lemma there or give the now canonical syntactic version of the Theorem (the one depending on the syntactic assumption of  <img src='http://s.wordpress.com/latex.php?latex=%5Comega&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\omega' title='\omega' class='latex' />-consistency). </p>
<p>Well, no one has protested yet. So, thus emboldened, let me now stick my neck out further!</p>
<p>What happens later in the book? Carnap&#8217;s notation and terminology together don&#8217;t make for an easy read. But as far as I can see, when he returns to Gödelian matters later, he still is using the semantic Diagonalization Equivalence and not the syntactic Diagonalization Lemma. If the latter was going to appear anywhere, you&#8217;d expect to find it in §60 when Carnap returns to the incompleteness of arithmetics: but it isn&#8217;t there. (An indication: Carnap here talks of provability being &#8216;definable&#8217; in arithmetics, and it is indeed <em>expressible</em> &#8212; but we know it isn&#8217;t <em>capturable/representable</em> by a trivial argument from the Diagonalization Lemma proper. So Carnap hereabouts is <em>still</em> dealing with semantic expressibility, and doesn&#8217;t seem to invoke the syntactic notion of capturing/representing needed for the Lemma.) </p>
<p>So, in summary: Yes, Carnap gives a nice tweak to the argument in §1 of Gödel 1931 for the semantic  incompleteness theorem, by generalizing the basic idea to give the Diagonalization Equivalence. But this isn&#8217;t the modern Diagonalization Lemma. Which isn&#8217;t to say that we can&#8217;t get the Lemma easily using the wff Carnap constructs: however, as far as I can see, Carnap didn&#8217;t explicitly take the step in 1934, even though he is often credited with it. </p>
<p>What am I missing?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/feed/</wfw:commentRss>
		<slash:comments>12</slash:comments>
		</item>
		<item>
		<title>Carnap and the Diagonalization Lemma</title>
		<link>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma/</link>
		<comments>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma/#comments</comments>
		<pubDate>Sat, 07 Jan 2012 00:10:33 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=3064</guid>
		<description><![CDATA[Carnap is often credited with proving the Diagonalization Lemma in Logische Syntax der Sprache. But where does he do it? Well, in §35 Carnap notes the general recipe for taking a one-place predicate and constructing a sentence such that is &#8230; <a href="http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Carnap is often credited with proving the Diagonalization Lemma in <em>Logische Syntax der Sprache</em>. But where does he do it?</p>
<p>Well, in §35 Carnap notes the general recipe for taking a one-place predicate <img src='http://s.wordpress.com/latex.php?latex=F%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(x)' title='F(x)' class='latex' /> and constructing a sentence <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> such that <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> is true if and only if <img src='http://s.wordpress.com/latex.php?latex=F%28%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(\overline{\ulcorner G \urcorner})' title='F(\overline{\ulcorner G \urcorner})' class='latex' /> is true, where as usual <img src='http://s.wordpress.com/latex.php?latex=%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\overline{\ulcorner G \urcorner}' title='\overline{\ulcorner G \urcorner}' class='latex' /> is  the formal numeral for the Gödel number for <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' />.</p>
<p>Fine. But that claim about constructing a <em>semantic</em> equivalence isn&#8217;t the Diagonalization Lemma as normally understood, which is a <em>syntactic</em> thesis, not about truth-value equivalence but about provability. It is the claim that, in the setting of the right kind of theory <img src='http://s.wordpress.com/latex.php?latex=T&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T' title='T' class='latex' />, then for any one-place predicate <img src='http://s.wordpress.com/latex.php?latex=F%28x%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='F(x)' title='F(x)' class='latex' /> we can construct a sentence <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> such that  <img src='http://s.wordpress.com/latex.php?latex=T%20%5Cvdash%20G%20%5Cleftrightarrow%20F%28%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='T \vdash G \leftrightarrow F(\overline{\ulcorner G \urcorner})' title='T \vdash G \leftrightarrow F(\overline{\ulcorner G \urcorner})' class='latex' />. And Carnap doesn&#8217;t prove <em>that </em>in §35.</p>
<p>When we turn to §36, where Carnap proves the incompleteness of his system II, again he appeals to his semantic result not the syntactic Diagonalization Lemma. We now take the relevant predicate to be <small>NOT-PROVABLE</small>: so we get a sentence  <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> which is true if and only if it isn&#8217;t provable. And then Carnap appeals to the <em>soundness</em> of his system II to argue in the elementary way that <img src='http://s.wordpress.com/latex.php?latex=G&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G' title='G' class='latex' /> isn&#8217;t provable. So at this point Carnap is giving a version of the semantic incompleteness argument sketched in the opening section of Gödel 1931 (the one that appeals to a soundness assumption), and <em>not</em> a version of Gödel&#8217;s official syntactic incompleteness argument which appeals to <img src='http://s.wordpress.com/latex.php?latex=%5Comega&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\omega' title='\omega' class='latex' />-consistency. Indeed, Carnap doesn&#8217;t even mention <img src='http://s.wordpress.com/latex.php?latex=%5Comega&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='\omega' title='\omega' class='latex' />-consistency in the context of his §36 incompleteness proof. He doesn&#8217;t need to.</p>
<p>To summarize so far: in §§35&#8211;36, Carnap doesn&#8217;t use the theorem  that his system II proves <img src='http://s.wordpress.com/latex.php?latex=G%5C%20%20%5Cleftrightarrow%5C%20&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='G\  \leftrightarrow\ ' title='G\  \leftrightarrow\ ' class='latex' /> <small>NOT-PROVABLE</small><img src='http://s.wordpress.com/latex.php?latex=%28%5Coverline%7B%5Culcorner%20G%20%5Curcorner%7D%29&#038;bg=ffffff&#038;fg=000000&#038;s=0' alt='(\overline{\ulcorner G \urcorner})' title='(\overline{\ulcorner G \urcorner})' class='latex' />, i.e. he doesn&#8217;t appeal to an application of the Diagonalization Lemma in the modern sense. He doesn&#8217;t need it (yet), and he doesn&#8217;t prove it (here).</p>
<p>But maybe he returns to the fray later in the book &#8230; the story continues!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Somewhat gappy Gödel</title>
		<link>http://www.logicmatters.net/2012/01/somewhat-gappy-godel/</link>
		<comments>http://www.logicmatters.net/2012/01/somewhat-gappy-godel/#comments</comments>
		<pubDate>Tue, 03 Jan 2012 13:29:59 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=3041</guid>
		<description><![CDATA[When planning and actually writing my Introduction to Gödel&#8217;s Theorems, I intentionally consulted other books as little as possible, trying to reconstruct strategies and proofs from memory as far as I could. I thought that would be a good discipline, &#8230; <a href="http://www.logicmatters.net/2012/01/somewhat-gappy-godel/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>When planning and actually writing my <em>Introduction to Gödel&#8217;s Theorems</em>, I intentionally consulted other books as little as possible, trying to reconstruct strategies and proofs from memory as far as I could. I thought that would be a good discipline, and rethinking things through for myself would help me to explain things as clearly as possible. Well, people have indeed said nice things about the clarity of the resulting book, though my writing policy did mean I made a few nasty mistakes, some caught by pre-publication readers, and others corrected in later printings. <span style="color: #ff0000;">I blush to recall ..</span>.</p>
<p>Anyway, now that I am working on a second edition, I want to spend the next month pausing to have a look at how others have handled the First Incompleteness Theorem. The basic shape of my book is fixed (after all, I&#8217;m doing another edition of <em>IGT</em>, not writing another different book, fun though that would be to do): but I might well get inspiration for how to make local improvements. So how do others state the Theorem? And how do they prove it? I&#8217;m planning to write up notes on expository themes and variations as I go along, and will post them here in due course.</p>
<p>The natural place to start is with Hilbert and Bernays. Slight problem: I don&#8217;t have German (yep, schoolboy Greek was all well and good, but hasn&#8217;t exactly been <em>useful</em>). Does anyone out there have detailed notes of how they prove the First Theorem in §5.1 of their second volume? I&#8217;d be really delighted to hear if so! Otherwise, there is a French translation, so I suppose I ought to do battle with that. Not that my French is any good these days either &#8230;</p>
<p>Until I can get hold of a translation of Hilbert and Bernays, then, the expository tradition for me will really have to start with Kleene&#8217;s wonderful 1952 <em>Introduction to Metamathematics</em>. I&#8217;m looking forward a lot to dipping into that again. Then I counted over forty other books on my shelves which give more or less detailed proofs of the First Theorem: hours of fun ahead, obviously. But I&#8217;ve started, yesterday and today, by rereading Gödel&#8217;s 1931 and his 1934 Princeton lectures. <span style="color: #ff0000;">I have to blush again</span>. I&#8217;d forgotten, for example, just what Gödel <em>didn&#8217;t</em> prove in 1931. &#8216;We shall only give an outline of the proof&#8217; that every recursive relation is (as we would now say) representable in <em>P</em>;  &#8217;the entire proof&#8217; [that for any predicate expressing a recursive property/relation there is an equivalent arithmetical predicate] &#8216;can be formalized in the system <em>P</em>&#8216; [it can be, no doubt, but this isn't proved].</p>
<p>In fact, the situation is this. There are in fact two significantly different results stated in the 1931 paper, the &#8216;semantic&#8217; and the &#8216;syntactic&#8217; incompleteness theorems. The first requires that we are dealing with a theory which can <em>express</em> primitive recursive relations and is sound; the second version beefs up the first assumption and requires a theory which can <em>represent</em> p.r. relations while weakening the second assumption to require only that the theory satisfies the syntactic condition of omega-consistency. The first, &#8216;semantic&#8217; theorem is sketched in Gödel&#8217;s §1, the official &#8216;syntactic&#8217; version is the topic of the central §2 and §3. Look carefully, however, and while there <em>is</em> (enough material for) a full proof of the underplayed semantic version, the proof of the &#8216;syntactic&#8217; result (the result that is normally meant when people talk now about the First Theorem) is in fact gappy, gappier than I&#8217;d really remembered.</p>
<p>Meanwhile, I see over 200 people have downloaded the <a href="http://www.logicmatters.net/resources/pdfs/godelbook/Smith_IGT2_Part1.pdf">draft of the first eight chapters of the second edition</a>. Thanks to David Auerbach and Seamus Bradley for some amazingly speedy comments. Keep &#8216;em coming folks!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2012/01/somewhat-gappy-godel/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>IGT2 A first instalment of the second edition of my Gödel book!</title>
		<link>http://www.logicmatters.net/2011/12/igt2-a-first-instalment-of-the-second-edition-of-my-godel-book/</link>
		<comments>http://www.logicmatters.net/2011/12/igt2-a-first-instalment-of-the-second-edition-of-my-godel-book/#comments</comments>
		<pubDate>Thu, 29 Dec 2011 15:05:59 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=3029</guid>
		<description><![CDATA[As I&#8217;ve said before, CUP have agreed to publish a second edition of An Introduction to Gödel&#8217;s Theorems. Camera-ready copy is due to be sent to them rather implausibly soon, by the end of July 2012, with publication six months &#8230; <a href="http://www.logicmatters.net/2011/12/igt2-a-first-instalment-of-the-second-edition-of-my-godel-book/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>As I&#8217;ve said before, CUP have agreed to publish a second edition of <em>An Introduction to Gödel&#8217;s Theorems.</em> Camera-ready copy is due to be sent to them rather implausibly soon, by the end of July 2012, with publication six months or so later(?). I have a slightly larger page budget, but don&#8217;t at the moment intend adding chapters covering much new material: the plan is to do what the current edition does, but do it better (and with some proofs that are currently only sketched filled out better, as the book has a larger mathematical readership than perhaps I was expecting). I also plan (at last!) to have a proper sequence of sets of exercises, but here on the web-site, as there isn&#8217;t room even in an expanded book.</p>
<p>OK, here then is</p>
<blockquote><p>
<a href="/resources/pdfs/godelbook/Smith_IGT2_Part1.pdf">A first instalment of revised chapters of <em>IGT2</em>: Chapters 1 to 8</a>
</p></blockquote>
<p>(these replace the current Chs 1 to 7). I&#8217;ve actually rather enjoyed doing this, and am quite pleased with the results &#8212; in particular, I think I&#8217;ve much improved the too-compressed incompleteness argument in the old Ch. 5. But I&#8217;m simultaneously also a bit cheesed off to see how much those early chapters <em>did</em> need improving. It all just goes to show that when you&#8217;ve finished writing a book, you should really put it in a drawer for three years until you realize what you were really trying to say, and then re-write it. You can just see your research-driven university approving of that policy, eh?</p>
<p>All suggestions/corrections for these revised chapters will be most gratefully received. You can put them in the comments below, though it is probably better all round to  email them (my email address is at the bottom of the &#8220;About Peter Smith&#8221; page). For copyright reasons, I won&#8217;t be able to make all the revised chapters so freely available when I&#8217;ve done them: but anyone who emails comments will be put on a circulation list for future tranches of the new version.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/12/igt2-a-first-instalment-of-the-second-edition-of-my-godel-book/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Next up: Truth, Gödel, and other delights</title>
		<link>http://www.logicmatters.net/2011/12/next-up-truth-godel-and-other-delights/</link>
		<comments>http://www.logicmatters.net/2011/12/next-up-truth-godel-and-other-delights/#comments</comments>
		<pubDate>Sat, 17 Dec 2011 17:49:15 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Books]]></category>
		<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=2998</guid>
		<description><![CDATA[OK: a review of Maddy&#8217;s very engaging recent book (written with Luca Incurvati, which was fun to do) has gone off to Mind. And in the next day or two, I must also put together a review for Phil. Math. &#8230; <a href="http://www.logicmatters.net/2011/12/next-up-truth-godel-and-other-delights/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>OK: a review of <a href="http://www.oup.com/us/catalog/general/subject/Philosophy/LogicMathematics/?view=usa&amp;ci=9780199596188">Maddy&#8217;s very engaging recent book</a> (written with Luca Incurvati, which was fun to do) has gone off to <em>Mind</em>. And in the next day or two, I must also put together a review for <em>Phil. Math.</em> of the altogether less engaging <em><a href="http://www.cambridge.org/us/knowledge/isbn/item5979340">Kurt Gödel and the Foundations of Mathematics</a>, </em>which I was rather grumpily <a href="http://www.logicmatters.net/category/books/kgfm/">posting about here a few weeks ago</a>.</p>
<p>Time then to pause to draw breath for Christmas after a busy/distracting time. But then what&#8217;s next, logically speaking?</p>
<p>Well, I plan to blog here in the new year about two more books that I&#8217;ve been asked to review together &#8212; Leon Horsten&#8217;s <em><a href="http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&amp;tid=12753">The Tarskian Turn: Deflationism and Axiomatic Truth</a></em> and Volker Halbach&#8217;s <em><a href="http://www.cambridge.org/us/knowledge/isbn/item5688151/?site_locale=en_US">Axiomatic Theories of Truth</a>. </em>Not that I claim any special expertise about their topic: but then both books are written for a reader like me &#8212; a philosopher/logician interested in theories of truth, who wants to get a handle on recent some formal developments (to which the respective authors have been notable contributors). Should be very interesting. And since both books have been out for few months, I hope some readers of the blog will be able to chip in helpfully in comments!</p>
<p>But mostly, it will have to be back to Gödel. At the moment, I&#8217;m re-writing the opening chapters of the book for the second edition, and I think very much improving them &#8212; about which I have mixed feelings! On the one hand, it&#8217;s very good to feel the effort of doing a second edition is going to be worth while, but on the other hand, I&#8217;m a bit downcast to see how very far from ideal those chapters previously were. Sigh. Anyway, when I&#8217;ve got the first tranche of chapters more to my liking, I&#8217;ll post them here for comments.</p>
<p>And I&#8217;ve one or two other plans too &#8230; So watch this space!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/12/next-up-truth-godel-and-other-delights/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>KGFM 1: Macintyre on the impact of incompleteness on maths</title>
		<link>http://www.logicmatters.net/2011/10/kgfm-1-macintyre-on-the-impact-of-incompleteness-on-maths/</link>
		<comments>http://www.logicmatters.net/2011/10/kgfm-1-macintyre-on-the-impact-of-incompleteness-on-maths/#comments</comments>
		<pubDate>Fri, 14 Oct 2011 16:25:49 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>
		<category><![CDATA[KGFM]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=2730</guid>
		<description><![CDATA[I&#8217;m going to be reviewing the recently published collection Kurt Gödel and the Foundations of Mathematics edited by Baaz, Papadimitriou, Putnam, Scott and Harper, for Philosophia Mathematica. This looks to a really pretty mixed bag, as is usual with volumes &#8230; <a href="http://www.logicmatters.net/2011/10/kgfm-1-macintyre-on-the-impact-of-incompleteness-on-maths/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>I&#8217;m going to be reviewing the recently published collection <a href="http://www.cambridge.org/gb/knowledge/isbn/item5979340"><em>Kurt Gödel and the Foundations of Mathematics</em></a> edited by Baaz, Papadimitriou, Putnam, Scott and Harper, for <em>Philosophia Mathematica</em>. This looks to a really pretty mixed bag, as is usual with volumes generated by block-buster conferences: but there are some promising names among the contributors, and a quick initial browse suggests that some of the papers should be very worth reading.  So, as I go through the twenty one papers over the coming few weeks, I will intermittently blog about them here.</p>
<p>First up is Angus Macintyre, writing on ‘The impact of Gödel&#8217;s Incompleteness Theorems on Mathematics’. His title is pretty much the same as that of a <a href="http://math.stanford.edu/~feferman/impact.pdf">short and very readable piece by Feferman</a> in the <em>Notices of the AMS </em>and his conclusion is also much the same: the impact is small. To be sure, “Some of the techniques that originated in Gödel’s early work (and in the work of his contemporaries) remain central in logic and occasionally in work connecting logic and the rest of mathematics.” But “[a]s far as incompleteness is concerned, its remote presence has little effect on current mathematics.” For example, “The long-known connections between Diophantine equations, or combinatorics, and consistency statements in set theory seem to have little to do with major structural issues in arithmetic” (p. 14). And similarly elsewhere in maths.</p>
<p>There&#8217;s a lot of reference to mathematical results, and nearly all of the detailed discussion is well beyond my comfort zone (or that of most readers of this blog, I&#8217;d guess: try, e.g., “Étale cohomology of schemes can be used to prove the basic facts of the coefficients of zeta functions of abelian varieties over finite fields”). So I can&#8217;t very usefully comment here.</p>
<p>Probably the most exciting and novel thing in this piece is the substantial appendix which aims to give an outline justification for Macintyre&#8217;s view that we have “good reasons for believing that the current proof(s) of FLT [Fermat's Last Theorem] can be modified, without abandoning the grand lines of such proofs, to proofs in PA.&#8221;  But again, I&#8217;m frankly outside my competence here, and I can only refer enthusiasts (or skeptics) about this project to the paper for the details, which look rather impressive to me.</p>
<p>A decidedly tough read for the opening piece!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/10/kgfm-1-macintyre-on-the-impact-of-incompleteness-on-maths/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Thanks to Orlando May</title>
		<link>http://www.logicmatters.net/2011/10/thanks-to-orlando-may/</link>
		<comments>http://www.logicmatters.net/2011/10/thanks-to-orlando-may/#comments</comments>
		<pubDate>Wed, 12 Oct 2011 13:40:04 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=2727</guid>
		<description><![CDATA[I&#8217;m getting back down to work on the second edition of An Introduction to Gödel&#8217;s Theorems. One thing I plan to do is to put up some pages of exercises as I go along, which I&#8217;ve been meaning to do &#8230; <a href="http://www.logicmatters.net/2011/10/thanks-to-orlando-may/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>I&#8217;m getting back down to work on the second edition of <em>An Introduction to Gödel&#8217;s Theorems. </em>One thing I plan to do is to put up some pages of exercises as I go along, which I&#8217;ve been meaning to do for ages, but takes a surprising amount of time. Watch this space.</p>
<p>Meanwhile, one interim thing I&#8217;ve just done is put online a major update to the <a href="/igt/corrections/further-corrections">corrections page</a> for the latest printing(s) of the first edition. The corrections are almost all due to Orlando May, who has evidently been reading the book with a quite preternaturally accurate eye. I&#8217;m most grateful.</p>
<p>If anyone else has anything to add, large or small, about how to improve the book next time around, then of course I&#8217;ll again be more than grateful!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/10/thanks-to-orlando-may/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Good news on 2nd edn of IGT</title>
		<link>http://www.logicmatters.net/2011/07/good-news-on-2nd-edn-of-igt/</link>
		<comments>http://www.logicmatters.net/2011/07/good-news-on-2nd-edn-of-igt/#comments</comments>
		<pubDate>Sat, 23 Jul 2011 16:10:53 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=2536</guid>
		<description><![CDATA[Good news. I&#8217;ve a contract to do a 2nd edition of my Gödel book. Not quite under the terms I&#8217;d have ideally liked, like another 50 pages, a couple of years or more to do it, and of course a &#8230; <a href="http://www.logicmatters.net/2011/07/good-news-on-2nd-edn-of-igt/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Good news. I&#8217;ve a contract to do a 2nd edition of my Gödel book. Not quite under the terms I&#8217;d have ideally liked, like another 50 pages, a couple of years or more to do it, and of course a humungous slice of the royalties. In fact the press want it next year, and I&#8217;ve only about another 20 pages to play with. But the discipline will be good for me, and some will think that 380 pages will be quite enough, thank you, for what&#8217;s called an &#8216;Introduction&#8217;. So &#8230; down to work.</p>
<p>Or at least, it&#8217;s back to Gödel after I&#8217;ve written the overdue review of Alan Weir&#8217;s book. Watch this space for, belatedly, a few more thoughts on that. Meanwhile, if you&#8217;ve bright ideas about how to improve the Gödel book, do let me know!</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/07/good-news-on-2nd-edn-of-igt/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Four lectures on the First Incompleteness Theorem</title>
		<link>http://www.logicmatters.net/2011/06/four-lectures-on-the-first-incompleteness-theorem/</link>
		<comments>http://www.logicmatters.net/2011/06/four-lectures-on-the-first-incompleteness-theorem/#comments</comments>
		<pubDate>Tue, 07 Jun 2011 11:42:49 +0000</pubDate>
		<dc:creator>Peter Smith</dc:creator>
				<category><![CDATA[Gödel's theorems]]></category>

		<guid isPermaLink="false">http://www.logicmatters.net/?p=2472</guid>
		<description><![CDATA[Better late than never &#8212; here&#8217;s what I said, more or less, in four lectures earlier this term on the First Incompleteness Theorem. The lectures were aimed for maths students, but only the last of the four requires a bit &#8230; <a href="http://www.logicmatters.net/2011/06/four-lectures-on-the-first-incompleteness-theorem/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Better late than never &#8212; here&#8217;s what I said, more or less, in four lectures earlier this term on <a href="http://www.logicmatters.net/resources/pdfs/PartIII.pdf">the First Incompleteness Theorem</a>. The lectures were aimed for  maths students, but only the last of the four requires a bit of background in computability theory.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.logicmatters.net/2011/06/four-lectures-on-the-first-incompleteness-theorem/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

