Cover Image

Algebraic computability and enumeration models : recursion theory and descriptive complexity /

Show other versions (1)

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 an...

Full description

Bibliographic Details
Main Author: Nourani, Cyrus F. (Author)
Corporate Author: Taylor & Francis
Format: eBook
Language:English
Published: Boca Raton : CRC Press, [2016]
Subjects:
Functor theory.
Model theory.
Computable functions.
Algebra, Homological.
Kleene algebra.
Théorie des foncteurs.
Théorie des modèles.
Fonctions calculables.
Algèbre homologique.
Algèbre de Kleene.
Algebra, Homological
Computable functions
Functor theory
Kleene algebra
Model theory
Electronic books.
Online Access:Connect to the full text of this electronic book
Description
Summary: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 descri.
Physical Description:1 online resource : text file, PDF
Bibliography:Includes bibliographical references and index.
ISBN:9781771882484
1771882484