Recursion theory and complexity. Proceedings of the Kazan '97 workshop, Kazan, Russia, July 14--19, 1997 (Q1305507)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Ashaev, Igor V.}, Priority method in generalized computability, 1-13 [Zbl 0944.03041] \textit{Cenzer, Douglas; Remmel, Jeffrey B.}, Polynomial-time versus computable Boolean algebras, 15-53 [Zbl 0948.03039] \textit{Downey, Rodney G.; Lempp, Steffen}, The proof-theoretic strength of the Dushnik-Miller theorem for countable linear orders, 55-57 [Zbl 0951.03053] \textit{Harizanov, Valentina S.}, Effectively nowhere simple relations on computable structures, 59-70 [Zbl 0944.03038] \textit{Hinman, Peter G.}, Jump traces with large gaps, 71-80 [Zbl 0951.03038] \textit{Ishmukhametov, Shamil}, Weak recursive degrees and a problem of Spector, 81-87 [Zbl 0951.03036] \textit{Korovin, K. V.}, Compositions of permutations and algorithmic reducibilities, 89-95 [Zbl 0944.03036] \textit{Korovina, M. V.; Kudinov, O. V.}, Some properties of majorant-computability, 97-114 [Zbl 0944.03042] \textit{Morozov, A. S.}, Hyperarithmetical functions and algebraicity, 115-130 [Zbl 0942.03046] \textit{Shlapentokh, Alexandra}, Weak presentations of fields not extendible to recursive presentations, 131-155 [Zbl 0944.03039] \textit{Shore, Richard; Sorbi, Andrea}, Jumps of \(\Sigma_2^0\)-high e-degrees and properly \(\Sigma_2^0\) e-degrees, 157-172 [Zbl 0949.03036] \textit{Solon, Boris}, Enumeration reducibility and the problem of the nontotal property of e-degrees, 173-191 [Zbl 0944.03037] \textit{Solovyev, V.}, Algebras of recursive functions, 193-214 [Zbl 0954.03040] \textit{Yang, Yue}, \(\Sigma_2\) induction and cuppable degrees, 215-228 [Zbl 0951.03035] Open problems. I: d. r. e. and \(n\)-r. e. degrees. II: e-degrees. III: Recursive model theory. IV: Global questions about degree structures and the lattice of computably enumerable sets, 229-233 [Zbl 0938.03546]