eBook - PDF
Algebraic Computability and Enumeration Models
Recursion Theory and Descriptive Complexity
This is a test
- 310 pages
- English
- PDF
- Available on iOS & Android
eBook - PDF
Algebraic Computability and Enumeration Models
Recursion Theory and Descriptive Complexity
Book details
Table of contents
Citations
About This Book
This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples
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 Algebraic Computability and Enumeration Models by Cyrus F. Nourani in PDF and/or ePUB format, as well as other popular books in Mathematics & Algebra. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- Front Cover
- Contents
- List of Abbreviations
- Preface
- 1. Introduction
- 2. Computing Categories, Language Fragments, and Models
- 3. Functorial Admissible Models
- 4. Initial Tree Computing and Languages
- 5. Descriptive Sets and Infinitary Languages
- 6. Complexity and Computing
- 7. Arithmetic Hierarchy and Enumeration Degrees
- 8. Peano Arithmetic Models and Computability
- 9. Realizability and Computability
- Back Cover