Computability Theory and Its Applications
The articles of this volume will be reviewed individually. Indexed articles: \textit{Ambos-Spies, Klaus; Kučera, Antonín}, Randomness in computability theory, 1-14 [Zbl 0962.03039] \textit{Arslanov, Marat}, Open questions about the \(n\)-c. e. degrees, 15-22 [Zbl 0967.03036] \textit{Badaev, Serikzhan; Goncharov, Sergey}, The theory of numberings: Open problems, 23-38 [Zbl 0961.03038] \textit{Cenzer, Douglas; Jockusch, Carl G. jun.}, \(\Pi_1^0\) classes -- structure and applications, 39-59 [Zbl 0962.03040] \textit{Cholak, Peter A.}, The global structure of computably enumerable sets, 61-72 [Zbl 0959.03026] \textit{Chong, C. T.; Yang, Yue}, Computability theory in arithmetic: Provability, structure and techniques, 73-81 [Zbl 0962.03031] \textit{Dougherty, Randall; Kechris, Alexander S.}, How many Turing degrees are there?, 83-94 [Zbl 0962.03033] \textit{Downey, Rod; Remmel, J. B.}, Questions in computable algebra and combinatorics, 95-125 [Zbl 0980.03045] \textit{Friedman, Harvey; Simpson, Stephen G.}, Issues and problems in reverse mathematics, 127-144 [Zbl 0967.03050] \textit{Goncharov, Sergey; Khoussainov, Bakhadyr}, Open problems in the theory of constructive algebraic systems, 145-170 [Zbl 0961.03037] \textit{Groszek, Marcia}, Independence results from ZFC in computability theory: Some open problems, 171-179 [Zbl 0962.03047] \textit{Knight, Julia F.}, Problems related to arithmetic, 181-189 [Zbl 0963.03060] \textit{Lerman, Manuel}, Embeddings into the computably enumerable degrees, 191-205 [Zbl 0962.03034] \textit{Nies, André}, Definability in the c. e. degrees: Questions and results, 207-213 [Zbl 0962.03035] \textit{Odifreddi, Piergiorgio}, Strong reducibilities, again, 215-220 [Zbl 0964.03045] \textit{Peretyat'kin, Mikhail}, Finitely axiomatizable theories and Lindenbaum algebras of semantic classes, 221-239 [Zbl 0968.03039] \textit{Shlapentokh, Alexandra}, Towards an analog of Hilbert's Tenth Problem for a number field, 241-254 [Zbl 0995.03009] \textit{Shore, Richard A.}, Natural definability in degree structures, 255-271 [Zbl 0962.03036] \textit{Slaman, Theodore A.}, Recursion theory in set theory, 273-278 [Zbl 0962.03045] \textit{Soare, Robert I.}, Extensions, automorphisms, and definability, 279-307 [Zbl 0964.03042] \textit{Sorbi, Andrea}, Open problems in the enumeration degrees, 309-320 [Zbl 0964.03044]
This page was built for publication: Computability Theory and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4506446)
