<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>Mathematical Logic</title>
<link>http://localhost:8080/xmlui/handle/123456789/735</link>
<description/>
<pubDate>Sat, 04 Apr 2026 11:43:27 GMT</pubDate>
<dc:date>2026-04-04T11:43:27Z</dc:date>
<item>
<title>Mathematical Logic</title>
<link>http://localhost:8080/xmlui/handle/123456789/736</link>
<description>Mathematical Logic
Chiswell, Ian
The book covers a standard syllabus in propositional and predicate logic.&#13;
A teacher could use it to follow a geodesic path from truth tables to the Completeness&#13;
Theorem. Teachers who are willing to follow our choice of examples&#13;
from diophantine arithmetic (and are prepared to take on trust Matiyasevich’s&#13;
analysis of diophantine relations) should find, as we did, that G¨odel’s Incompleteness&#13;
Theorem and the undecidability of predicate logic fall out with almost no&#13;
extra work.
</description>
<pubDate>Mon, 01 Jan 2007 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://localhost:8080/xmlui/handle/123456789/736</guid>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
