More existence theorems for recursion categories.

DOI10.1016/S0168-0072(03)00060-5zbMath1049.03033MaRDI QIDQ1428035

Florian Lengyel

Publication date: 14 March 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

ComputabilityCoalgebraTuring morphism\(P\)-categoryRecursion category

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Special categories (18B99) Abstract and axiomatic computability and recursion theory (03D75) Foundations, relations to logic and deductive systems (18A15)

Related Items (1)

Introduction to Turing categories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``Pathologies in two syntactic categories of partial maps
• Universal coalgebra: A theory of systems
• Products of coalgebras.
• An existence theorem for recursion categories
• Dominical categories: recursion theory without elements
• Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
• An algebraic approach to categories of partial morphisms
• Coalgebras of bounded type
• On the structure of categories of coalgebras
• Functors for coalgebras

This page was built for publication: More existence theorems for recursion categories.