| 000 -LEADER |
|---|
| fixed length control field |
02421nmm a2200169Ia 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230306s9999||||xx |||||||||||||||||und|| |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780821878477 (online) |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Computability theory and its applications : |
| Remainder of title |
current trends and open problems : proceedings of a 1999 AMSIMSSIAM joint summer research conference, computability theory and applications, June 1317, 1999, University of Colorado, Boulder |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Providence, R.I. : |
| Name of publisher, distributor, etc. |
American Mathematical Society, |
| Date of publication, distribution, etc. |
c2000 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 online resource (xvi, 320 p. : ill.) |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Contemporary mathematics |
| Volume/sequential designation |
v. 257 |
| International Standard Serial Number |
10983627 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Title |
Randomness in computability theory ; Open questions about the |
| -- |
|
| -- |
.e. degrees ; The theory of numberings: open problems ; |
| -- |
Pi _1^0 |
| -- |
classes structure and applications ; The global structure of computably enumerable sets ; Computability theory in arithmetic: provability, structure and techniques ; How many Turing degrees are there? ; Questions in computable algebra and combinatorics ; Issues and problems in reverse mathematics ; Open problems in the theory of constructive algebraic systems ; Independence results from ZFC in computability theory: some open problems ; Problems related to arithmetic ; Embeddings into the computably enumerable degrees ; Definability in the c.e. degrees: questions and results ; Strong reducibilities, again ; Finitely axiomatizable theories and Lindenbaum algebras of semantic classes ; Towards an analog of Hilbert's tenth problem for a number field ; Natural definability in degree structures ; Recursion theory in set theory ; Extensions, automorphisms, and definability ; Open problems in the enumeration degrees |
| Statement of responsibility |
Klaus AmbosSpies and Antonin Kucera ; Marat Arslanov ; Serikzhan Badaev and Sergey Goncharov ; Douglas Cenzer and Carl G Jockusch Jr ; Peter A Cholak ; C T Chong and Yue Yang ; Randall Dougherty and Alexander S Kechris ; Rod Downey and J B Remmel ; Harvey Friedman and Stephen G Simpson ; Sergey Goncharov and Bakhadyr Khoussainov ; Marcia Groszek ; Julia F Knight ; Manuel Lerman ; Andre Nies ; Piergiorgio Odifreddi ; Mikhail Peretyatkin ; Alexandra Shlapentokh ; Richard A Shore ; Theodore A Slaman ; Robert I Soare ; Andrea Sorbi |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computable functions |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Cholak Peter |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="http://www.ams.org/conm/257/">http://www.ams.org/conm/257/</a> |
