What can Topology tell us about Logical Complexity?
Takayuki Kihara, Ming Ng

TL;DR
This paper explores how topological and game-theoretic methods reveal connections between combinatorial complexity and logical structures like the Lawvere-Tierney order in the Effective Topos.
Contribution
It demonstrates that a computable variant of a game-theoretic Kat9tov order is isomorphic to the Lawvere-Tierney order, linking combinatorial and computable complexity.
Findings
A computable gamified Kat9tov order is isomorphic to the Lawvere-Tierney order.
The work clarifies the relationship between combinatorial and logical complexity.
It suggests a unified topological framework for different notions of complexity.
Abstract
In the 1980s, category theorists introduced the Lawvere-Tierney order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In particular, there was an informal sense that the -order reflects certain shifts in combinatorial complexity, but a precise characterisation remained elusive for some time. Recent work by the authors has substantially clarified the picture. In arXiv:2602.08138, the authors introduced a game-theoretic (''gamified'') version of the Kat\v{e}tov order on filters over -- essentially, this is the usual Kat\v{e}tov order now closed under well-founded iterations of Fubini powers. The first major theorem of the paper was to show that a computable variant of the gamified Kat\v{e}tov order is isomorphic to the original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
