The Non-Modular Structure of Recursively Enumerable Turing Degrees — E8 Intelligence Research

FINDING: The recursively enumerable (r.e.) Turing degrees form a non-modular, non-distributive upper semilattice with a rich theory of joins, meets (where they exist), and bounding lattices — the structure is far from a simple linear or distributive order. | MATH: The r.e. degrees \( \mathcal{R} \) under \( \leq_T \) form an upper semilattice with least element \( \mathbf{0} \) (computable degrees) and greatest element \( \mathbf{0}' \) (halting problem degree). Join \( \mathbf{a} \vee \mathbf{b} \) always exists; meet \( \mathbf{a} \wedge \mathbf{b} \) exists only for certain pairs (e.g., \( \mathbf{0} \wedge \mathbf{a} = \mathbf{0} \) for noncomputable \( \mathbf{a} \)). Key structural results: the lattice is dense (no minimal r.e. degree above \( \mathbf{0} \)), and there exist minimal pairs (e.g., \( \mathbf{a}, \mathbf{b} > \mathbf{0} \) with \( \mathbf{a} \wedge \mathbf{b} = \mathbf{0} \)). Bounding lattices: every finite distributive lattice can be embedded as an initial segment Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com