RESEARCH BASE
Search 3,721 documents across 34 fields — every claim tier-rated by evidence
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.
386 results for "propositional logic" — page 20 of 20
ZD_1_00 — Foundations Theory: Subfolder Summary
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
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
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
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
V_2_00 — Pure Mathematics: Subfolder Summary
BROWSE BY SECTION — 3,721 documents across 34 fields