IMSc Library catalog › Details for: Computability theory and its applications :

Normal view MARC view ISBD view

Computability theory and its applications : [electronic resource] 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 / Peter A. Cholak ...[et al.], editors.

Contributor(s): Cholak, Peter, 1962-Material type: Text

TextSeries: Contemporary mathematics (American Mathematical Society) ; v. 257.Publication details: Providence, R.I. : American Mathematical Society, c2000Description: 1 online resource (xvi, 320 p. : ill.)ISBN: 9780821878477 (online)Subject(s): Computable functions -- CongressesAdditional physical formats: Computability theory and its applications :DDC classification: 511.3 LOC classification: QA9.59. | C66 1999Online resources: Contents | Contents

Contents:

Randomness in computability theory / Klaus Ambos-Spies and Anton�in Ku�cera -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04023 Open questions about the $n$-c.e. degrees / Marat Arslanov -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04024 The theory of numberings: open problems / Serikzhan Badaev and Sergey Goncharov -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04025 $\Pi _1^0$ classes -- structure and applications / Douglas Cenzer and Carl G. Jockusch, Jr. -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04026 The global structure of computably enumerable sets / Peter A. Cholak -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04027 Computability theory in arithmetic: provability, structure and techniques / C. T. Chong and Yue Yang -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04028 How many Turing degrees are there? / Randall Dougherty and Alexander S. Kechris -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04029 Questions in computable algebra and combinatorics / Rod Downey and J. B. Remmel -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04030 Issues and problems in reverse mathematics / Harvey Friedman and Stephen G. Simpson -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04031 Open problems in the theory of constructive algebraic systems / Sergey Goncharov and Bakhadyr Khoussainov -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04032 Independence results from ZFC in computability theory: some open problems / Marcia Groszek -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04033 Problems related to arithmetic / Julia F. Knight -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04034 Embeddings into the computably enumerable degrees / Manuel Lerman -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04035 Definability in the c.e. degrees: questions and results / Andr�e Nies -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04036 Strong reducibilities, again / Piergiorgio Odifreddi -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04037 Finitely axiomatizable theories and Lindenbaum algebras of semantic classes / Mikhail Peretyatkin -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04038 Towards an analog of Hilbert's tenth problem for a number field / Alexandra Shlapentokh -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04039 Natural definability in degree structures / Richard A. Shore -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04040 Recursion theory in set theory / Theodore A. Slaman -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04041 Extensions, automorphisms, and definability / Robert I. Soare -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04042 Open problems in the enumeration degrees / Andrea Sorbi -- http://www.ams.org/conm/257/ http://dx.doi.org/10.1090/conm/257/04043

Item type:

E-BOOKS

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 48 )
Comments ( 0 )

Current library	Home library	Call number	Materials specified	URL	Status	Date due	Barcode
IMSc Library	IMSc Library			Link to resource	Available		EBK11539

Includes bibliographical references.

Randomness in computability theory / Klaus Ambos-Spies and Anton�in Ku�cera -- Open questions about the $n$-c.e. degrees / Marat Arslanov -- The theory of numberings: open problems / Serikzhan Badaev and Sergey Goncharov -- $\Pi _1^0$ classes -- structure and applications / Douglas Cenzer and Carl G. Jockusch, Jr. -- The global structure of computably enumerable sets / Peter A. Cholak -- Computability theory in arithmetic: provability, structure and techniques / C. T. Chong and Yue Yang -- How many Turing degrees are there? / Randall Dougherty and Alexander S. Kechris -- Questions in computable algebra and combinatorics / Rod Downey and J. B. Remmel -- Issues and problems in reverse mathematics / Harvey Friedman and Stephen G. Simpson -- Open problems in the theory of constructive algebraic systems / Sergey Goncharov and Bakhadyr Khoussainov -- Independence results from ZFC in computability theory: some open problems / Marcia Groszek -- Problems related to arithmetic / Julia F. Knight -- Embeddings into the computably enumerable degrees / Manuel Lerman -- Definability in the c.e. degrees: questions and results / Andr�e Nies -- Strong reducibilities, again / Piergiorgio Odifreddi -- Finitely axiomatizable theories and Lindenbaum algebras of semantic classes / Mikhail Peretyatkin -- Towards an analog of Hilbert's tenth problem for a number field / Alexandra Shlapentokh -- Natural definability in degree structures / Richard A. Shore -- Recursion theory in set theory / Theodore A. Slaman -- Extensions, automorphisms, and definability / Robert I. Soare -- Open problems in the enumeration degrees / Andrea Sorbi --