Matches in Harvard for { <http://id.lib.harvard.edu/aleph/008420437/catalog> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- catalog contributor b11729055.
- catalog created "c2000.".
- catalog date "2000".
- catalog date "c2000.".
- catalog dateCopyrighted "c2000.".
- catalog description "Includes bibliographical references.".
- catalog description "Randomness in computability theory / Klaus Ambos-Spies, Antonin Kucera 1 -- Open questions about the n-c.e. degrees / Marat Arslanov 15 -- Theory of numberings: Open problems / Serikzhan Badaev, Sergey Goncharov 23 -- [Pi superscript 0 subscript 1] classes--structure and applications / Douglas Cenzer, Carl G. Jockusch, Jr. 39 -- Global structure of computably enumerable sets / Peter A. Cholak 61 -- Computability theory in arithmetic: Provability, structure and techniques / C.T. Chong, Yue Yang 73 -- How many Turing degrees are there? / Randall Dougherty, Alexander S. Kechris 83 -- Questions in computable algebra and combinatorics / Rod Downey, J.B. Remmel 95 -- Issues and problems in reverse mathematics / Harvey Friedman, Stephen G. Simpson 127 -- Open problems in the theory of constructive algebraic systems / Sergey Goncharov, Bakhadyr Khoussainov 145 -- Independence results from ZFC in computability theory: Some open problems / Marcia Groszek 171 -- Problems related to arithmetic / Julia F. Knight 181 -- Embeddings into the computably enumerable degrees / Manuel Lerman 191 -- Definability in the c.e. degrees: Questions and results / Andre Nies 207 -- Strong reducibilities, again / Piergiorgio Odifreddi 215 -- Finitely axiomatizable theories and Lindenbaum algebras of semantic classes / Mikhail Peretyat'kin 221 -- Towards an analog of Hilbert's tenth problem for a number field / Alexandra Shlapentokh 241 -- Natural definability in degree structures / Richard A. Shore 255 -- Recursion theory in set theory / Theodore A. Slaman 273 -- Extensions, automorphisms, and definability / Robert I. Soare 279 -- Open problems in the enumeration degrees / Andrea Sorbi 309.".
- catalog extent "xvi, 320 p. :".
- catalog identifier "0821819224 (alk. paper)".
- catalog isPartOf "Contemporary mathematics (American Mathematical Society) ; v. 257.".
- catalog isPartOf "Contemporary mathematics, 0271-4132 ; 257".
- catalog issued "2000".
- catalog issued "c2000.".
- catalog language "eng".
- catalog publisher "Providence, RI : American Mathematical Society,".
- catalog subject "511.3 21".
- catalog subject "Computable functions Congresses.".
- catalog subject "QA9.59. C66 2000".
- catalog tableOfContents "Randomness in computability theory / Klaus Ambos-Spies, Antonin Kucera 1 -- Open questions about the n-c.e. degrees / Marat Arslanov 15 -- Theory of numberings: Open problems / Serikzhan Badaev, Sergey Goncharov 23 -- [Pi superscript 0 subscript 1] classes--structure and applications / Douglas Cenzer, Carl G. Jockusch, Jr. 39 -- Global structure of computably enumerable sets / Peter A. Cholak 61 -- Computability theory in arithmetic: Provability, structure and techniques / C.T. Chong, Yue Yang 73 -- How many Turing degrees are there? / Randall Dougherty, Alexander S. Kechris 83 -- Questions in computable algebra and combinatorics / Rod Downey, J.B. Remmel 95 -- Issues and problems in reverse mathematics / Harvey Friedman, Stephen G. Simpson 127 -- Open problems in the theory of constructive algebraic systems / Sergey Goncharov, Bakhadyr Khoussainov 145 -- Independence results from ZFC in computability theory: Some open problems / Marcia Groszek 171 -- Problems related to arithmetic / Julia F. Knight 181 -- Embeddings into the computably enumerable degrees / Manuel Lerman 191 -- Definability in the c.e. degrees: Questions and results / Andre Nies 207 -- Strong reducibilities, again / Piergiorgio Odifreddi 215 -- Finitely axiomatizable theories and Lindenbaum algebras of semantic classes / Mikhail Peretyat'kin 221 -- Towards an analog of Hilbert's tenth problem for a number field / Alexandra Shlapentokh 241 -- Natural definability in degree structures / Richard A. Shore 255 -- Recursion theory in set theory / Theodore A. Slaman 273 -- Extensions, automorphisms, and definability / Robert I. Soare 279 -- Open problems in the enumeration degrees / Andrea Sorbi 309.".
- catalog title "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 / Peter A. Cholak ... [et al.], editors.".
- catalog type "Boulder (Colo., 1999) swd".
- catalog type "Conference proceedings. fast".
- catalog type "text".