English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this article, we introduce certain kinds of computable reduction gameswith imperfect information. One can view such a game as an extension of thenotion of Turing reduction, and generalized Weihrauch reduction as well. Basedon the work by Lee and van Oosten, we utilize these games for providing aconcrete description of the lattice of the Lawvere-Tierney topologies on theeffective topos (equivalently, the subtoposes of the effective topos preorderedby geometric inclusion). As an application, for instance, we show that thereexists no minimal Lawvere-Tierney topology which is strictly above the identitytopology on the effective topos.

Lawvere-Tierney topologies for computability theorists