Skip to main content
SpringerLink
Log in

Reflexive Structures

An Introduction to Computability Theory

  • Book
  • © 1988

Overview

Authors:
  1. Luis E. Sanchis

    1. School of Computer and Information Science, Syracuse University, Syracuse, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • 707 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xii
    Download chapter PDF

  2. Functions and Predicates

    • Luis E. Sanchis
    Pages 1-35

  3. Recursive Functions

    • Luis E. Sanchis
    Pages 36-67

  4. Enumeration

    • Luis E. Sanchis
    Pages 68-99

  5. Reflexive Structures

    • Luis E. Sanchis
    Pages 100-162

  6. Hyperenumeration

    • Luis E. Sanchis
    Pages 163-227

  7. Back Matter

    Pages 228-233
    Download chapter PDF
Back to top

Keywords

About this book

Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of the theory of recursive functions. The approach taken presents the fundamental structures in a fairly general setting, but avoiding the introduction of abstract axiomatic domains. Natural numbers and numerical functions are considered exclusively, which results in a concrete theory conceptually organized around Church's thesis. The book develops the important structures in recursive function theory: closure properties, reflexivity, enumeration, and hyperenumeration. Of particular interest is the treatment of recursion, which is considered from two different points of view: via the minimal fixed point theory of continuous transformations, and via the well known stack algorithm. Reflexive Structures is intended as an introduction to the general theory of computability. It can be used as a text or reference in senior undergraduate and first year graduate level classes in computer science or mathematics.

Authors and Affiliations

  • School of Computer and Information Science, Syracuse University, Syracuse, USA

    Luis E. Sanchis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation