Partial recursive functions and finality

DOI10.1007/978-3-642-38164-5_21MaRDI QIDQ4922089zbMATH OpenOpenAlexFDO

Authors Gordon D. Plotkin

Publication date 28 May 2013

Published in Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38164-5_21

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Abstract and axiomatic computability and recursion theory (03D75) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Recommendations

• scientific article; zbMATH DE number 4101439
• scientific article; zbMATH DE number 3979049
• scientific article; zbMATH DE number 3944108
• Logical Approaches to Computational Barriers
• Partial Continuous Functions and Admissible Domain Representations

Cites work

• An equational notion of lifting monad
• An internal language for autonomous categories
• Continuous Lattices and Domains
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 193320 (Why is no real title available?)
• scientific article; zbMATH DE number 1840601 (Why is no real title available?)
• Linear Recursive Functions
• Logical number theory I. An introduction
• Monoidal categories with natural numbers object
• Premonoidal categories and notions of computation
• Restriction categories II: Partial map classification
• Semantics of weakening and contraction
• Simplifications of the recursion scheme
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(2)

• Natural number objects in Dialectica categories
• Aspects of categorical recursion theory

This page was built for publication: Partial recursive functions and finality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4922089)