Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14 19, 1997 (De Gruyter in Logic and Its Applications) ... (de Gruyter Logic and Its Applications)

The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level. I. Priority method in generalized computability D. Polynomial-time versus computable Boolean algebras R. The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders V. Effectively nowhere simple relations on computable structures P. Jump traces with large gaps Weak recursive degrees and a problem of Spector Compositions of permutations and algorithmic reducibilities Some properties of majorant-computability Hyperarithmetical functions and algebraicity Weak presentations of fields not extendible to recursive presentations Jumps of ∑2 0-high e-degrees and properly ∑2 0 e-degrees Enumeration reducibility and the problem of the nontotal property of e-degrees Algebras of recursive functions ∑2 Induction and cuppable degrees Open problems List of talks List of contributors