This is a test
- 247 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Recursion Theory and Complexity
Book details
Table of contents
Citations
About This Book
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.
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Recursion Theory and Complexity by Marat M. Arslanov, Steffen Lempp in PDF and/or ePUB format, as well as other popular books in Mathematik & Mathematik Allgemein. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- 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