<?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&#039;s blog &#187; Mathematical Logic</title>
	<atom:link href="http://www.mathrix.org/liquid/category/logic/feed" rel="self" type="application/rss+xml" />
	<link>http://www.mathrix.org/liquid</link>
	<description>Information theory, algorithmic complexity and the foundations of computation</description>
	<lastBuildDate>Thu, 26 Aug 2010 06:55:48 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<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>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>
	</channel>
</rss>
