RESEARCH BASE

Search 3,721 documents across 34 fields — every claim tier-rated by evidence

3,721 Documents 34 Sections 43,623 Citations 34,854 Keywords Indexed 4 Evidence Tiers

3,633 are the core, quality-scored corpus (34 lettered sections — see How We Work); the remaining 88 are cross-corpus synthesis documents (68 InterDocs, 12 Connections, 8 Theories) also indexed here.

2,500 results for "dying and rising god" — page 96 of 125

B_1_21 Verified Beings & Entities

B_1_21 — Culture Hero Archetype: Prometheus, Maui, Quetzalcoatl, and the Global Gift of Knowledge

The culture hero is one of the most persistent character types in world mythology — a figure (divine, semi-divine, or human) who obtains crucial knowledge, skills, or resources for humanity, often through theft from the

culture hero Prometheus Maui Quetzalcoatl fire bringer knowledge giver
B_1_04 Beings & Entities

B_1_04 — Ningishzida — Serpent Deity, Underworld Guardian, and Knowledge Bearer

Ningishzida (Sumerian: dNin-ĝiš-zid-da, "Lord of the Good Tree" or "Lord of the Faithful Tree") is a Mesopotamian deity associated with serpents, the underworld, vegetation, and secret knowledge. He appears in Sumerian t

Ningishzida Gizzida serpent deity underworld guardian Sumerian Mesopotamian
B_3_04 Beings & Entities

B_3_04 — Chimeric Beings — Centaurs, Sphinxes, Minotaurs, and Composite Entities

Composite beings — entities combining human and animal features — appear in the art and mythology of every major civilization. From the Egyptian Sphinx and Mesopotamian Lamassu to the Greek Centaur, Hindu Garuda, and Mes

chimera centaur sphinx minotaur manticore Garuda
B_3_06 Beings & Entities

B_3_06 — Leviathan — Biblical Sea Monster and Chaos Serpent

