Lawvere-Tierney topologies for computability theorists
From MaRDI portal
Publication:5875936
DOI10.1090/btran/134OpenAlexW3169552282MaRDI QIDQ5875936
Publication date: 7 February 2023
Published in: Transactions of the American Mathematical Society, Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.03061
Topoi (18B25) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic subtoposes of the effective topos
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Polynomials and linear transformations
- Degrees of difficulty of generalized r.e. separating classes
- Realizability. An introduction to its categorical side
- Classical recursion theory. The theory of functions and sets of natural numbers
- Recursion theory week. Proceedings of a conference held in Oberwolfach, Germany, March 19-25, 1989
- Sheaves in geometry and logic: a first introduction to topos theory
- Handbook of computability theory
- A topological view on algebraic computation models
- Bad oracles in higher computability and randomness
- Realizability with a local operator of A. M. Pitts
- Recursion theory. Computational aspects of definability
- Probabilistic computability and choice
- \({\Pi}_1^0\)-encodability and omniscient reductions
- Many-one reductions and the category of multivalued functions
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- Effective Choice and Boundedness Principles in Computable Analysis
- Algorithmic Randomness and Complexity
- On notions of computability-theoretic reduction between Π21 principles
- CT 0 is Stronger than CT 0 !
- Hyperarithmetically Encodable Sets
- Dividing by Zero -- How Bad Is It, Really?
- Descriptive Set Theory in the Category of Represented Spaces
- Handbook of Computability and Complexity in Analysis
- A note on the diamond operator
- COH, SRT 2 2 , and multiple functionals
- A COMPARISON OF VARIOUS ANALYTIC CHOICE PRINCIPLES
- Bishop-Style Constructive Reverse Mathematics
- Reduction games, provability and compactness
- RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION
- Compositions of multivalued functions
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Thin set theorems and cone avoidance
- Martin's Conjecture: A Classification of the Naturally Occurring Turing Degrees
- An extension of the recursively enumerable Turing degrees
