{"product_id":"general-recursion-theory-an-axiomatic-approach-hardback-9781107168169","title":"General Recursion Theory; An Axiomatic Approach (Hardback) 9781107168169","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eGeneral Recursion Theory\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eAn Axiomatic Approach\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eThis volume presents a unified and coherent account of the many and various parts of general recursion theory.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJens E. Fenstad (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781107168169, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 2 March 2017\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e237 pages, 1 b\/w illus.\u003cbr\u003e24 x 16.3 x 1.9 cm, 0.53 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eSince their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the tenth publication in the Perspectives in Logic series, Jens E. Fenstad takes an axiomatic approach to present a unified and coherent account of the many and various parts of general recursion theory. The main core of the book gives an account of the general theory of computations. The author then moves on to show how computation theories connect with and unify other parts of general recursion theory. Some mathematical maturity is required of the reader, who is assumed to have some acquaintance with recursion theory. This book is ideal for a second course in the subject.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePons Asinorum\u003cbr\u003e On the choice of correct notations for general theory\u003cbr\u003e Part I. General Theory: 1. General theory: combinatorial part\u003cbr\u003e 2. General theory: subcomputations\u003cbr\u003e Part II. Finite Theories: 3. Finite theories on one type\u003cbr\u003e 4. Finite theories on two types\u003cbr\u003e Part III. Infinite Theories: 5. Admissible prewellorderings\u003cbr\u003e 6. Degree structure\u003cbr\u003e Part IV. Higher Types: 7. Computations over two types\u003cbr\u003e 8. Set recursion and higher types\u003cbr\u003e References\u003cbr\u003e Notation\u003cbr\u003e Author index\u003cbr\u003e Subject index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Combinatorics \u0026amp; graph theory [\u003ca title=\"See our other books on Combinatorics \u0026amp; graph theory\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Combinatorics%20\u0026amp;%20graph%20theory%20%5BPBV%5D%22\"\u003ePBV\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46265651822872,"sku":"9781107168169","price":88.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9781107168169i.jpg?v=1692025338","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/general-recursion-theory-an-axiomatic-approach-hardback-9781107168169","provider":"Freshly Printed Books","version":"1.0","type":"link"}