<?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 on: Constructive gem: double exponentials</title>
	<atom:link href="http://math.andrej.com/2009/10/12/constructive-gem-double-exponentials/feed/" rel="self" type="application/rss+xml" />
	<link>http://math.andrej.com/2009/10/12/constructive-gem-double-exponentials/</link>
	<description>Mathematics for computers</description>
	<lastBuildDate>Mon, 30 Jan 2012 07:14:48 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2-beta2-18055</generator>
	<item>
		<title>By: Andrej Bauer</title>
		<link>http://math.andrej.com/2009/10/12/constructive-gem-double-exponentials/comment-page-1/#comment-12717</link>
		<dc:creator>Andrej Bauer</dc:creator>
		<pubDate>Wed, 21 Oct 2009 13:13:50 +0000</pubDate>
		<guid isPermaLink="false">http://math.andrej.com/?p=338#comment-12717</guid>
		<description>&lt;a href=&quot;http://ai.ijs.si/France/&quot; rel=&quot;nofollow&quot;&gt;France Dacar&lt;/a&gt; asked me to post &lt;a href=&quot;/wp-content/uploads/2009/10/22n-iso-n-classic.pdf&quot; rel=&quot;nofollow&quot;&gt;this classical proof (PDF)&lt;/a&gt; that $2^{2^\mathbb{N}} = \mathbb{N}$ in the category of topological spaces. It should help &quot;normal&quot; mathematicians see what is going on. Thank you, France!</description>
		<content:encoded><![CDATA[<p><a href="http://ai.ijs.si/France/" rel="nofollow">France Dacar</a> asked me to post <a href="/wp-content/uploads/2009/10/22n-iso-n-classic.pdf" rel="nofollow">this classical proof (PDF)</a> that $2^{2^\mathbb{N}} = \mathbb{N}$ in the category of topological spaces. It should help &#8220;normal&#8221; mathematicians see what is going on. Thank you, France!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Andrej Bauer</title>
		<link>http://math.andrej.com/2009/10/12/constructive-gem-double-exponentials/comment-page-1/#comment-12716</link>
		<dc:creator>Andrej Bauer</dc:creator>
		<pubDate>Wed, 21 Oct 2009 13:10:15 +0000</pubDate>
		<guid isPermaLink="false">http://math.andrej.com/?p=338#comment-12716</guid>
		<description>I gave a talk about this at the local &lt;a href=&quot;http://www.fmf.uni-lj.si/en/news/agregator/seminar-osnove/&quot; rel=&quot;nofollow&quot;&gt;Seminar for foundations (of mathematics and theoretical computer science)&lt;/a&gt;. &lt;a href=&quot;http://www.fmf.uni-lj.si/~petkovsek/&quot; rel=&quot;nofollow&quot;&gt;Marko PetkovÅ¡ek&lt;/a&gt; pointed out that classically $2^{2^\mathbb{N}} = \mathbb{N}$ if we interpret exponentiation as ordinal arithmetic. That is, for ordinals we have $2^{2^\omega} = \omega$. Thank you for a nice observation, Marko!</description>
		<content:encoded><![CDATA[<p>I gave a talk about this at the local <a href="http://www.fmf.uni-lj.si/en/news/agregator/seminar-osnove/" rel="nofollow">Seminar for foundations (of mathematics and theoretical computer science)</a>. <a href="http://www.fmf.uni-lj.si/~petkovsek/" rel="nofollow">Marko PetkovÅ¡ek</a> pointed out that classically $2^{2^\mathbb{N}} = \mathbb{N}$ if we interpret exponentiation as ordinal arithmetic. That is, for ordinals we have $2^{2^\omega} = \omega$. Thank you for a nice observation, Marko!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Bas</title>
		<link>http://math.andrej.com/2009/10/12/constructive-gem-double-exponentials/comment-page-1/#comment-12685</link>
		<dc:creator>Bas</dc:creator>
		<pubDate>Mon, 12 Oct 2009 08:04:24 +0000</pubDate>
		<guid isPermaLink="false">http://math.andrej.com/?p=338#comment-12685</guid>
		<description>Nice post!

Regarding references to the intuitionistic axioms. You could try the following two text books:
A. S. Troelstra and D. van Dalen. Constructivism in mathematics, vols. 1 and 2.
Not online, but &lt;a href=&quot;http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ndjfl/1093635756&quot; rel=&quot;nofollow&quot;&gt;Beeson&#039;s review&lt;/a&gt; is.
Bridges and Richman - &lt;a href=&quot;http://books.google.com/books?id=oN5nsPkXhhsC&amp;printsec=frontcover&amp;dq=bridges+richman+constructive+mathematics#v=onepage&amp;q=&amp;f=false&quot; rel=&quot;nofollow&quot;&gt; Varieties of Constructive Mathematics&lt;/a&gt; (google books has some of the relevant pages online).

There are many other references, I tried to give my own view on them in the first two pages of this &lt;a href=&quot;http://arxiv.org/abs/math/0703561&quot; rel=&quot;nofollow&quot;&gt;paper&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>Nice post!</p>
<p>Regarding references to the intuitionistic axioms. You could try the following two text books:<br />
A. S. Troelstra and D. van Dalen. Constructivism in mathematics, vols. 1 and 2.<br />
Not online, but <a href="http://projecteuclid.org/DPubS?service=UI&amp;version=1.0&amp;verb=Display&amp;handle=euclid.ndjfl/1093635756" rel="nofollow">Beeson&#8217;s review</a> is.<br />
Bridges and Richman &#8211; <a href="http://books.google.com/books?id=oN5nsPkXhhsC&amp;printsec=frontcover&amp;dq=bridges+richman+constructive+mathematics#v=onepage&amp;q=&amp;f=false" rel="nofollow"> Varieties of Constructive Mathematics</a> (google books has some of the relevant pages online).</p>
<p>There are many other references, I tried to give my own view on them in the first two pages of this <a href="http://arxiv.org/abs/math/0703561" rel="nofollow">paper</a>.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

