Computability, Enumerability, Unsolvability: Directions in Recursion Theory

doi:10.1017/CBO9780511629167

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

- Get access
  
  Buy a print copy
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 3
Cited by
- 3
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Simpson, Stephen G. 2005. Mass Problems and Randomness. Bulletin of Symbolic Logic, Vol. 11, Issue. 1, p. 1.

CrossRef

Google Scholar

Binns, Stephen 2006. Small Π0 1 Classes. Archive for Mathematical Logic, Vol. 45, Issue. 4, p. 393.

CrossRef

Google Scholar

Simpson, Stephen G. 2017. Reverse Mathematics 2001. p. 352.

CrossRef

Google Scholar

Edited by S. B. Cooper, University of Leeds, T. A. Slaman, University of Chicago, S. S. Wainer, University of Leeds

Publisher:: Cambridge University Press
Online publication date:: February 2010
Print publication year:: 1996
Online ISBN:: 9780511629167
DOI:: https://doi.org/10.1017/CBO9780511629167

Subjects:: Mathematics (general), Mathematics, Logic, Categories and Sets, Computer Science, Programming Languages and Applied Logic
Series:: London Mathematical Society Lecture Note Series (224)

50.99 (GBP)

Digital access for individuals
(PDF download and/or read online)
Add to cart

Added to cart

Digital access for individuals
(PDF download and/or read online)
View cart
Export citation
Buy a print copy

Information

Contents

Metrics

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Metrics

Altmetric attention score

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Contents
pp v-vi

Preface
pp vii-viii

Resource bounded genericity
pp 1-60

On isolating r.e. and isolated d-r.e. degrees
pp 61-80

A characterisation of the jumps of minimal degrees below 0′
pp 81-92

Array nonrecursive degrees and genericity
pp 93-104

Dynamic properties of computably enumerable sets
pp 105-122

Axioms for subrecursion theories
pp 123-138

On the ∀ ∃ - theory of the factor lattice by the major subset relation
pp 139-166

Degrees of generic sets
pp 167-184

Embeddings into the recursively enumerable degrees
pp 185-204

On a question of Brown and Simpson
pp 205-218

Relativization of structures arising from computability theory
pp 219-232

A Hierarchy of domains with totality, but without density
pp 233-258

Inductive inference of total functions
pp 259-288

The Medvedev lattice of degrees of difficulty
pp 289-312

Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees
pp 313-332

APPENDIX: Questions in Recursion Theory
pp 333-347

Metrics

Altmetric attention score

Full text views

Book summary page views

Computability, Enumerability, Unsolvability

Directions in Recursion Theory

Book description

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views