Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM Joint Summer Research Conference, Computability Theory and Applications, June 13-17, 1999, University of Colorado, Boulder
著者
書誌事項
Computability theory and its applications : current trends and open problems : proceedings of a 1999 AMS-IMS-SIAM Joint Summer Research Conference, Computability Theory and Applications, June 13-17, 1999, University of Colorado, Boulder
(Contemporary mathematics, v. 257)
American Mathematical Society, c2000
大学図書館所蔵 全57件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
内容説明・目次
内容説明
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. Kucera, R. Downey and J. Remmel, S. Goncharov and B. Khoussainov, J. Knight, M. Peretyat'kin, A. Shlapentokh).
目次
Randomness in computability theory by K. Ambos-Spies and A. Kucera Open questions about the $n$-c.e. degrees by M. Arslanov The theory of numberings: Open problems by S. Badaev and S. Goncharov $\mathrm{\Pi}^0_1$ classes -- Structure and applications by D. Cenzer and C. G. Jockusch, Jr. The global structure of computably enumerable sets by P. A. Cholak Computability theory in arithmetic: Provability, structure and techniques by C. T. Chong and Y. Yang How many Turing degrees are there? by R. Dougherty and A. S. Kechris Questions in computable algebra and combinatorics by R. Downey and J. B. Remmel Issues and problems in reverse mathematics by H. Friedman and S. G. Simpson Open problems in the theory of constructive algebraic systems by S. Goncharov and B. Khoussainov Independence results from ZFC in computability theory: Some open problems by M. Groszek Problems related to arithmetic by J. F. Knight Embeddings into the computably enumerable degrees by M. Lerman Definability in the c.e. degrees: Questions and results by A. Nies Strong reducibilities, again by P. Odifreddi Finitely axiomatizable theories and Lindenbaum algebras of semantic classes by M. Peretyat'kin Towards an analog of Hilbert's tenth problem for a number field by A. Shlapentokh Natural definability in degree structures by R. A. Shore Recursion theory in set theory by T. A. Slaman Extensions, automorphisms, and definability by R. I. Soare Open problems in the enumeration degrees by A. Sorbi.
「Nielsen BookData」 より