The Gamified Katětov order embeds P(ω)/Fin, yielding antichains of size continuum and new non-modest degrees in the extended Weihrauch hierarchy.
Cohomology detects failures of the axiom of choice , url =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
math.LO 2years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
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.
-
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.