Turing Degrees: Dense Poset, Complex r.e. Lattice, and Minimal Upper Bound Limits — E8 Intelligence Research

FINDING: Turing degrees form a dense poset with no minimal upper bounds in general; lattice-theoretic structure of recursively enumerable (r.e.) degrees is complex, with bounding lattices revealing non-distributive, non-modular substructures. | MATH: Turing degrees \(D\) are a partial order under Turing reducibility \(≤_T\). Density theorem: for any \(a <_T b\), \(∃ c\) s.t. \(a <_T c <_T b\) (Sacks 1964). Minimal upper bounds exist for countable ideals but not for all chains. In \(R\) (r.e. degrees), the poset is not a lattice — infima and suprema need not exist. Bounding lattices: sublattices of \(R\) that are lattices (e.g., \(M_3\), \(N_5\) — the non-distributive, non-modular pentagon) are embeddable, showing \(R\)'s rich algebraic pathology. | CONNECTION: Lattice structures here are **not** geometric lattices (no meet/join distributivity, no rank function). However, the **poset density** (between any two elements there is a third) m Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com