The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.LO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
Oracle modalities are the least forcing a predicate, every modality is an oracle modality via adjoint retraction to containers, and sheaves are algebras for the monad of quotient-inductive computation trees.
A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.
citing papers explorer
-
The Gamified Kat\v{e}tov order is not linear (in fact, very much not so)
The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.
-
Sheaves as oracle computations
Oracle modalities are the least forcing a predicate, every modality is an oracle modality via adjoint retraction to containers, and sheaves are algebras for the monad of quotient-inductive computation trees.
-
What can Topology tell us about Logical Complexity?
A computable variant of the gamified Katětov order on filters is isomorphic to the Lawvere-Tierney order, linking combinatorial complexity measures to computability in topos theory.