Algebraic Computability and Enumeration Models

Recursion Theory and Descriptive Complexity

af Cyrus F. Nourani

This book 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 ... (Læs mere)