RESEARCH BASE

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

3,721 Documents 34 Sections 43,625 Citations 34,852 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.

5 results for "Coq"

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_5_05 Verified Information & Computation

ZD_5_05 — Formal Methods: Mathematical Verification and Specification of Software

Formal methods are mathematically rigorous techniques for the specification, development, and verification of software and hardware systems — using formal (mathematical) languages to describe system behavior and mathemat

formal methods formal verification model checking theorem proving specification correctness
F_3_02 Credible Lost Connections

F_3_02 — Manichaean Transmission Along the Silk Road

This document examines Manichaean Transmission Along the Silk Road, a topic within the Lost Connections research area. Key areas of investigation include The Visionary Experience, The Deliberate Synthesis, Mani's Travels

Mani Manichaeism Manichaean Silk Road Turfan Sogdian
V_4_15 Credible Mathematics & Information

V_4_15 — Formal Verification: Proving Programs Correct

Formal verification — the use of rigorous mathematical methods to prove that a software or hardware system satisfies its specification — aims to provide absolute correctness guarantees, going beyond testing (which can re

formal verification program correctness Hoare logic model checking theorem proving type theory
V_2_08 Verified Mathematics & Information

V_2_08 — Mathematical Proof: History & Philosophy

Mathematical proof — the definitive demonstration that a statement follows necessarily from accepted axioms — is the distinguishing feature of mathematics as a discipline. The axiomatic-deductive method originated with t

mathematical proof axiomatic method Euclid proof by contradiction reductio ad absurdum Four Color Theorem