Recursion Theory Week
Author | : Heinz-Dieter Ebbinghaus |
Publisher | : Springer |
Total Pages | : 427 |
Release | : 2006-11-14 |
Genre | : Mathematics |
ISBN | : 3540395962 |
Download Recursion Theory Week Book in PDF, ePub and Kindle
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Recursion Theory Week PDF full book. Access full book title Recursion Theory Week.
Author | : Heinz-Dieter Ebbinghaus |
Publisher | : Springer |
Total Pages | : 427 |
Release | : 2006-11-14 |
Genre | : Mathematics |
ISBN | : 3540395962 |
Author | : Klaus Ambos-Spies |
Publisher | : Springer |
Total Pages | : 398 |
Release | : 2006-11-14 |
Genre | : Mathematics |
ISBN | : 3540471421 |
These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
Author | : Klaus Ambos-Spies |
Publisher | : |
Total Pages | : 408 |
Release | : 2014-01-15 |
Genre | : |
ISBN | : 9783662178553 |
Author | : Gerald E. Sacks |
Publisher | : Cambridge University Press |
Total Pages | : 361 |
Release | : 2017-03-02 |
Genre | : Mathematics |
ISBN | : 1107168430 |
This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.
Author | : Joseph R. Shoenfield |
Publisher | : CRC Press |
Total Pages | : 96 |
Release | : 2018-04-27 |
Genre | : Mathematics |
ISBN | : 1351419420 |
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
Author | : Joseph R. Shoenfield |
Publisher | : CRC Press |
Total Pages | : 85 |
Release | : 2018-04-27 |
Genre | : Mathematics |
ISBN | : 1351419412 |
This volume, which ten years ago appeared as the first in the acclaimed series Lecture Notes in Logic, serves as an introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. The clarity and focus of this text have established it as a classic instrument for teaching and self-study that prepares its readers for the study of advanced monographs and the current literature on recursion theory.
Author | : |
Publisher | : |
Total Pages | : 393 |
Release | : 1990 |
Genre | : Mathematics |
ISBN | : 9780387527727 |
Author | : Gerald E. Sacks |
Publisher | : Cambridge University Press |
Total Pages | : 362 |
Release | : 2017-03-02 |
Genre | : 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 | : Chi Tat Chong |
Publisher | : Walter de Gruyter GmbH & Co KG |
Total Pages | : 322 |
Release | : 2015-08-17 |
Genre | : Mathematics |
ISBN | : 3110275643 |
This monograph presents recursion theory from a generalized point of view centered on the computational aspects of definability. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using techniques and ideas from recursion theory, hyperarithmetic theory, and descriptive set theory. The emphasis is on the interplay between recursion theory and set theory, anchored on the notion of definability. The monograph covers a number of fundamental results in hyperarithmetic theory as well as some recent results on the structure theory of Turing and hyperdegrees. It also features a chapter on the applications of these investigations to higher randomness.
Author | : Stephen Cole Kleene |
Publisher | : American Mathematical Soc. |
Total Pages | : 110 |
Release | : 1969 |
Genre | : Intuitionistic mathematics |
ISBN | : 0821812890 |
This monograph carries out the program which the author formulated in earlier work, the formalization of the theory of recursive functions of type 0 and 1 and of the theory of realizability.