Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Computability Theory and Its Applications: Current Trends and Open Problems
 
Edited by: Peter A. Cholak University of Notre Dame, Notre Dame, IN
Steffen Lempp University of Wisconsin, Madison, WI
Manuel Lerman University of Connecticut, Storrs, CT
Richard A. Shore Cornell University, Ithaca, NY
Computability Theory and Its Applications
Softcover ISBN:  978-0-8218-1922-7
Product Code:  CONM/257
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7847-7
Product Code:  CONM/257.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-1922-7
eBook: ISBN:  978-0-8218-7847-7
Product Code:  CONM/257.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Computability Theory and Its Applications
Click above image for expanded view
Computability Theory and Its Applications: Current Trends and Open Problems
Edited by: Peter A. Cholak University of Notre Dame, Notre Dame, IN
Steffen Lempp University of Wisconsin, Madison, WI
Manuel Lerman University of Connecticut, Storrs, CT
Richard A. Shore Cornell University, Ithaca, NY
Softcover ISBN:  978-0-8218-1922-7
Product Code:  CONM/257
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7847-7
Product Code:  CONM/257.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-1922-7
eBook ISBN:  978-0-8218-7847-7
Product Code:  CONM/257.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 2572000; 320 pp
    MSC: Primary 03

    This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM Joint Summer Conference on Computability Theory and Applications held at the University of Colorado (Boulder). The conference focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role.

    Some presentations are narrowly focused; others cover a wider area. Topics included from “pure” computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kučera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).

    Readership

    Graduate students and mathematicians working in or interested in computability theory and its applications.

  • Table of Contents
     
     
    • Articles
    • Klaus Ambos-Spies and Antonín Kučera — Randomness in computability theory [ MR 1770730 ]
    • Marat Arslanov — Open questions about the $n$-c.e. degrees [ MR 1770731 ]
    • Serikzhan Badaev and Sergey Goncharov — The theory of numberings: open problems [ MR 1770732 ]
    • Douglas Cenzer and Carl G. Jockusch, Jr. — $\Pi _1^0$ classes—structure and applications [ MR 1770733 ]
    • Peter A. Cholak — The global structure of computably enumerable sets [ MR 1770734 ]
    • C. T. Chong and Yue Yang — Computability theory in arithmetic: provability, structure and techniques [ MR 1770735 ]
    • Randall Dougherty and Alexander S. Kechris — How many Turing degrees are there? [ MR 1770736 ]
    • Rod Downey and J. B. Remmel — Questions in computable algebra and combinatorics [ MR 1770737 ]
    • Harvey Friedman and Stephen G. Simpson — Issues and problems in reverse mathematics [ MR 1770738 ]
    • Sergey Goncharov and Bakhadyr Khoussainov — Open problems in the theory of constructive algebraic systems [ MR 1770739 ]
    • Marcia Groszek — Independence results from ZFC in computability theory: some open problems [ MR 1770740 ]
    • Julia F. Knight — Problems related to arithmetic [ MR 1770741 ]
    • Manuel Lerman — Embeddings into the computably enumerable degrees [ MR 1770742 ]
    • André Nies — Definability in the c.e. degrees: questions and results [ MR 1770743 ]
    • Piergiorgio Odifreddi — Strong reducibilities, again [ MR 1770744 ]
    • Mikhail Peretyat′kin — Finitely axiomatizable theories and Lindenbaum algebras of semantic classes [ MR 1770745 ]
    • Alexandra Shlapentokh — Towards an analog of Hilbert’s tenth problem for a number field [ MR 1770746 ]
    • Richard A. Shore — Natural definability in degree structures [ MR 1770747 ]
    • Theodore A. Slaman — Recursion theory in set theory [ MR 1770748 ]
    • Robert I. Soare — Extensions, automorphisms, and definability [ MR 1770749 ]
    • Andrea Sorbi — Open problems in the enumeration degrees [ MR 1770750 ]
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 2572000; 320 pp
MSC: Primary 03

This collection of articles presents a snapshot of the status of computability theory at the end of the millennium and a list of fruitful directions for future research. The papers represent the works of experts in the field who were invited speakers at the AMS-IMS-SIAM Joint Summer Conference on Computability Theory and Applications held at the University of Colorado (Boulder). The conference focused on open problems in computability theory and on some related areas in which the ideas, methods, and/or results of computability theory play a role.

Some presentations are narrowly focused; others cover a wider area. Topics included from “pure” computability theory are the computably enumerable degrees (M. Lerman), the computably enumerable sets (P. Cholak, R. Soare), definability issues in the c.e. and Turing degrees (A. Nies, R. Shore) and other degree structures (M. Arslanov, S. Badaev and S. Goncharov, P. Odifreddi, A. Sorbi). The topics involving relations between computability and other areas of logic and mathematics are reverse mathematics and proof theory (D. Cenzer and C. Jockusch, C. Chong and Y. Yang, H. Friedman and S. Simpson), set theory (R. Dougherty and A. Kechris, M. Groszek, T. Slaman) and computable mathematics and model theory (K. Ambos-Spies and A. Kučera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).

Readership

Graduate students and mathematicians working in or interested in computability theory and its applications.

  • Articles
  • Klaus Ambos-Spies and Antonín Kučera — Randomness in computability theory [ MR 1770730 ]
  • Marat Arslanov — Open questions about the $n$-c.e. degrees [ MR 1770731 ]
  • Serikzhan Badaev and Sergey Goncharov — The theory of numberings: open problems [ MR 1770732 ]
  • Douglas Cenzer and Carl G. Jockusch, Jr. — $\Pi _1^0$ classes—structure and applications [ MR 1770733 ]
  • Peter A. Cholak — The global structure of computably enumerable sets [ MR 1770734 ]
  • C. T. Chong and Yue Yang — Computability theory in arithmetic: provability, structure and techniques [ MR 1770735 ]
  • Randall Dougherty and Alexander S. Kechris — How many Turing degrees are there? [ MR 1770736 ]
  • Rod Downey and J. B. Remmel — Questions in computable algebra and combinatorics [ MR 1770737 ]
  • Harvey Friedman and Stephen G. Simpson — Issues and problems in reverse mathematics [ MR 1770738 ]
  • Sergey Goncharov and Bakhadyr Khoussainov — Open problems in the theory of constructive algebraic systems [ MR 1770739 ]
  • Marcia Groszek — Independence results from ZFC in computability theory: some open problems [ MR 1770740 ]
  • Julia F. Knight — Problems related to arithmetic [ MR 1770741 ]
  • Manuel Lerman — Embeddings into the computably enumerable degrees [ MR 1770742 ]
  • André Nies — Definability in the c.e. degrees: questions and results [ MR 1770743 ]
  • Piergiorgio Odifreddi — Strong reducibilities, again [ MR 1770744 ]
  • Mikhail Peretyat′kin — Finitely axiomatizable theories and Lindenbaum algebras of semantic classes [ MR 1770745 ]
  • Alexandra Shlapentokh — Towards an analog of Hilbert’s tenth problem for a number field [ MR 1770746 ]
  • Richard A. Shore — Natural definability in degree structures [ MR 1770747 ]
  • Theodore A. Slaman — Recursion theory in set theory [ MR 1770748 ]
  • Robert I. Soare — Extensions, automorphisms, and definability [ MR 1770749 ]
  • Andrea Sorbi — Open problems in the enumeration degrees [ MR 1770750 ]
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.