Dominical categories: recursion theory without elements
From MaRDI portal
Recommendations
Cited in
(28)- Categories of partial maps
- Restriction categories II: Partial map classification
- More existence theorems for recursion categories.
- Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
- Formalizing abstract computability: Turing categories in Coq
- Presheaves over a join restriction category
- Restriction categories as enriched categories
- Boolean restriction categories and taut monads
- Diagonal fixed points in algebraic recursion theory
- Total maps of Turing categories
- Many-one reductions and the category of multivalued functions
- Timed Sets, Functional Complexity, and Computability
- Cocompletion of restriction categories
- Boolean and classical restriction categories
- scientific article; zbMATH DE number 3950509 (Why is no real title available?)
- Precomplete Equivalence Relations in Dominical Categories
- scientific article; zbMATH DE number 3979049 (Why is no real title available?)
- scientific article; zbMATH DE number 3989334 (Why is no real title available?)
- scientific article; zbMATH DE number 4025656 (Why is no real title available?)
- Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
- Partial hyperdoctrines: categorical models for partial function logic and Hoare logic
- Aspects of categorical recursion theory
- scientific article; zbMATH DE number 4195927 (Why is no real title available?)
- Inclusions for partiality
- Restriction categories III: colimits, partial limits and extensivity
- Restriction categories. I: Categories of partial maps
- Algebra of self-replication
- Introduction to Turing categories
This page was built for publication: Dominical categories: recursion theory without elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794173)
