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 3verdicts
UNVERDICTED 3representative citing papers
Proves no cofinal chains exist in the Weihrauch degrees of any order type, shows coinitial non-zero sequences equivalent to CH, and gives conditions for maximal antichains.
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.
-
Chains and antichains in the Weihrauch lattice
Proves no cofinal chains exist in the Weihrauch degrees of any order type, shows coinitial non-zero sequences equivalent to CH, and gives conditions for maximal antichains.
-
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.