ATLAS coverage
Every documented public declaration of the ATLAS v2 libraries has one roadmap
article. The standalone Atlas/ developments are not decomposed yet, and the
archived v1 release is not part of the wiki. Progress percentages and target counts
cover only the decomposed rows below; they are not repository-wide coverage.
Decomposed (4)
v2 / MathlibExt
14850 documented public declarations across 27 subjects; 276 instances and 4442 undocumented public declarations are not articles.
45,865 statements · 37,864 fully proved · 7,930 ready to prove · 32 statement formalized · 27 ready to state · 12 planned
Epistemic models · Epistemic formulas · Negation of epistemic formulas · Disjunction of epistemic formulas · Satisfaction in an epistemic model · Validity in an epistemic model · Falsity is not valid in an epistemic model · Satisfaction of a disjunction · Distribution axiom K · Truth axiom T · Positive introspection axiom 4 · Negative introspection axiom 5 · The two-agent coin model · Agent 0 knows the coin is heads exactly at heads · Agent 0 knows the coin is tails exactly at tails · Agent 1 does not know that the coin is heads · Agent 1 knows that agent 0 knows whether the coin is heads · Modal formulas · Negation of modal formulas · The possibility operator · The truth constant · Conjunction · Disjunction of modal formulas · Axiom K · Axiom T · Axiom 4 · Axiom D · Axiom B · Axiom 5 · Kripke model · Satisfaction in a Kripke model · Global validity in a Kripke model · Falsity is valid in no Kripke model · Semantics of possibility · Validity of axiom K on Kripke models · Axiom T is valid on reflexive Kripke models · Axiom 4 is valid on transitive Kripke models · Axiom D is valid on serial Kripke models · Axiom B is valid on symmetric Kripke models · Axiom 5 is valid on euclidean Kripke models · Bounded morphism · Extensionality for bounded morphisms · Identity bounded morphism · Composition of bounded morphisms · Invariance of modal satisfaction under bounded morphisms · Surjective bounded morphisms preserve and reflect validity · Bisimulation · Bisimulations preserve modal formulas · Bisimilar worlds · Bisimilar worlds are modally equivalent · and 45,815 more
v2 / CSLibExt
13636 documented public declarations across 7 subjects; 299 instances and 4261 undocumented public declarations are not articles.
45,865 statements · 37,864 fully proved · 7,930 ready to prove · 32 statement formalized · 27 ready to state · 12 planned
Epistemic models · Epistemic formulas · Negation of epistemic formulas · Disjunction of epistemic formulas · Satisfaction in an epistemic model · Validity in an epistemic model · Falsity is not valid in an epistemic model · Satisfaction of a disjunction · Distribution axiom K · Truth axiom T · Positive introspection axiom 4 · Negative introspection axiom 5 · The two-agent coin model · Agent 0 knows the coin is heads exactly at heads · Agent 0 knows the coin is tails exactly at tails · Agent 1 does not know that the coin is heads · Agent 1 knows that agent 0 knows whether the coin is heads · Modal formulas · Negation of modal formulas · The possibility operator · The truth constant · Conjunction · Disjunction of modal formulas · Axiom K · Axiom T · Axiom 4 · Axiom D · Axiom B · Axiom 5 · Kripke model · Satisfaction in a Kripke model · Global validity in a Kripke model · Falsity is valid in no Kripke model · Semantics of possibility · Validity of axiom K on Kripke models · Axiom T is valid on reflexive Kripke models · Axiom 4 is valid on transitive Kripke models · Axiom D is valid on serial Kripke models · Axiom B is valid on symmetric Kripke models · Axiom 5 is valid on euclidean Kripke models · Bounded morphism · Extensionality for bounded morphisms · Identity bounded morphism · Composition of bounded morphisms · Invariance of modal satisfaction under bounded morphisms · Surjective bounded morphisms preserve and reflect validity · Bisimulation · Bisimulations preserve modal formulas · Bisimilar worlds · Bisimilar worlds are modally equivalent · and 45,815 more
v2 / PhyslibExt
2093 documented public declarations across 3 subjects; 107 instances and 5224 undocumented public declarations are not articles.
45,865 statements · 37,864 fully proved · 7,930 ready to prove · 32 statement formalized · 27 ready to state · 12 planned
Epistemic models · Epistemic formulas · Negation of epistemic formulas · Disjunction of epistemic formulas · Satisfaction in an epistemic model · Validity in an epistemic model · Falsity is not valid in an epistemic model · Satisfaction of a disjunction · Distribution axiom K · Truth axiom T · Positive introspection axiom 4 · Negative introspection axiom 5 · The two-agent coin model · Agent 0 knows the coin is heads exactly at heads · Agent 0 knows the coin is tails exactly at tails · Agent 1 does not know that the coin is heads · Agent 1 knows that agent 0 knows whether the coin is heads · Modal formulas · Negation of modal formulas · The possibility operator · The truth constant · Conjunction · Disjunction of modal formulas · Axiom K · Axiom T · Axiom 4 · Axiom D · Axiom B · Axiom 5 · Kripke model · Satisfaction in a Kripke model · Global validity in a Kripke model · Falsity is valid in no Kripke model · Semantics of possibility · Validity of axiom K on Kripke models · Axiom T is valid on reflexive Kripke models · Axiom 4 is valid on transitive Kripke models · Axiom D is valid on serial Kripke models · Axiom B is valid on symmetric Kripke models · Axiom 5 is valid on euclidean Kripke models · Bounded morphism · Extensionality for bounded morphisms · Identity bounded morphism · Composition of bounded morphisms · Invariance of modal satisfaction under bounded morphisms · Surjective bounded morphisms preserve and reflect validity · Bisimulation · Bisimulations preserve modal formulas · Bisimilar worlds · Bisimilar worlds are modally equivalent · and 45,815 more
v2 / WantedExt
15300 documented public declarations across 26 subjects; 179 instances and 202 undocumented public declarations are not articles.
45,865 statements · 37,864 fully proved · 7,930 ready to prove · 32 statement formalized · 27 ready to state · 12 planned
Epistemic models · Epistemic formulas · Negation of epistemic formulas · Disjunction of epistemic formulas · Satisfaction in an epistemic model · Validity in an epistemic model · Falsity is not valid in an epistemic model · Satisfaction of a disjunction · Distribution axiom K · Truth axiom T · Positive introspection axiom 4 · Negative introspection axiom 5 · The two-agent coin model · Agent 0 knows the coin is heads exactly at heads · Agent 0 knows the coin is tails exactly at tails · Agent 1 does not know that the coin is heads · Agent 1 knows that agent 0 knows whether the coin is heads · Modal formulas · Negation of modal formulas · The possibility operator · The truth constant · Conjunction · Disjunction of modal formulas · Axiom K · Axiom T · Axiom 4 · Axiom D · Axiom B · Axiom 5 · Kripke model · Satisfaction in a Kripke model · Global validity in a Kripke model · Falsity is valid in no Kripke model · Semantics of possibility · Validity of axiom K on Kripke models · Axiom T is valid on reflexive Kripke models · Axiom 4 is valid on transitive Kripke models · Axiom D is valid on serial Kripke models · Axiom B is valid on symmetric Kripke models · Axiom 5 is valid on euclidean Kripke models · Bounded morphism · Extensionality for bounded morphisms · Identity bounded morphism · Composition of bounded morphisms · Invariance of modal satisfaction under bounded morphisms · Surjective bounded morphisms preserve and reflect validity · Bisimulation · Bisimulations preserve modal formulas · Bisimilar worlds · Bisimilar worlds are modally equivalent · and 45,815 more
Mapped (2)
Atlas/StatisticalMechanics
Standalone Lean files; no roadmap articles yet.
Atlas/FC
Standalone Lean files; no roadmap articles yet.
Out of scope (2)
v2 tests (MathlibExtTest, CSLibExtTest, PhyslibExtTest)
Tests and diagnostics rather than mathematical results.
Atlas/CPythonListsort
Maintained as its own Autoform blueprint inside Atlas/CPythonListsort.
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.