Murakami Sale
 
 

Recently Viewed clear list


The Powell's Playlist | August 6, 2014

Graham Joyce: IMG The Powell’s Playlist: Graham Joyce



The Ghost in the Electric Blue Suit is set on the English coast in the hot summer of 1976, so the music in this playlist is pretty much all from the... Continue »
  1. $17.47 Sale Hardcover add to wish list

spacer
Qualifying orders ship free.
$107.50
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Mathematics- Logic and Philosophy

Other titles in the London Mathematical Society Lecture Notes series:

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note)

by

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note) Cover

 

Synopses & Reviews

Publisher Comments:

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.

Book News Annotation:

A series of 15 papers commemorating the Leeds Recursion Theory Year, 1993-94, combining background and introductory material with recent developments such as solutions to the stubborn problems of definability, decidability, and automorphisms. Array nonrecursive degrees and genericity, relativization of structures arising from computability theory, and the Medvedev lattice of degrees of difficulty are among the topics. Also includes several pages of open questions, and an e-mail address to send answers. No index.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

It is just over 60 years since Alan Turing, Alonzo Church and Kurt Gödel showed the existence of fundamental undecidable problems in mathematics. The contributions in this book provide an up-to-date overview of current ideas and methods in the pure mathematical foundations of computability theory, the discipline which grew out of their pioneering work. A number of the articles contain introductory and background material, making this volume an invaluable resource for specialists and non-specialists alike.

Synopsis:

Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.

Synopsis:

Contributions from the Leeds recursion theory year, at the interface between logic and theoretical computer science.

Table of Contents

Minimal degrees below O' and the jump operator B. Cooper; Boolean algebras and ideals associated with the lattice of r.e. sets L. Harrington; Codable sets L. Harrington and R. Soare; Subrecursion theories A. Heaton and S. Wainer; An appraoch to lattice embaddings M. Lerman; A hierarchy of domains with totality, but without density D. Norman; Inductive inference P. Odifreddi; The discontinuity of the Slaman-Soare phenomenon X. YI; Recursive enumerability M. Arslanov; Resource bounded gereicity concepts K. Ambos-Spies; The Medvedev lattice of degrees of difficulty A. Sorbi; On the number of countable models II G. Sacks.

Product Details

ISBN:
9780521557368
Editor:
Cooper, S. B.
Editor:
Slaman, T. A.
Editor:
Cooper, S. B.
Editor:
Slaman, T. A.
Editor:
Wainer, Stanley S.
Author:
Cooper, S. B.
Author:
Wainer, S. S.
Author:
Cassels, J. W. S.
Author:
Slaman, T. A.
Editor:
Wainer, Stanley S.
Publisher:
Cambridge University Press
Location:
Cambridge England ;
Subject:
General
Subject:
Logic
Subject:
Combinatorics
Subject:
Computable functions
Subject:
Recursion theory
Subject:
Unsolvability (Mathematical logic)
Subject:
General Mathematics
Subject:
Mathematics-Logic and Philosophy
Edition Description:
Includes bibliographical references.
Series:
London Mathematical Society lecture note series ;
Series Volume:
103-383224
Publication Date:
20090431
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Yes
Pages:
356
Dimensions:
8.98x5.98x.83 in. 1.13 lbs.

Related Subjects

Reference » Science Reference » Philosophy of Science
Science and Mathematics » Mathematics » Foundations and Logic
Science and Mathematics » Mathematics » Logic and Philosophy

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note) New Trade Paper
0 stars - 0 reviews
$107.50 In Stock
Product details 356 pages Cambridge University Press - English 9780521557368 Reviews:
"Synopsis" by , It is just over 60 years since Alan Turing, Alonzo Church and Kurt Gödel showed the existence of fundamental undecidable problems in mathematics. The contributions in this book provide an up-to-date overview of current ideas and methods in the pure mathematical foundations of computability theory, the discipline which grew out of their pioneering work. A number of the articles contain introductory and background material, making this volume an invaluable resource for specialists and non-specialists alike.
"Synopsis" by , Provides a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.
"Synopsis" by , Contributions from the Leeds recursion theory year, at the interface between logic and theoretical computer science.
spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.