Aspects of Categorical Recursion Theory
DOI10.1007/978-3-030-66545-6_7zbMath1486.81060arXiv2001.05778OpenAlexW3000371917MaRDI QIDQ5014598
Pieter J. W. Hofstra, Philip J. Scott
Publication date: 8 December 2021
Published in: Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.05778
Quantum computation (81P68) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to quantum theory (81-01) General histories, source books (01A05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to history and biography (01-01) Classical models of computation (Turing machines, etc.) (68Q04) Computational methods for problems pertaining to category theory (18-08)
Cites Work
- Total maps of Turing categories
- Basic subtoposes of the effective topos
- An induction principle for consequence in arithmetic universes
- Linear logic
- Languages for monoidal categories
- Categories for computation in context and unified logic
- Relations in operational categories
- Diagram chasing in Mal'cev categories
- Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The structure of free closed categories
- An exactification of the monoid of primitive recursive functions
- A categorical model for the geometry of interaction
- A category-theoretic characterization of functional completeness
- Monoidal categories with natural numbers object
- Categorical simulations
- Introduction to Turing categories
- Realizability. An introduction to its categorical side
- Kleene computable functionals and the higher order existence property
- Natural deduction and coherence for weakly distributive categories
- Intuitionist type theory and the free topos
- Generalized Banach-Mazur functionals in the topos of recursive sets
- Classical recursion theory. The theory of functions and sets of natural numbers
- LCF considered as a programming language
- An internal language for autonomous categories
- Regular and exact completions
- Safe recursion with higher types and BCK-algebra
- Characterizing partitioned assemblies and realizability toposes
- Cut elimination in categories
- Cartesian categories with natural numbers object
- Realizability models for BLL-like languages
- Artin glueing
- A characterization of the left exact categories whose exact completions are toposes
- Some free constructions in realizability and proof theory
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- A fixpoint theorem for complete categories
- Coherence in closed categories
- Unitary Theories, Unitary Categories
- Colimit completions and the effective topos
- An existence theorem for recursion categories
- The Mathematics of Sentence Structure
- Recursive Functionals and Quantifiers of Finite Types I
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- Higher-Order Computability
- Relative computability in the effective topos
- Computability and Logic
- Towards a typed Geometry of Interaction
- Dominical categories: recursion theory without elements
- How to Program an Infinite Abacus
- Tripos theory
- Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
- Ordered partial combinatory algebras
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- Why commutative diagrams coincide with equivalent proofs
- Functional completeness of cartesian categories
- Feedback, trace and fixed-point semantics
- Traced monoidal categories
- Partial Recursive Functions and Finality
- On the ubiquity of certain total type structures
- AN ELEMENTARY THEORY OF THE CATEGORY OF SETS
- Deductive systems and categories
- Computability and Recursion
- On the interpretation of intuitionistic number theory
- Recursively enumerable sets of positive integers and their decision problems
- Realizability: a historical essay
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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: Aspects of Categorical Recursion Theory