Leviathan (Hebrew: לִוְיָתָן, Livyātān) is the great sea monster of the Hebrew Bible — a multi-headed, fire-breathing chaos serpent whom only YHWH can subdue. Appearing in Job 41 (the longest single monster description i

Leviathan Livyatan sea monster chaos serpent Job 41 Psalm 74
B_3_14 Verified Beings & Entities

B_3_14 — Four Horsemen and Apocalyptic Entities: End-Time Beings

Apocalyptic entities — supernatural beings associated with the end of the world, the Last Judgment, and the cosmic battle between good and evil — populate the eschatological traditions of virtually every major religion.

Four Horsemen Apocalypse Revelation eschatology end-times Antichrist
B_3_12 Verified Beings & Entities

B_3_12 — Phoenix and Firebird: Resurrection Bird Across Cultures

The Phoenix — a mythical bird that dies in fire and is reborn from its own ashes — is among the most enduring and widespread symbols of death, regeneration, and immortality in world mythology. The concept appears in dist

phoenix Bennu bird Fenghuang Firebird Simurgh resurrection
B_3_17 Credible Beings & Entities

B_3_17 — Nāga Kings: Serpent Deities in Buddhist, Hindu, and Southeast Asian Tradition

The Nāga (Sanskrit: नाग) — divine serpent beings with the power to assume human, serpentine, or hybrid forms — constitute one of the most pervasive and enduring supernatural categories across South and Southeast Asian re

Nāga serpent kings Nāga Buddhism Mucalinda Ananta Shesha Nāgarāja
B_3_05 Beings & Entities

B_3_05 — Thunderbird and Avian Supernatural Beings

Supernatural avian beings — enormous, powerful, and frequently storm-associated birds — form one of the most persistent and geographically widespread motifs in world mythology. From the Thunderbird of North American Plai

Thunderbird Garuda Simurgh Phoenix Bennu Fenghuang
B_3_11 Verified Beings & Entities

B_3_11 — Kitsune, Huli Jing, and Fox Spirits in East Asian Tradition

Fox spirits — beings that have cultivated supernatural powers through longevity, meditation, or absorbing celestial energy — represent one of the most richly developed and culturally significant categories of supernatura

kitsune fox spirit huli jing kumiho nine-tailed fox shapeshifting
B_3_08 Beings & Entities

B_3_08 — Garuda — Divine Eagle and Serpent Enemy

Garuda (Sanskrit: गरुड, Garuḍa) is the divine eagle of Hindu and Buddhist mythology — the king of birds, the eternal enemy of serpents (nāgas), and the mount (vāhana) of the god Viṣṇu. First attested in the Rig Veda (~15

Garuda Garuḍa eagle bird serpent enemy nāga
ZD_1_12 Verified Information & Computation

ZD_1_12 — Information Geometry and Fisher Information

Information geometry is the mathematical field that applies differential geometry — the mathematics of curved spaces, manifolds, metrics, and connections — to the study of probability distributions and statistical models

information geometry Fisher information statistical manifold Riemannian geometry metric tensor natural gradient
ZD_1_08 Information & Computation

ZD_1_08 — Lambda Calculus and Functional Programming

Lambda calculus, invented by Alonzo Church in the 1930s as a formal system for expressing computation via function abstraction and application, stands alongside Turing machines as a foundational model of computation. Chu

lambda calculus functional programming Church Turing computability Church-Turing thesis
ZD_1_01 Information & Computation

ZD_1_01 — Algorithms, Computation, and the Limits of Knowledge

An algorithm is a finite, unambiguous sequence of instructions for solving a problem — a concept formalized independently by Alan Turing (Turing machine, 1936) and Alonzo Church (lambda calculus) in response to David Hil

algorithms computation Turing machine Gödel incompleteness Church-Turing thesis
ZD_1_10 Information & Computation

ZD_1_10 — Automata Theory and Formal Languages

Automata theory studies abstract computational machines and the classes of languages they recognize, forming the mathematical backbone of computer science. The Chomsky hierarchy (1956–59) classifies formal languages into

automata theory formal languages Chomsky hierarchy finite automata pushdown automata Turing machine
ZD_1_15 Verified Information & Computation

ZD_1_15 — Quantum Information Theory: Entanglement, Quantum Computing, and Information Bounds

Quantum information theory — the study of how information is encoded, processed, communicated, and protected using quantum mechanical systems — represents one of the most transformative intellectual developments at the i

quantum information qubit entanglement quantum computing quantum error correction Shor algorithm
ZD_1_09 Information & Computation

ZD_1_09 — Conway's Game of Life and Recreational Mathematics

Conway's Game of Life (1970), a two-dimensional cellular automaton devised by mathematician John Horton Conway (1937–2020), stands as perhaps the most famous example of how astonishingly complex behavior can arise from e

Game of Life cellular automata Conway recreational information-computation emergence self-replication
ZD_1_07 Information & Computation

ZD_1_07 — Cellular Automata and Rule Systems: Emergence from Simple Rules

Cellular automata (CA) are discrete computational systems where simple local rules applied to a grid of cells generate complex global behavior — demonstrating that complexity can emerge from simplicity without central co

cellular automata Conway's Game of Life Stephen Wolfram Rule 110 emergence self-organization
ZD_1_14 Verified Information & Computation

ZD_1_14 — Type Theory: Lambda Calculus, Dependent Types, and the Curry-Howard Correspondence

Type theory is a foundational framework in mathematics, logic, and computer science that classifies values and expressions into types — categories that determine what operations are valid: a natural number can be added t

type theory lambda calculus dependent types Curry-Howard Coq Lean
ZD_1_11 Verified Information & Computation

ZD_1_11 — Turing Machine, Computability, and the Limits of Computation

The Turing machine — a mathematical model of computation defined by Alan Turing in his 1936 paper "On Computable Numbers, with an Application to the Entscheidungsproblem" — is the foundational formalism of theoretical co

Turing machine computability decidability halting problem Church-Turing thesis algorithm
ZD_1_05 Information & Computation

ZD_1_05 — Computational Complexity: P vs NP and the Limits of Efficient Computation

Computational complexity theory classifies problems not by whether they can be solved, but by how efficiently they can be solved — and its central open question, P vs NP, is one of the seven Clay Millennium Prize Problem

computational complexity P vs NP NP-completeness complexity classes polynomial time Turing machines