Recursion Theory and Complexity : : Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14–19, 1997 / / ed. by Marat M. Arslanov, Steffen Lempp.

• Superior document: Title is part of eBook package: De Gruyter DGBA Mathematics - 1990 - 1999
• HerausgeberIn: Arslanov, Marat M.,; Lempp, Steffen,
• MitwirkendeR: Ashaev, Igor V.,; Cenzer, Douglas,; Downey, Rodney G.,; Harizanov, Valentina S.,; Hinman, Peter G.,; Ishmukhametov, Shamil,; Korovin, Κ. V.,; Korovina, M. V.,; Kudinov, Ο. V.,; Lempp, Steffen,; Morozov, A. S.,; Remmel, Jeffrey B.,; Shlapentokh, Alexandra,; Shore, Richard,; Solon, Boris,; Solovyev, V.,; Sorbi, Andrea,; Yang, Yue,
• Place / Publishing House: Berlin ;, Boston : : De Gruyter, , [2014]; ©1999
• Year of Publication: 2014
• Edition: Reprint 2014
• Language: English
• Series: De Gruyter Series in Logic and Its Applications , 2
• Physical Description: 1 online resource (239 p.)

Table of Contents

• Frontmatter
• Preface
• Table of contents
• Priority method in generalized computability
• Polynomial-time versus computable Boolean algebras
• The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders
• Effectively nowhere simple relations on computable structures
• 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 Ʃ02-high e-degrees and properly Ʃ02 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
• Backmatter