<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://localhost:8080/xmlui/handle/123456789/735">
<title>Mathematical Logic</title>
<link>http://localhost:8080/xmlui/handle/123456789/735</link>
<description/>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://localhost:8080/xmlui/handle/123456789/736"/>
</rdf:Seq>
</items>
<dc:date>2026-04-04T11:43:17Z</dc:date>
</channel>
<item rdf:about="http://localhost:8080/xmlui/handle/123456789/736">
<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>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
