<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for Logic Matters</title>
	<atom:link href="http://www.logicmatters.net/comments/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>Mon, 06 Feb 2012 19:23:02 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
	<item>
		<title>Comment on Carnap and the Diagonalization Lemma (Continued) by Peter Milne</title>
		<link>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/comment-page-1/#comment-15738</link>
		<dc:creator>Peter Milne</dc:creator>
		<pubDate>Mon, 06 Feb 2012 19:23:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3089#comment-15738</guid>
		<description>I&#039;ve now had the chance to check this.  The Diagonal Lemma/Fixed-Point Theorem isn&#039;t stated as such in Tarski, Mostowski and Robinson but is easily derived from what the three say in section 2, &quot;Definability in arbitrary theories&quot;, in the jointly authored second paper (see pp. 44-47 of the Dover reprint). But since interested there only in decidability, the steps in the derivation aren&#039;t even hinted at. So who did first make that easy derivation? One of Tarski&#039;s students?

[In his &#039;Theories incomparable with respect to relative interpretability&#039; of 1962 Richard Montague refers to the diagonal lemma for Robinson Arithmetic as &quot;well known&quot; and refers to &quot;the familiar proof&quot;.]</description>
		<content:encoded><![CDATA[<p>I&#8217;ve now had the chance to check this.  The Diagonal Lemma/Fixed-Point Theorem isn&#8217;t stated as such in Tarski, Mostowski and Robinson but is easily derived from what the three say in section 2, &#8220;Definability in arbitrary theories&#8221;, in the jointly authored second paper (see pp. 44-47 of the Dover reprint). But since interested there only in decidability, the steps in the derivation aren&#8217;t even hinted at. So who did first make that easy derivation? One of Tarski&#8217;s students?</p>
<p>[In his 'Theories incomparable with respect to relative interpretability' of 1962 Richard Montague refers to the diagonal lemma for Robinson Arithmetic as "well known" and refers to "the familiar proof".]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by Peter Milne</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15737</link>
		<dc:creator>Peter Milne</dc:creator>
		<pubDate>Mon, 06 Feb 2012 19:03:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15737</guid>
		<description>The Ishi Press reprint is some sort of photo-reprint of a pre-1971 edition, an early edition I think. It contains a new forward by Michael Beeson.</description>
		<content:encoded><![CDATA[<p>The Ishi Press reprint is some sort of photo-reprint of a pre-1971 edition, an early edition I think. It contains a new forward by Michael Beeson.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by scott</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15641</link>
		<dc:creator>scott</dc:creator>
		<pubDate>Thu, 02 Feb 2012 11:47:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15641</guid>
		<description>Thank you very much! I just ordered a copy from abebooks.</description>
		<content:encoded><![CDATA[<p>Thank you very much! I just ordered a copy from abebooks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by Peter Smith</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15640</link>
		<dc:creator>Peter Smith</dc:creator>
		<pubDate>Thu, 02 Feb 2012 10:58:32 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15640</guid>
		<description>In footnote 1 of his short piece &#039;The writing of &lt;em&gt;Introduction to Mathematics&lt;/em&gt;&#039; (in Thomas Drucker, ed., &lt;em&gt;Perspectives on the History of Mathematical Logic&lt;/em&gt; (Birkhäuser 1991), Kleene says 
&lt;blockquote&gt;There has been no revision [between the nine reprintings up to 1988]--only a few equal-space changes, two notes added in open spaces at ends of chapters, and the updating of eleven references which in 1952 were &quot;to appear,&quot; as is indicated on p. vi of the sixth (1971) and later reprints.&lt;/blockquote&gt;
So that suggests you can&#039;t go far wrong with any printing, and any from 1971 should be the same.

By the way, there are a lot of inexpensive second-hand copies on abebooks.com</description>
		<content:encoded><![CDATA[<p>In footnote 1 of his short piece &#8216;The writing of <em>Introduction to Mathematics</em>&#8216; (in Thomas Drucker, ed., <em>Perspectives on the History of Mathematical Logic</em> (Birkhäuser 1991), Kleene says </p>
<blockquote><p>There has been no revision [between the nine reprintings up to 1988]&#8211;only a few equal-space changes, two notes added in open spaces at ends of chapters, and the updating of eleven references which in 1952 were &#8220;to appear,&#8221; as is indicated on p. vi of the sixth (1971) and later reprints.</p></blockquote>
<p>So that suggests you can&#8217;t go far wrong with any printing, and any from 1971 should be the same.</p>
<p>By the way, there are a lot of inexpensive second-hand copies on abebooks.com</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by scott</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15639</link>
		<dc:creator>scott</dc:creator>
		<pubDate>Thu, 02 Feb 2012 08:49:22 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15639</guid>
		<description>Professor Smith, I wonder if you wouldn&#039;t mind sharing any knowledge you might have on the various editions and reprints of Kleene&#039;s &lt;i&gt;Introduction to Metamathematics&lt;/i&gt;. I&#039;m trying to get my hands on a copy and while this isn&#039;t itself terribly difficult, what I do find a bit confusing is that Kleene&#039;s book seems to have passed through several publishing houses. Most recently, the book was published by Ishi Press (and according to most accounts, this is essentially an on-demand photocopy). There is a printing from about 1980 on North Holland Press and current copies of this also seem to be &quot;print on demand.&quot; And it is still possible to find used copies of the third and fourth printings of what at least appears to be the original text published by D. Van Nostrand. 

My question: As far as you know, is there a preferred text? (By which I mean a preferring printing on a particular press?) I&#039;d be extraordinarily grateful to you for any insight you might have on this.

By the way, I&#039;m very much looking forward to the second edition of your Introduction to Godel&#039;s Theorems. It&#039;s a wonderful book and I&#039;ll be using it to teach an advanced undergraduate course in logic that I am developing for next year.</description>
		<content:encoded><![CDATA[<p>Professor Smith, I wonder if you wouldn&#8217;t mind sharing any knowledge you might have on the various editions and reprints of Kleene&#8217;s <i>Introduction to Metamathematics</i>. I&#8217;m trying to get my hands on a copy and while this isn&#8217;t itself terribly difficult, what I do find a bit confusing is that Kleene&#8217;s book seems to have passed through several publishing houses. Most recently, the book was published by Ishi Press (and according to most accounts, this is essentially an on-demand photocopy). There is a printing from about 1980 on North Holland Press and current copies of this also seem to be &#8220;print on demand.&#8221; And it is still possible to find used copies of the third and fourth printings of what at least appears to be the original text published by D. Van Nostrand. </p>
<p>My question: As far as you know, is there a preferred text? (By which I mean a preferring printing on a particular press?) I&#8217;d be extraordinarily grateful to you for any insight you might have on this.</p>
<p>By the way, I&#8217;m very much looking forward to the second edition of your Introduction to Godel&#8217;s Theorems. It&#8217;s a wonderful book and I&#8217;ll be using it to teach an advanced undergraduate course in logic that I am developing for next year.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by David Auerbach</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15455</link>
		<dc:creator>David Auerbach</dc:creator>
		<pubDate>Wed, 25 Jan 2012 17:30:49 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15455</guid>
		<description>I was having similar thoughts but with some historical threads (and this may be more like real history of the subject than you want to get into). The Smullyan material comes out of Post Canonical Systems and poor Post is often left out of these accounts. And PCSs are sort an ideal bridge between explicitly recursion theoretic accounts and the who-needs-numbers-we&#039;re-talking-syntax accounts. (I guess the idea here is that from a PCS point of view you don&#039;t analyze formalisms in terms of recursiveness--it&#039;s really the other way around.) The other Smullyan thread, the one that&#039;s more apparent in his later books (but also in some very cute technical articles) is the drive to a certain level of abstraction.  I want to distinguish abstraction from generalization.  Brute generalization is just, for instance, where you prove G1 for all extensions of Q. Abstraction is what Smullyan does in his GIT book or what happens when we study the modal logic provability. But those moves were all already happening in the 1930s; the HB derivability conditions being the obvious example. (I count those as initiating the abstraction route.)  Feferman&#039;s great paper (The Arithmetization of Metamathematics...)  sort of converts abstraction to generalization, by (sort of) finding a way to specify the range of formalisms that do satisfy the HB derivability conditions.  And that&#039;s my potted history ramble.</description>
		<content:encoded><![CDATA[<p>I was having similar thoughts but with some historical threads (and this may be more like real history of the subject than you want to get into). The Smullyan material comes out of Post Canonical Systems and poor Post is often left out of these accounts. And PCSs are sort an ideal bridge between explicitly recursion theoretic accounts and the who-needs-numbers-we&#8217;re-talking-syntax accounts. (I guess the idea here is that from a PCS point of view you don&#8217;t analyze formalisms in terms of recursiveness&#8211;it&#8217;s really the other way around.) The other Smullyan thread, the one that&#8217;s more apparent in his later books (but also in some very cute technical articles) is the drive to a certain level of abstraction.  I want to distinguish abstraction from generalization.  Brute generalization is just, for instance, where you prove G1 for all extensions of Q. Abstraction is what Smullyan does in his GIT book or what happens when we study the modal logic provability. But those moves were all already happening in the 1930s; the HB derivability conditions being the obvious example. (I count those as initiating the abstraction route.)  Feferman&#8217;s great paper (The Arithmetization of Metamathematics&#8230;)  sort of converts abstraction to generalization, by (sort of) finding a way to specify the range of formalisms that do satisfy the HB derivability conditions.  And that&#8217;s my potted history ramble.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by Peter Smith</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15444</link>
		<dc:creator>Peter Smith</dc:creator>
		<pubDate>Wed, 25 Jan 2012 09:39:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15444</guid>
		<description>Yes -- I have nothing but admiration for Smullyan! I&#039;ll certainly be discussing his &lt;em&gt;Theory of Formal Systems&lt;/em&gt; later in the notes, as well as some of his other wonderful books.</description>
		<content:encoded><![CDATA[<p>Yes &#8212; I have nothing but admiration for Smullyan! I&#8217;ll certainly be discussing his <em>Theory of Formal Systems</em> later in the notes, as well as some of his other wonderful books.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Gödel&#8217;s First Theorem, from Gödel 1931 to Kleene 1943 by Marco</title>
		<link>http://www.logicmatters.net/2012/01/godels-first-theorem-from-godel-1931-to-kleene-1943/comment-page-1/#comment-15442</link>
		<dc:creator>Marco</dc:creator>
		<pubDate>Wed, 25 Jan 2012 08:50:08 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3096#comment-15442</guid>
		<description>I wish to suggest an alternative proof related to Godel&#039;s results, which goes back to Raymond Smullyan in his &quot;Theory of Formal Systems&quot;,
This is an excerpt from the introduction:
&quot;Godel&#039;s program of arithmetizing syntax 
is accomplished in a new manner; no appeal is made to primitive recursive  
function theory, prime factorization, theory of congruences or the Chinese 
remainder theorem. A by-product of this approach (which was undertaken 
primarily out of considerations of elegance) is that improved normal form 
theorems are obtained.&quot;</description>
		<content:encoded><![CDATA[<p>I wish to suggest an alternative proof related to Godel&#8217;s results, which goes back to Raymond Smullyan in his &#8220;Theory of Formal Systems&#8221;,<br />
This is an excerpt from the introduction:<br />
&#8220;Godel&#8217;s program of arithmetizing syntax<br />
is accomplished in a new manner; no appeal is made to primitive recursive<br />
function theory, prime factorization, theory of congruences or the Chinese<br />
remainder theorem. A by-product of this approach (which was undertaken<br />
primarily out of considerations of elegance) is that improved normal form<br />
theorems are obtained.&#8221;</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Carnap and the Diagonalization Lemma (Continued) by Stefan Roski</title>
		<link>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/comment-page-1/#comment-15322</link>
		<dc:creator>Stefan Roski</dc:creator>
		<pubDate>Thu, 19 Jan 2012 00:09:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3089#comment-15322</guid>
		<description>A small remark: If you know the English translation of Logische Syntax, you essentially also know Carnap1934a. This paper contains material that Carnap could not include in the original German version, as the publisher wanted to keep the book short. It is, however, contained in the English translation (cf. the preface to the latter).</description>
		<content:encoded><![CDATA[<p>A small remark: If you know the English translation of Logische Syntax, you essentially also know Carnap1934a. This paper contains material that Carnap could not include in the original German version, as the publisher wanted to keep the book short. It is, however, contained in the English translation (cf. the preface to the latter).</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Carnap and the Diagonalization Lemma (Continued) by Peter Smith</title>
		<link>http://www.logicmatters.net/2012/01/carnap-and-the-diagonalization-lemma-continued/comment-page-1/#comment-15265</link>
		<dc:creator>Peter Smith</dc:creator>
		<pubDate>Tue, 17 Jan 2012 08:11:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.logicmatters.net/?p=3089#comment-15265</guid>
		<description>Thanks for all this, Peter. 

I don&#039;t know Carnap 1934a either -- so I can&#039;t comment on that.

But as it chances, I was reading Rosser 1939 just yesterday. His Lemma 1 seems clearly to be a statement of the semantic Diagonalization Equivalence (as I called it) rather than the syntactic Diagonalization Lemma (and that&#039;s all his proof delivers -- it&#039;s all about what can be &lt;em&gt;expressed&lt;/em&gt;, not what can be numeralwise represented (or whatever your favourite jargon is).

Gaifman&#039;s &#039; function that maps every sentence χ to α (‘χ’)  equivalent to it in T&#039; is ambiguous between whether it is semantic equivalence or provable equivalence which is in question. His remark about what is trivial to extract doesn&#039;t seem that apt to the semantic Diagonalization Equivalence (once you&#039;ve cracked Gödel&#039;s rather obtuse mode of presentation in 1931). But true, it is perhaps slightly less trivial to extract the Diagonalization Lemma proper, but then I can&#039;t see that Carnap got it clearly either.

And yes, I agree entirely about Gödel&#039;s added footnote.</description>
		<content:encoded><![CDATA[<p>Thanks for all this, Peter. </p>
<p>I don&#8217;t know Carnap 1934a either &#8212; so I can&#8217;t comment on that.</p>
<p>But as it chances, I was reading Rosser 1939 just yesterday. His Lemma 1 seems clearly to be a statement of the semantic Diagonalization Equivalence (as I called it) rather than the syntactic Diagonalization Lemma (and that&#8217;s all his proof delivers &#8212; it&#8217;s all about what can be <em>expressed</em>, not what can be numeralwise represented (or whatever your favourite jargon is).</p>
<p>Gaifman&#8217;s &#8216; function that maps every sentence χ to α (‘χ’)  equivalent to it in T&#8217; is ambiguous between whether it is semantic equivalence or provable equivalence which is in question. His remark about what is trivial to extract doesn&#8217;t seem that apt to the semantic Diagonalization Equivalence (once you&#8217;ve cracked Gödel&#8217;s rather obtuse mode of presentation in 1931). But true, it is perhaps slightly less trivial to extract the Diagonalization Lemma proper, but then I can&#8217;t see that Carnap got it clearly either.</p>
<p>And yes, I agree entirely about Gödel&#8217;s added footnote.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

