An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees (short version)

arXiv:2611.08319 · math.LO, cs.LO · Submitted 2026-11-05 · Read on arXiv

math.LO, cs.LO

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 18 pages, comments welcome. Conference version of arXiv:2603.19946, accepted at CSL 2027

Project page: https://mathoverflow.net/a/507736

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Arthur-Nimue-Merlin degrees are a generalization of the Turing degrees introduced by Kihara as a tangible description of the partially ordered set of Lawvere-Tierney topologies on the effective…

Terminology

Abstract

The Arthur-Nimue-Merlin degrees are a generalization of the Turing degrees introduced by Kihara as a tangible description of the partially ordered set of Lawvere-Tierney topologies on the effective topos (equivalently, subtoposes of the effective topos). They are defined in terms of a three-player game that introduces both angelic and demonic non-determinism into oracle queries. We construct an order embedding of the Turing degrees with their order reversed into the Arthur-Nimue-Merlin degrees, whose image we call the "co-Turing degrees"; we then study the order relationship of these co-Turing degrees with the (naturally embedded) Turing degrees within the Arthur-Nimue-Merlin degrees. This is a short version of arXiv:2603.19946, focused on the main results.

Sources

Related papers