Buch, Englisch, 310 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 417 g
Recursion Theory and Descriptive Complexity
Buch, Englisch, 310 Seiten, Format (B × H): 152 mm x 229 mm, Gewicht: 417 g
ISBN: 978-1-77463-575-9
Verlag: Taylor & Francis Ltd (Sales)
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.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Preface. Introduction. Computing Categories, Language Fragments, and Models. Functorial Admissible Models. Initial Tree Computing and Languages. Descriptive Sets and Infinitary Languages. Complexity and Computing. Arithmetic Hierarchy and Enumeration Degrees. Peano Arithmetic Models and Computability. Realizability and Computability. Index.