<?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: Still No Word On The Clifford Algebra Text</title>
	<atom:link href="http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/feed/" rel="self" type="application/rss+xml" />
	<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/</link>
	<description>software development and consulting</description>
	<lastBuildDate>Fri, 30 Dec 2011 03:29:52 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3</generator>
	<item>
		<title>By: Study with Me &#8212; Maybe Relation Algebras? :: nklein software</title>
		<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/comment-page-1/#comment-89</link>
		<dc:creator>Study with Me &#8212; Maybe Relation Algebras? :: nklein software</dc:creator>
		<pubDate>Thu, 04 Jun 2009 20:33:07 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=467#comment-89</guid>
		<description>[...] an earlier post, I was soliciting recommendations for texts to study since I cannot seem to get Cambridge University Press to respond to me. Paul Reiners suggested [...]</description>
		<content:encoded><![CDATA[<p>[...] an earlier post, I was soliciting recommendations for texts to study since I cannot seem to get Cambridge University Press to respond to me. Paul Reiners suggested [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pat</title>
		<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/comment-page-1/#comment-79</link>
		<dc:creator>pat</dc:creator>
		<pubDate>Sat, 30 May 2009 02:36:31 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=467#comment-79</guid>
		<description>That&#039;s fine.  They have it at the Math Library at the U.  I have been meaning to get there some time anyhow.</description>
		<content:encoded><![CDATA[<p>That&#8217;s fine.  They have it at the Math Library at the U.  I have been meaning to get there some time anyhow.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: paulreiners</title>
		<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/comment-page-1/#comment-78</link>
		<dc:creator>paulreiners</dc:creator>
		<pubDate>Sat, 30 May 2009 01:48:32 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=467#comment-78</guid>
		<description>Well, actually, I don&#039;t have it.  When I read your post, since I&#039;m more interested in logic and set theory (recursion theory, in particular) than I am in algebra, I looked for some interesting logic text books that went beyond what I studied in grad school.  Anyway, that was one of them that looked interesting.</description>
		<content:encoded><![CDATA[<p>Well, actually, I don&#8217;t have it.  When I read your post, since I&#8217;m more interested in logic and set theory (recursion theory, in particular) than I am in algebra, I looked for some interesting logic text books that went beyond what I studied in grad school.  Anyway, that was one of them that looked interesting.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pat</title>
		<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/comment-page-1/#comment-77</link>
		<dc:creator>pat</dc:creator>
		<pubDate>Sat, 30 May 2009 00:00:39 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=467#comment-77</guid>
		<description>If you have &lt;q&gt;Relation Algebras by Games&lt;/q&gt;, would you bring it to the TC Lispers meeting for me to skim?

Thanks...</description>
		<content:encoded><![CDATA[<p>If you have <q>Relation Algebras by Games</q>, would you bring it to the TC Lispers meeting for me to skim?</p>
<p>Thanks&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: paulreiners</title>
		<link>http://nklein.com/2009/05/still-no-word-on-the-clifford-algebra-text/comment-page-1/#comment-76</link>
		<dc:creator>paulreiners</dc:creator>
		<pubDate>Fri, 29 May 2009 23:06:42 +0000</pubDate>
		<guid isPermaLink="false">http://nklein.com/?p=467#comment-76</guid>
		<description>Here are a few suggestions:



&lt;a href=&quot;http://www.amazon.com/Computability-Enumerability-Unsolvability-Directions-Mathematical/dp/0521557364&quot; rel=&quot;nofollow&quot;&gt;Computability, Enumerability, Unsolvability: Directions in Recursion Theory&lt;/a&gt;


&lt;a href=&quot;http://www.elsevier.com/wps/find/bookdescription.cws_home/625473/description#description&quot; rel=&quot;nofollow&quot;&gt;RELATION ALGEBRAS BY GAMES&lt;/a&gt;


&lt;a href=&quot;http://www.elsevier.com/wps/find/bookdescription.cws_home/522043/description#description&quot; rel=&quot;nofollow&quot;&gt;LANGUAGE IN ACTION&lt;/a&gt;



I also have these books on my shelves that I either need to finish or
need to read one of these days:


  
  &lt;a href=&quot;http://mitpress.mit.edu/sicp/&quot; rel=&quot;nofollow&quot;&gt;Structure and Interpretation of Computer Programs&lt;/a&gt;
  
  
  &lt;a href=&quot;http://books.google.com/books?id=3geYp44hJVcC&amp;dq=Turtle+Geometry&quot; rel=&quot;nofollow&quot;&gt;Turtle Geometry&lt;/a&gt;
  
  
  &lt;a href=&quot;http://books.google.com/books?id=mJFiNwAACAAJ&amp;dq=Algorithmic+Composition+Nierhaus&quot; rel=&quot;nofollow&quot;&gt;Algorithmic Composition&lt;/a&gt;
  
  &lt;a href=&quot;http://books.google.com/books?id=6_CcsKjNbzUC&quot; rel=&quot;nofollow&quot;&gt;To Mock a Mockingbird and Other Logic Puzzles&lt;/a&gt;
  
  


These are also on my to-read list, although they&#039;re mainly for review:


  
  &lt;a href=&quot;http://books.google.com/books?id=x6cZBQ9qtgoC&quot; rel=&quot;nofollow&quot;&gt;Naive Set Theory&lt;/a&gt;
  
  
  &lt;a href=&quot;http://books.google.com/books?id=jFRwDqpoN2UC&quot; rel=&quot;nofollow&quot;&gt;Introduction
  to Logic&lt;/a&gt;
  
</description>
		<content:encoded><![CDATA[<p>Here are a few suggestions:</p>
<p><a href="http://www.amazon.com/Computability-Enumerability-Unsolvability-Directions-Mathematical/dp/0521557364" rel="nofollow">Computability, Enumerability, Unsolvability: Directions in Recursion Theory</a></p>
<p><a href="http://www.elsevier.com/wps/find/bookdescription.cws_home/625473/description#description" rel="nofollow">RELATION ALGEBRAS BY GAMES</a></p>
<p><a href="http://www.elsevier.com/wps/find/bookdescription.cws_home/522043/description#description" rel="nofollow">LANGUAGE IN ACTION</a></p>
<p>I also have these books on my shelves that I either need to finish or<br />
need to read one of these days:</p>
<p>  <a href="http://mitpress.mit.edu/sicp/" rel="nofollow">Structure and Interpretation of Computer Programs</a></p>
<p>  <a href="http://books.google.com/books?id=3geYp44hJVcC&amp;dq=Turtle+Geometry" rel="nofollow">Turtle Geometry</a></p>
<p>  <a href="http://books.google.com/books?id=mJFiNwAACAAJ&amp;dq=Algorithmic+Composition+Nierhaus" rel="nofollow">Algorithmic Composition</a></p>
<p>  <a href="http://books.google.com/books?id=6_CcsKjNbzUC" rel="nofollow">To Mock a Mockingbird and Other Logic Puzzles</a></p>
<p>These are also on my to-read list, although they&#8217;re mainly for review:</p>
<p>  <a href="http://books.google.com/books?id=x6cZBQ9qtgoC" rel="nofollow">Naive Set Theory</a></p>
<p>  <a href="http://books.google.com/books?id=jFRwDqpoN2UC" rel="nofollow">Introduction<br />
  to Logic</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

