<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Mathematical Logic</title>
<link href="http://localhost:8080/xmlui/handle/123456789/735" rel="alternate"/>
<subtitle/>
<id>http://localhost:8080/xmlui/handle/123456789/735</id>
<updated>2026-04-04T11:43:08Z</updated>
<dc:date>2026-04-04T11:43:08Z</dc:date>
<entry>
<title>Mathematical Logic</title>
<link href="http://localhost:8080/xmlui/handle/123456789/736" rel="alternate"/>
<author>
<name>Chiswell, Ian</name>
</author>
<id>http://localhost:8080/xmlui/handle/123456789/736</id>
<updated>2013-03-22T05:24:57Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">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.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
</feed>
