Lawvere-Tierney topologies for computability theorists

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.

Locations

• Transactions of the American Mathematical Society Series B - View - PDF
• arXiv (Cornell University) - View - PDF
• DataCite API - View