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 \( R \) under \( ≤_T \) form an upper semilattice with least element \( 0 \) (computable degrees) and greatest element \( 0' \) (halting problem degree). Join \( a b \) always exists; meet \( a b \) exists only for certain pairs (e.g., \( 0 a = 0 \) for noncomputable \( a \)). Key structural results: the lattice is dense (no minimal r.e. degree above \( 0 \)), and there exist minimal pairs (e.g., \( a, b > 0 \) with \( a b = 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