Recursion theory and complexity : proceedings of the kazan '97 workshop, kazan, russia, july 14 19, 1997 /
Saved in:
Corporate Authors: | |
---|---|
Group Author: | ; |
Published: |
De Gruyter,
|
Publisher Address: | Berlin/Boston : |
Publication Dates: | [1999] |
Literature type: | eBook |
Language: | English |
Series: |
De gruyter series in logic and its applications;
2 |
Subjects: | |
Online Access: |
http://dx.doi.org/10.1515/9783110807486 http://www.degruyter.com/doc/cover/9783110807486.jpg |
Carrier Form: |
1 online resource(viii,239pages) : illustrations. Also available in print edition. |
ISBN: | 9783110807486 |
Index Number: | QA9 |
CLC: | O141.3 |
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 / Enumeration reducibility and the problem of the nontotal property of e-degrees / Algebras of recursive functions / / Open problems -- List of talks -- List of contributors -- Backmatter. |