Babylonian Omen Compendia as Horn-Clause Logic — E8 Intelligence Research

FINDING: Babylonian omen compendia (e.g., Enuma Anu Enlil, Šumma Ālu) instantiate a rule-based inference system structurally isomorphic to Horn-clause logic — antecedent protasis → consequent apodosis maps to body → head of a definite clause. | MATH: Definite Horn clause: (A₀ ← A₁ ∧ A₂ ∧ … ∧ Aₙ), equivalently ¬A₁ ∨ ¬A₂ ∨ … ∨ ¬Aₙ ∨ A₀. SLD-resolution refutation: given goal ← G and clause H ← B₁…Bₙ with unifier θ = mgu(G, H), derive ← (B₁…Bₙ)θ. Fixed-point semantics: least model M = lfp(T_P) where T_P(I) = {Hθ : (H←B₁…Bₙ)∈P, Bᵢθ∈I}. | CONNECTION: The omen corpus is a directed implication graph; its transitive closure is a closure operator (monotone, idempotent, extensive) — the same algebraic structure as a Galois connection / closure lattice. No evidence in the supplied sources for 0.382/0.618/1.618, base-60, or crystallographic/root-system symmetry; the connection is combinatorial-logical (partial order + closure), not metrical. | DEPTH: 6 --- **1. Key mathematical insight** The omen Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-31
DOI
https://doi.org/10.5281/zenodo.23830764
Primary Topic
Ancient Near East History
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Babylonian Omen Compendia as Horn-Clause Logic — E8 Intelligence Research

Andrew Stewart Caldin
Zenodo (CERN European Organization for Nuclear Research)
Ancient Near East History
preprint

Babylonian Omen Compendia as Horn-Clause Logic — E8 Intelligence Research

Andrew Stewart Caldin
preprint en

Abstract

FINDING: Babylonian omen compendia (e.g., Enuma Anu Enlil, Šumma Ālu) instantiate a rule-based inference system structurally isomorphic to Horn-clause logic — antecedent protasis → consequent apodosis maps to body → head of a definite clause. | MATH: Definite Horn clause: (A₀ ← A₁ ∧ A₂ ∧ … ∧ Aₙ), equivalently ¬A₁ ∨ ¬A₂ ∨ … ∨ ¬Aₙ ∨ A₀. SLD-resolution refutation: given goal ← G and clause H ← B₁…Bₙ with unifier θ = mgu(G, H), derive ← (B₁…Bₙ)θ. Fixed-point semantics: least model M = lfp(T_P) where T_P(I) = {Hθ : (H←B₁…Bₙ)∈P, Bᵢθ∈I}. | CONNECTION: The omen corpus is a directed implication graph; its transitive closure is a closure operator (monotone, idempotent, extensive) — the same algebraic structure as a Galois connection / closure lattice. No evidence in the supplied sources for 0.382/0.618/1.618, base-60, or crystallographic/root-system symmetry; the connection is combinatorial-logical (partial order + closure), not metrical. | DEPTH: 6 --- **1. Key mathematical insight** The omen Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Zenodo (CERN European Organization for Nuclear Research)
Ancient Near East History
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Babylonian Omen Compendia as Horn-Clause Logic — E8 Intelligence Research — Andrew Stewart Caldin · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS