RESEARCH BASE

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

3,717 documents 34 sections 47,686 citations 34,596+ keywords indexed 4 evidence tiers

389 results for "description logic" — page 20 of 20

B_2_20 Verified Beings & Entities

B_2_20 — World Serpent Comparative: Jörmungandr, Ouroboros, Shesha, and Global Serpent Cosmologies

The World Serpent — a cosmic serpent that encircles, supports, or threatens the world — is among the most widespread and persistent motifs in human mythology, appearing independently in traditions separated by vast dista

world serpent Jörmungandr ouroboros Shesha Ananta Quetzalcoatl
B_2_22 Verified Beings & Entities

B_2_22 — Thunderbird: Storm Bird Mythology Across Cultures

The Thunderbird — a colossal avian being whose wingbeats produce thunder and whose eyes or beak flash lightning — is one of the most powerful and widespread figures in Indigenous North American mythology, documented acro

thunderbird storm bird Wakinyan Anzu Garuda Roc
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
ZD_1_00 Information & Computation

ZD_1_00 — Foundations Theory: Subfolder Summary

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
V_4_20 Credible Mathematics & Information

V_4_20 — Hypercomputation & Beyond-Turing Models

Hypercomputation refers to any model of computation that can solve problems beyond the theoretical capabilities of standard Turing machines — the abstract devices defined by Alan Turing in his landmark 1936 paper "On Com

hypercomputation super-Turing oracle machines analog computation Turing limit Church-Turing thesis
V_2_19 Credible Mathematics & Information

V_2_19 — Category Theory: Abstract Structure, Functors & Topos Theory

Category theory — often called the "mathematics of mathematics" — provides a universal language for describing mathematical structures and the relationships between them, emphasizing morphisms (arrows, maps, transformati

category-theory functor natural-transformation topos-theory saunders-mac-lane samuel-eilenberg
V_2_00 Mathematics & Information

V_2_00 — Pure Mathematics: Subfolder Summary