Abstract
In this article, we study the lattice of Lawvere-Tierney topologies on Hyland’s effective topos. For this purpose, we introduce a new computability-theoretic reducibility notion, which is a common extension of the notions of Turing reducibility and generalized Weihrauch reducibility. Based on the work by Lee and van Oosten [Ann. Pure Appl. Logic 164 (2013), pp. 866-883], we utilize this reducibility notion for providing a concrete description of the lattice of the Lawvere-Tierney topologies on the effective topos. As an application, we solve several open problems proposed by Lee and van Oosten. For instance, we show that there exists no minimal Lawvere-Tierney topology which is strictly above the identity topology on the effective topos.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the American Mathematical Society, Series B
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
