Recursion Theory: Lecture Notes in Logic 1

by Joseph R. Shoenfield

Overview

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.

Product Details

ISBN-13:	9781138466876
Publisher:	Taylor & Francis
Publication date:	08/09/2017
Pages:	96
Product dimensions:	6.12(w) x 9.19(h) x (d)

Table of Contents

Computability; Functions and Relations; The Basic Machine; Macros; Closure Properties; Definitions of Recursive Functions; Codes; Indices; Church's Thesis; Word Problems; Undecidable Theories; Relative Recursion; The Arithmetical Hierarchy; Recursively Enumerable Relations; Degrees; Evaluation of Degrees; Large RE Sets; Functions of Reals; The Analytical Hierarchy; The Projective Hierarchy

Editorial Reviews

This paperback reprint of the more costly proceedings of 1993 allows researchers, teachers, and students of logic the potential to own a copy. The papers cover all areas of logic, with individual topics including: the geometry of U-rank 2 types, definability and global degree theory, the irreflexivity hypothesis for free left distributive magmas, labeled deductive systems, temporal expressive completeness in the presence of gaps, absoluteness for projective sets, and the structure of gamma degrees. The editors were part of the committee that brought the conference to their home institution of the U. of Helsinki in Finland. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Booknews