Introduction to Turing categories
From MaRDI portal
Publication:998306
DOI10.1016/j.apal.2008.04.005zbMath1155.03030OpenAlexW1979127885MaRDI QIDQ998306
J. Robin B. Cockett, Pieter J. W. Hofstra
Publication date: 28 January 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.04.005
computability theorypartial combinatory algebramodels of computationpartial map categoryTuring categories
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
Total maps of Turing categories ⋮ Unitary Theories, Unitary Categories ⋮ Timed Sets, Functional Complexity, and Computability ⋮ Computability models over categories and presheaves ⋮ Categorical models of the differential λ-calculus ⋮ Restriction categories as enriched categories ⋮ Many-one reductions and the category of multivalued functions ⋮ On the Semantics of Intensionality ⋮ Categorical models of the differential \(\lambda\)-calculus revisited ⋮ Categorical simulations ⋮ Computability structures, simulations and realizability ⋮ Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract) ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Formalizing abstract computability: Turing categories in Coq ⋮ Aspects of Categorical Recursion Theory
Cites Work
- A general form of relative recursion
- Partial Horn logic and Cartesian categories
- A category-theoretic characterization of functional completeness
- Categorical simulations
- Fundamentals of generalized recursion theory
- Partial morphisms in categories of effective objects
- Categories of partial maps
- Partiality, cartesian closedness, and toposes
- Generalized Banach-Mazur functionals in the topos of recursive sets
- Classical recursion theory. The theory of functions and sets of natural numbers
- Handbook of computability theory
- Restriction categories II: Partial map classification
- More existence theorems for recursion categories.
- Developing theories of types and computability via realizability
- Relative and modified relative realizability
- A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
- The Suslin-Kleene theorem for countable structures
- Classifying categories for partial equational logic
- Impredicativity entails untypedness
- An existence theorem for recursion categories
- All realizability is relative
- Dominical categories: recursion theory without elements
- Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
- A relativization mechanism in recursion categories
- Ordered partial combinatory algebras
- Collapsing partial combinatory algebras
- Effective applicative structures
- Computer Science Logic
- On the ubiquity of certain total type structures
- Algebraically Generalized Recursive Function Theory
- Abstract First Order Computability. I
- Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability
- Restriction categories. I: Categories of partial maps
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Introduction to Turing categories
