Categorifying computable reducibilities

DOI10.46298/LMCS-21(1:15)2025MaRDI QIDQ7016772zbMATH OpenFDO

Authors Davide Trotta, Manlio Valenti, Valeria de Paiva

Publication date 6 March 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-21(1:15)2025

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Proarrow equipments, Yoneda structures, KZ doctrines (lax idempotent monads) (18D65)

Cites work

• A characterization of generalized existential completions
• A small complete category
• A survey of Mučnik and Medvedev degrees
• Adjointness in foundations
• All realizability is relative
• Categories of partial equivalence relations as localizations
• Classical recursion theory. The theory of functions and sets of natural numbers
• Dialectica logical principles
• Dialectica logical principles: not only rules
• Dialectica principles via Gödel doctrines
• First-order logic in the Medvedev lattice
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 4104952 (Why is no real title available?)
• scientific article; zbMATH DE number 47172 (Why is no real title available?)
• scientific article; zbMATH DE number 49667 (Why is no real title available?)
• scientific article; zbMATH DE number 3556031 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 841094 (Why is no real title available?)
• scientific article; zbMATH DE number 7503144 (Why is no real title available?)
• scientific article; zbMATH DE number 7577584 (Why is no real title available?)
• scientific article; zbMATH DE number 3346618 (Why is no real title available?)
• scientific article; zbMATH DE number 3370546 (Why is no real title available?)
• Many-one reductions and the category of multivalued functions
• On the interpretation of intuitionistic number theory
• Partial combinatory algebras of functions
• Power domains
• Quotient completion for the foundation of constructive mathematics
• Quotients, pure existential completions and arithmetic universes
• Realizability. An introduction to its categorical side
• Regular and exact completions
• Relative and modified relative realizability
• Some free constructions in realizability and proof theory
• The existential completion
• The Gödel fibration
• The modified realizability topos
• Tripos theory
• Tripos theory in retrospect
• Triposes as a generalization of localic geometric morphisms
• Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator
• Unifying exact completions
• Weihrauch Complexity in Computable Analysis
• Weihrauch degrees, omniscience principles and weak computability

Cited in

(1)

• A topos for extended Weihrauch degrees

This page was built for publication: Categorifying computable reducibilities

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