Start from zero
Make axioms, rules, and dependencies explicit. Build knowledge from a minimal formal foundation, with a traceable path for every result.
AN OPEN AI FOR MATH PROJECT
Building toward autonomous mathematics, from the ground up.
AI explores the proof. Every step can be checked.
+A minimal beginning. An open horizon.
01 / OUR VISION
We believe mathematics can grow in a new way.
Our long-term goal is a mathematical system that develops without relying on human mathematicians. Starting with explicit axioms and inference rules, AI would propose definitions, explore statements, and produce proofs for an independent verifier to check, step by step.
No human endorsement should be needed for each result. Everyone should be able to inspect, reproduce, and help build the system.
Make axioms, rules, and dependencies explicit. Build knowledge from a minimal formal foundation, with a traceable path for every result.
A plausible answer needs an explicit proof. Every inference should be open to independent checking and replay.
Open code, open rules, open discussion. Math enthusiasts, researchers, and developers all have a place to contribute.
02 / HOW THE SYSTEM GROWS
Producing a proof and checking it are separate jobs.
AI can explore boldly. Results must follow explicit rules.
THE FOUNDATION
Publish the assumptions, definitions, and inference rules.
AUTONOMY · OUR GOAL
Explore statements and construct explicit proof certificates.
THE RECORD
Record each conclusion, inference rule, and dependency.
THE CHECK
Check every step against a selected claim and its premises.
Trust grows from open rules and reproducible checks.
Read the specification03 / A PROOF YOU CAN INSPECT
Choose a statement and replay its derivation.
Try altering a step. See what the checker has to say.
STATEMENT TO CHECK
Assume P, then discharge the assumption to derive that P implies P.
| Step | Conclusion | Inference rule | |
|---|---|---|---|
| 01 | P | Assumption | · |
| 02 | P → P | Implication introduction | · |
The last rule is replaced with conjunction elimination. The selected claim stays the same.
{
"format": "lemqo-proof-v1",
"logic": "ipl",
"formulas": [
[
"atom",
"P"
],
[
"imp",
0,
0
]
],
"steps": [
[
"assume",
0
],
[
"imp_intro",
1,
0
]
],
"root": 1
}This demo replays propositional-logic examples from the repository. Use the open-source verifier for full verification and input checks.
Run it locally04 / FROM TODAY TO TOMORROW
Autonomous mathematics is our long-term vision.
Today, we begin with transparent proof verification.
CURRENT RELEASE · v0.2
10 fixed natural-deduction rules for implication, conjunction, disjunction, and falsehood.
Read the specification3 selected main theorems in a restricted corpus have independent check records. This path remains experimental.
Inspect verification recordsNEXT · RESEARCH DIRECTIONS
05 / BUILD FROM ZERO, TOGETHER
Math enthusiasts, mathematicians, AI researchers, developers.
Bring your curiosity. Help turn ideas into verifiable reasoning.
Run examples, ask questions, and share statements you want to explore.
Review axioms and rules. Research assurance and formal expression.
Improve checkers, tools, documentation, and the experience of working openly.