Partial Recursive Functions and Finality

DOI10.1007/978-3-642-38164-5_21zbMath1264.03091OpenAlexW1528936577MaRDI QIDQ4922089

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) Eilenberg-Moore and Kleisli constructions for monads (18C20) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (2)

Natural number objects in Dialectica categories ⋮ Aspects of Categorical Recursion Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monoidal categories with natural numbers object
• Logical number theory I. An introduction
• An internal language for autonomous categories
• Semantics of weakening and contraction
• An equational notion of lifting monad
• Restriction categories II: Partial map classification
• Linear Recursive Functions
• Premonoidal categories and notions of computation
• Continuous Lattices and Domains
• Simplifications of the recursion scheme
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Partial Recursive Functions and Finality