<?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>Anima Ex Machina &#124; Hector Zenil's blog &#187; Foundations of Math</title>
	<atom:link href="http://www.mathrix.org/liquid/category/foundations-of-math/feed" rel="self" type="application/rss+xml" />
	<link>http://www.mathrix.org/liquid</link>
	<description>Hector Zenil's blog on foundations, metamathematics and computation</description>
	<lastBuildDate>Mon, 21 Jun 2010 16:35:20 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Collections of axioms and information on theories dependency</title>
		<link>http://www.mathrix.org/liquid/archives/lists-of-axioms-and-theories-dependancy</link>
		<comments>http://www.mathrix.org/liquid/archives/lists-of-axioms-and-theories-dependancy#comments</comments>
		<pubDate>Sat, 03 Mar 2007 14:26:54 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Foundations of Math]]></category>
		<category><![CDATA[Mathematical Logic]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=137</guid>
		<description><![CDATA[List of Axioms from Computer Science Department, University of Miami
Documentation, Computer Science Department, University of Miami
List of axioms collected from Wikipedia.
MBase: A Mathematical Knowledge Base. A collection of definitions, theorems and proofs.
The Mathematical Atlas.
Methamath.
Proof symbolic visualizations, University of Texas.
]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/lists-of-axioms-and-theories-dependancy/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>&#8220;The ways of paradox&#8221;: Quine on Berry&#8217;s paradox.</title>
		<link>http://www.mathrix.org/liquid/archives/the-ways-of-paradox-quine-on-berrys-paradox</link>
		<comments>http://www.mathrix.org/liquid/archives/the-ways-of-paradox-quine-on-berrys-paradox#comments</comments>
		<pubDate>Sat, 03 Mar 2007 13:54:56 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Foundations of Math]]></category>
		<category><![CDATA[paradoxes]]></category>
		<category><![CDATA[Quine]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=136</guid>
		<description><![CDATA[&#8220;Ten has a one-syllable name. Seventy-seven has a five-syllable
name. The seventh power of seven hundred seventy-seven has a name
that, if we were to work it out, might run to 100 syllables or so;
but this number can also be specified more briefly in other terms. I
have just specified it in 15 syllables. We can be sure, [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/the-ways-of-paradox-quine-on-berrys-paradox/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Book on self-reference (comprising papers by various contributors)</title>
		<link>http://www.mathrix.org/liquid/archives/book-on-self-reference-by-contributing-papers</link>
		<comments>http://www.mathrix.org/liquid/archives/book-on-self-reference-by-contributing-papers#comments</comments>
		<pubDate>Sat, 03 Mar 2007 13:50:19 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Foundations of Math]]></category>
		<category><![CDATA[selfreference]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=135</guid>
		<description><![CDATA[Table of contents and introduction:
http://www.imm.dtu.dk/~tb/genintro.pdf
]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/book-on-self-reference-by-contributing-papers/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On single and shortest axioms</title>
		<link>http://www.mathrix.org/liquid/archives/on-single-and-shortest-axioms</link>
		<comments>http://www.mathrix.org/liquid/archives/on-single-and-shortest-axioms#comments</comments>
		<pubDate>Sat, 03 Mar 2007 13:42:39 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Foundations of Math]]></category>
		<category><![CDATA[Mathematical Logic]]></category>
		<category><![CDATA[axioms]]></category>
		<category><![CDATA[Boolean logic]]></category>
		<category><![CDATA[simple programs]]></category>

		<guid isPermaLink="false">http://www.mathrix.org/liquid/?p=133</guid>
		<description><![CDATA[Both the philosopher Charles Sanders Peirce in 1880 and the American logician H. M. Sheffer in 1913 realized that the truth-functions of elementary logic could all be defined from a single operation. The Sheffer stroke, also known as the NAND operation, is a logical operator with the following meaning: p NAND q is true if [...]]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/on-single-and-shortest-axioms/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Human Readable Proofs Visualization</title>
		<link>http://www.mathrix.org/liquid/archives/human-readable-automatic-proofs-2</link>
		<comments>http://www.mathrix.org/liquid/archives/human-readable-automatic-proofs-2#comments</comments>
		<pubDate>Sun, 12 Nov 2006 00:34:18 +0000</pubDate>
		<dc:creator>Hector Zenil</dc:creator>
				<category><![CDATA[Foundations of Math]]></category>
		<category><![CDATA[Natural Language and Computational Linguistics]]></category>
		<category><![CDATA[New Ideas]]></category>
		<category><![CDATA[mental representation]]></category>
		<category><![CDATA[proofs]]></category>
		<category><![CDATA[visualization]]></category>

		<guid isPermaLink="false">http://mathrix.org/liquid/?p=43</guid>
		<description><![CDATA[- Symbolic Visualizations, University of Texas:http://cvcweb.ices.utexas.edu/ccv/projects/VisualEyes/SymbVis/index.php- Proof nets and zero-knowledge proofs.
]]></description>
		<wfw:commentRss>http://www.mathrix.org/liquid/archives/human-readable-automatic-proofs-2/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
