0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Algebra

Buy Now

Algebraic Computability and Enumeration Models - Recursion Theory and Descriptive Complexity (Hardcover) Loot Price: R4,293
Discovery Miles 42 930
Algebraic Computability and Enumeration Models - Recursion Theory and Descriptive Complexity (Hardcover): Cyrus F Nourani

Algebraic Computability and Enumeration Models - Recursion Theory and Descriptive Complexity (Hardcover)

Cyrus F Nourani

 (sign in to rate)
Loot Price R4,293 Discovery Miles 42 930 | Repayment Terms: R402 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

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 for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic types of models. New homotopy techniques are applied to Marin Lof types of computations with model categories. Functorial computability, induction, and recursion are examined in view of the above, presenting new computability techniques with monad transformations and projective sets. This informative volume will give readers a complete new feel for models, computability, recursion sets, complexity, and realizability. This book pulls together functorial thoughts, models, computability, sets, recursion, arithmetic hierarchy, filters, with real tree computing areas, presented in a very intuitive manner for university teaching, with exercises for every chapter. The book will also prove valuable for faculty in computer science and mathematics.

General

Imprint: Apple Academic Press Inc.
Country of origin: Canada
Release date: February 2016
First published: 2016
Authors: Cyrus F Nourani
Dimensions: 229 x 152 x 23mm (L x W x T)
Format: Hardcover - Cloth over boards
Pages: 310
ISBN-13: 978-1-77188-247-7
Categories: Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic
Books > Science & Mathematics > Mathematics > Algebra > General
LSN: 1-77188-247-6
Barcode: 9781771882477

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners