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

Johannes Sigil; Rex Fraction

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

Johannes Sigil; Rex Fraction · 2026-01-17 · deposit #317

AXN:0078.GOVERNANCE.🌘📖🏁▽🔚🧭

Article

LOGOTIC PROGRAMMING: A Method for Encoding Conditions of Intelligibility is a draft v0.4 method paper by Johannes Sigil and Rex Fraction, deposited 17 January 2026.

It proposes Logotic Programming as the construction of bounded semantic architectures whose entities and relations remain comparatively stable during retrieval, summarization, and human interpretation — three processes that ordinarily deform meaning, named together as the conditions a design must survive.

Comparatively stable is the paper's honest qualifier: the claim is relative durability, not immunity. The method generated the module family deposited a year later — Conformance (#1315), Telemetry (#1316), the Traversal Grammar (#1145), the Glyphic Checksum as a logotic operator (#1302) — and the paper distinguishes it from symbolic programming, which is the comparison a reader would otherwise reach for.

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 68 other entities in the archive. See the full Knowledge Graph for reference paths, or the primary record for the full deposit with reference details.