Observable derived state
A highlightjs language grammar for the Lean theorem proving language.
An interactive display for the Lean 4 theorem prover.
This project provides high-level and low-level TypeScript bindings for the [Z3 theorem prover](https://github.com/Z3Prover/z3). It is available on npm as [z3-solver](https://www.npmjs.com/package/z3-solver).
Unicode input mechanism for the Lean 4 theorem prover
detect collisions 2d between all possible kinds of shapes. It uses Bounding Volume Hierarchy (BVH) for sweep wide quick tree trim phase, and the Separating Axis Theorem (SAT) for accurate detection inside nearby groups. This library supports RayCasting, o
Monaco Editor support for the Lean 4 theorem prover.
Core engine for Theorem — parser, translator, solver, scanner, suggester
CLI for Theorem — formal verification for TypeScript
Chinese Remainder Theorem solver for NodeJS
This library allows you to calculate the Pythagorean theorem
Bundler plugins for Theorem — strip contracts at build time (vite, esbuild, tsup)
精细碰撞检测，SAT(Separating Axis Theorem)分离轴定理，适用于任意2D凸多边形的 精细检测 阶段
Separating Axis Theorem in 3D
Pythagorean theorem triangle solver
TypeScript Language Service Plugin for Theorem — inline verification in VS Code
Typescript support for contenteditable divs with the Unicode input support of the Lean 4 theorem prover
High-performance WebAssembly theorem prover with dependent types, hash-consing (150x faster), Ed25519 proof signatures, MCP support for Claude Code, AgentDB vector search, episodic memory, and ReasoningBank learning. Formal verification with cryptographic
A minimalist Slidev theme inspired by the Auriga LaTeX Beamer theme, featuring academic components such as theorem blocks, BibTeX citations, footnotes, and paginated references
An automated theorem prover for first-order predicate logic written in TypeScript
An implementation of the separating axis theorem. This package is a learning project inspired by sat.js.
Bayes Theorem in Node.js
four color theorem with JavaScript
TypeScript port of ProofOfThought - Neurosymbolic program synthesis combining LLMs with Z3 theorem proving
Executable empirical companion for the DSFB theorem banks and paper figures
The missing center — Universal Dirac operator and closure object proving all 14 executable theorems share one spectrum
Gluing 108 mathematical islands into a continent — type bridges, theorem bridges, and the topos structure the mathematics wants to be
Propositional logic with exponentials
An mdbook preprocessor for automatically numbering theorems, lemmas, etc.
AXON v1.5.1 — first crates.io publication of the AXON language full-stack runtime. Lexer/parser/type-checker/IR generator (re-exported from axon-frontend) plus the native Rust runtime: typed channels (TypedEventBus with QoS×5, π-calculus mobility, capability extrusion via shield D8 — Fase 13.f.2), Free Monad CPS handlers (Fase 2), lease kernel + reconcile loop (Fase 3+5), Epistemic Security Kernel (ESK Fase 6), Trust Types + ReplayLog (Fase 11.a+11.c), Stateful PEM over WebSocket (Fase 11.d), Ontological Tool Synthesis (Fase 11.e), Mobile Typed Channels (Fase 13). Crate publishes as `axon-lang` to mirror the Python PyPI package; library import remains `use axon::*` so existing call sites keep working unchanged.
DSFB Structural Semiotics Calculus — typed residual sign framework, grammar FSM, endoductive operator, and provenance engine. Rust type-level realization of the DSSC formal calculus (Invariant Forge LLC, April 2026).
Measure theory for agents — rigorous foundation of integration and probability
Generator for the DSFB Atlas v2 — emits 10,000-theorem LaTeX from YAML specs with SHA-256 proof-uniqueness verification.
The Grand Unification crate — all 14 executable theorems project from one spectral triple (A, H, D)
A simple lib to log the process in any rust project.
A debuggable automatic theorem prover for boolean satisfiability problems (SAT).
simple and extensible test library toolkit
Classifier module using Bayesian's theorem.
First-Order Logic Theorem Prover
A gem for calculating probabilities modelled by the binomial theorem.
Not only can this rule engine tell when rules conflict but it can be expanded in many ways, including as an automatic theorem solver
Green Garden is the definitive Ruby gem to handle common Trees operations by using fancy code argued on Tree Traversal theorem.
Kramdown extension for math-heavy document. It provides theorem environments, and easy references to those environments as well as to equations and section headers. Moreover, a bibliography section can be generated from a BibTeX file, and an flexible and easy mean of citing bibliographical entries is provided. Sections and environments are automatically numbered.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.