<?xml version="1.0" encoding="UTF-8"?>
<GoodreadsResponse>
	<Request>
		<authentication>false</authentication>
		    <method><![CDATA[]]></method>
	</Request>
	<author>
  
  <id>481797</id>
  <name><![CDATA[Wilfrid Hodges]]></name>
  <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
  <fans_count type="integer">0</fans_count>
  <followers_count type="integer">0</followers_count>
  <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
  <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
  <about><![CDATA[]]></about>
  <influences><![CDATA[]]></influences>
  <gender></gender>
  <hometown></hometown>
  <born_at></born_at>
  <died_at></died_at>
  
  <books>
        <book>
  <id type="integer">1527977</id>
  <isbn>0141003146</isbn>
  <isbn13>9780141003146</isbn13>
  <text_reviews_count type="integer">3</text_reviews_count>
  <title>
    <![CDATA[Logic: Second Edition]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1184768901m/1527977.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1184768901s/1527977.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1527977.Logic_Second_Edition</link>
  <average_rating>4.00</average_rating>
  <ratings_count>8</ratings_count>
  <description>
    <![CDATA[If a man supports Arsenal one day and Spurs the next then he is fickle but not necessarily illogical. From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>2005</published>
</book>

        <book>
  <id type="integer">948126</id>
  <isbn>0521587131</isbn>
  <isbn13>9780521587136</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[A Shorter Model Theory]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1179712508m/948126.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1179712508s/948126.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/948126.A_Shorter_Model_Theory</link>
  <average_rating>3.67</average_rating>
  <ratings_count>3</ratings_count>
  <description>
    <![CDATA[This is an up-to-date textbook of model theory taking the reader from first definitions to Morley's theorem and the elementary parts of stability theory. Besides standard results such as the compactness and omitting types theorems, it also describes various links with algebra, including the Skolem-Tarski method of quantifier elimination, model completeness, automorphism groups and omega-categoricity, ultraproducts, O-minimality and structures of finite Morley rank. The material on back-and-forth equivalences, interpretations and zero-one laws can serve as an introduction to applications of model theory in computer science. Each chapter finishes with a brief commentary on the literature and suggestions for further reading. This book will benefit graduate students with an interest in model theory.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>1997</published>
</book>

        <book>
  <id type="integer">1843582</id>
  <isbn>0140219854</isbn>
  <isbn13>9780140219852</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Logic: An Introduction to Elementary Logic]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1843582.Logic_An_Introduction_to_Elementary_Logic</link>
  <average_rating>5.00</average_rating>
  <ratings_count>1</ratings_count>
  <description>
    <![CDATA[If a man supports Arsenal one day and Spurs the next then he is fickle but not necessarily illogical. From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>1980</published>
</book>

        <book>
  <id type="integer">1527978</id>
  <isbn>0521304423</isbn>
  <isbn13>9780521304429</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Model Theory]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1184768901m/1527978.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1184768901s/1527978.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1527978.Model_Theory</link>
  <average_rating>4.00</average_rating>
  <ratings_count>1</ratings_count>
  <description>
    <![CDATA[Professor Hodges emphasizes definability and methods of construction, and introduces the reader to advanced topics such as stability.  He also provides the reader with much historical information and a full bibliography, enhancing the book's use as a reference.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>1993</published>
</book>

        <book>
  <id type="integer">4645821</id>
  <isbn>0521268974</isbn>
  <isbn13>9780521268974</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Building Models by Games]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/4645821.Building_Models_by_Games</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[This book introduces a general method for building infinite mathematical structures, and surveys its applications in algebra and model theory. The basic idea behind the method is to build a structure by a procedure with infinitely many steps, similar to a game between two players that goes on indefinitely. The approach is new and helps to simplify, motivate and unify a wide range of constructions that were previously carried out separately and by ad hoc methods. The first chapter provides a resume of basic model theory. A wide variety of algebraic applications are studied, with detailed analyses of existentially closed groups of class 2. Another chapter describes the classical model-theoretic form of this method -of construction, which is known variously as 'omitting types', 'forcing' or the 'Henkin-Orey theorem'. The last three chapters are more specialised and discuss how the same idea can be used to build uncountable structures. Applications include completeness for Magidor-Malitz quantifiers, and Shelah's recent and sophisticated omitting types theorem for L(Q). There are also applications to Bdolean algebras and models of arithmetic.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>1985</published>
</book>

        <book>
  <id type="integer">3285651</id>
  <isbn>0140136363</isbn>
  <isbn13>9780140136364</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Logic: An Introduction to Elementary Logic]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/3285651.Logic_An_Introduction_to_Elementary_Logic</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[If a man supports Arsenal one day and Spurs the next then he is fickle but not necessarily illogical. From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material.]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>1980</published>
</book>

        <book>
  <id type="integer">1527976</id>
  <isbn>0486450171</isbn>
  <isbn13>9780486450179</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Building Models by Games]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1184768896m/1527976.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1184768896s/1527976.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1527976.Building_Models_by_Games</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[&lt;div&gt;This volume introduces a general method for building infinite mathematical structures and surveys applications in algebra and model theory. It covers basic model theory and examines a variety of algebraic applications, including completeness for Magidor-Malitz quantifiers, Shelah's recent and sophisticated omitting types theorem for L(Q), and applications to Boolean algebras. Over 160 exercises. 1985 edition. <br/>&lt;/div&gt;]]>
  </description>
<authors>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>2006</published>
</book>

        <book>
  <id type="integer">1527979</id>
  <isbn>0199215626</isbn>
  <isbn13>9780199215621</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Mathematical Logic]]>
  </title>
  <image_url>http://photo.goodreads.com/books/1184768907m/1527979.jpg</image_url>
  <small_image_url>http://photo.goodreads.com/books/1184768907s/1527979.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/1527979.Mathematical_Logic</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic.  At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics.  Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations.  Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved.  Optional sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch.  Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches.  Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in Logic, Mathematics, Philosophy, and Computer Science.]]>
  </description>
<authors>
    <author>
    <id>712634</id>
        <name><![CDATA[Ian Chiswell]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/712634.Ian_Chiswell]]></link>
    <average_rating>0.0</average_rating>
    <ratings_count>0</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>2007</published>
</book>

        <book>
  <id type="integer">6577030</id>
  <isbn>0198571003</isbn>
  <isbn13>9780198571001</isbn13>
  <text_reviews_count type="integer">0</text_reviews_count>
  <title>
    <![CDATA[Mathematical Logic]]>
  </title>
  <image_url>http://www.goodreads.com/images/nocover-111x148.jpg</image_url>
  <small_image_url>http://www.goodreads.com/images/nocover-60x80.jpg</small_image_url>
  <link>http://www.goodreads.com/book/show/6577030-mathematical-logic</link>
  <average_rating>0.0</average_rating>
  <ratings_count>0</ratings_count>
  <description>
    <![CDATA[Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic.  At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics.  Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved.  Optinal sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch.  Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches.  Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in logic, mathematics, philosophy, and computer science.]]>
  </description>
<authors>
    <author>
    <id>712634</id>
        <name><![CDATA[Ian Chiswell]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/712634.Ian_Chiswell]]></link>
    <average_rating>0.0</average_rating>
    <ratings_count>0</ratings_count>
    <text_reviews_count>0</text_reviews_count>
  </author>
    <author>
    <id>481797</id>
        <name><![CDATA[Wilfrid Hodges]]></name>
    <image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-200x266.jpg]]></image_url>
    <small_image_url><![CDATA[http://www.goodreads.com/images/nophoto/nophoto-U-50x66.jpg]]></small_image_url>
    <link><![CDATA[http://www.goodreads.com/author/show/481797.Wilfrid_Hodges]]></link>
    <average_rating>4.00</average_rating>
    <ratings_count>13</ratings_count>
    <text_reviews_count>3</text_reviews_count>
  </author>
  </authors>  <published>2007</published>
</book>

      <books>
</author>
</GoodreadsResponse>