The agda-unimath library
-
Updated
Sep 29, 2026 - Agda
The agda-unimath library
A General-Purpose Tool for Formal Concept Analysis
WIP Python library providing tools for combinatorial maths (partially-ordered sets, graph polynomials, etc.)
Mathematical tools for dependency analysis, partial orders, and combinatorial structure.
A Lean 4 formalization of discrete causal posets and convex-cone models for AQEI constraints. Features 130+ machine-checked theorems covering chain-complex homology proxies, $Z_1$ cycle space stability, and bidirectional equivalence of 1-cycle proxies.
The algebra of a cell: two poles, origins with phase, and the acts that move them. Zero dependencies.
Modern, header-only ISO C++20 library for finite discrete mathematics and algorithmic structures. Unified bridge architecture across graphs, automata, logic, order theory, and abstract algebra with zero external dependencies.
Selected logical aspects of apophatic theology | The PhD thesis in philosophy written in 2022 (in Polish) under the supervision of Adam Olszewski.
AI-assisted mathematical research manuscripts with reproducible materials across combinatorics and words, matrix and coding theory, topology, order and discrete geometry, algebra, matroids, and continuous optimization.
Utilities for the Local Dimension of a Boolean lattice article.
A graded ladder of nine state machines (chain, cycle, reversible graph, containment poset, DFA, LR automaton, register machine, replicated state machine), each posed as reconstruct-a-view-from-a-log. One worked reference and eight open challenges to implement as event-stream projections. Spec-driven, oracle-gated.
To associate your repository with the order-theory topic, visit your repo's landing page and select "manage topics."