Book Description
The theory set out in this book results from the meeting of descriptive set theory and recursion theory.
Author : Peter G. Hinman
Publisher : Cambridge University Press
Page : 493 pages
File Size : 14,39 MB
Release : 2017-03-02
Category : Mathematics
ISBN : 1107168244
The theory set out in this book results from the meeting of descriptive set theory and recursion theory.
Author : Gerald E. Sacks
Publisher : Cambridge University Press
Page : 361 pages
File Size : 30,40 MB
Release : 2017-03-02
Category : Computers
ISBN : 1107168430
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Author : P. G. Hinman
Publisher : Springer
Page : 482 pages
File Size : 45,82 MB
Release : 1978-05-01
Category : Mathematics
ISBN : 9783540079040
At a recent meeting of logicians, one speaker complained - mainly, but perhaps not wholly, in jest - that logic is tightly controlled by a small group of people (the cabal) who exercise careful control over the release of new ideas to the general public (especially students) and indeed suppress some material com pletely. The situation is surely not so grim as this, but any potential reader of this book must have felt at some time that there is at least a minor conspiracy to keep new ideas inaccessible until the "insiders" have worked them over thoroughly. In particular he might well feel this way about the whole subject of Generalized Recursion Theory, which developed in the second half of the 1960s. The basic definitions and results on recursion involving functionals of higher type appeared in the monumental but extremely difficult paper Kleene [1959] and [1963]. Gandy [1967] gave another presentation ab initio, but the planned part II of this paper, as well as several other major advances in the subject, never appeared in print. For the theory of recursion on ordinals, the situation was even worse. Much of the basic material had appeared only in the abstracts Kripke [1964, 1964a], and although certain parts of the theory had been worked out in papers such as Kreisel-Sacks [1965] and Sacks [1967], there was no reasonably complete account of the basic facts of the subject in print.
Author : Jens E. Fenstad
Publisher : Cambridge University Press
Page : 239 pages
File Size : 16,64 MB
Release : 2017-03-02
Category : Mathematics
ISBN : 1316739368
Since 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.
Author : W. Marek
Publisher : Springer
Page : 344 pages
File Size : 15,20 MB
Release : 2006-11-14
Category : Mathematics
ISBN : 3540381228
Author : Gerald E. Sacks
Publisher : Cambridge University Press
Page : 362 pages
File Size : 38,95 MB
Release : 2017-03-02
Category : Mathematics
ISBN : 1316739465
Since 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. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, α-recursion, and E-recursion. This text is essential reading for all researchers in the field.
Author : F. R. Drake
Publisher : Cambridge University Press
Page : 329 pages
File Size : 37,49 MB
Release : 1980-11-13
Category : Mathematics
ISBN : 052123543X
This book is a collection of advanced research/survey papers by eminent research workers in the Recursion theory.
Author : Heinz-Dieter Ebbinghaus
Publisher : Springer
Page : 427 pages
File Size : 26,78 MB
Release : 2006-11-14
Category : Mathematics
ISBN : 3540395962
Author : P. Odifreddi
Publisher : Elsevier
Page : 667 pages
File Size : 43,21 MB
Release : 1992-02-04
Category : Computers
ISBN : 9780080886596
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered are: various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Author : Lev D. Beklemishev
Publisher : Elsevier
Page : 465 pages
File Size : 38,64 MB
Release : 2000-04-01
Category : Computers
ISBN : 0080954898
Generalized Recursion Theory