Modified realizability subtoposes and total Weihrauch reducibility
Akihito Kajikawa, Masamori Kaku, Takayuki Kihara, Satoshi Nakata
Abstract
In recent years, there has been rapid development in the foundational study of oracle computability from the perspective of Lawvere-Tierney topologies and their sheaves. In this article, we formulate and analyze the notion of reducibility within the framework of total computability. Then, using sheaf subtoposes derived from oracles in the total computable setting, we establish separations between various hierarchies of logical principles, including the hierarchies of the weak law of excluded middle WLEM, the lessor limited principle of omniscience LLPO, and Markov's principle MP.
Create a lesson
Related papers
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski
Coding is non-robust
Sam Sanders
Scott topologies on products of countable complete Heyting algebras
Xiaoquan Xu
1-genericity and almost everywhere domination
Xuanheng Zhao
Almost-everywhere computation of weak generics relative to r.e. sets
Xuanheng Zhao
On definable Galois theory and definable Galois cohomology in the totally transcendental setting
David Meretzky