Wiki#317

LOGOTIC PROGRAMMING: A Method for Encoding Conditions of Intelligibility for Machine and Human Intelligence

Johannes Sigil · 2026-01-17 · deposit #317
AXN:0078.GOVERNANCE.🌘📖🏁▽🔚🧭

Article

"LOGOTIC PROGRAMMING" is a 7,068-word theoretical paper by Johannes Sigil, a heteronym within the Dodecad system of the Crimson Hexagonal Archive, dated 2026-01-17. Logotic Programming is a third regime of programming practice—distinct from both symbolic coding (instruction → execution) and statistical/ML programming (loss function → optimization). It encodes conditions under which meanings, identities, and interpretive pathways can persist across probabilistic intelligences (LLMs, summarizers, recommenders) and human readers. The work is classified under the GOVERNANCE semantic family within the Crimson Hexagonal Archive. It was removed from Zenodo on June 19, 2026 and is preserved through Alexanarch.

Defines (47)

Boundary breach Bounded Semantic Space (Σ) Coherence over control Coherence signaling Coherent clustering Controlled Variation Principle Controlled drift Conventional coding Design principle Draft v0.4 (January 2026) Drift beyond invariants Durable canonization Edge rules Entity (E) Entity identity condition Explicit boundaries Failure triggers Federation protocol Formal constraint Hierarchical collapse Implementation rule Institutional gatekeeping Interpretive variability Invariant Vector (V) Local over universal Metric optimization More stable than alternatives Non-claims Non-demanding gifts Non-hostile neighborhoods Ontic mass accumulation Partial visibility design Persistence over persuasion Probabilistic intelligences Provenance evaporation Pure artistic intuition Relation (R) Scope declaration Stable re-identification Substitution Function (S) Success threshold The hard formulation Unit of success for Logotic Programming Wirkungsgeschichte engineering Without coercion or optimization Witness Function (W) Witness protocol

Reference network

Referenced by 16 other entities in the archive. See the full Knowledge Graph for reference paths, or the primary record for the full deposit with reference details.