dēdūxit [deːˈduːk.sɪt] Latin, verb: "it has derived", the perfect of dēdūcō, to lead down, derive.
deduxit is a collection of logic suites. It decides whether a sequent
is provable, and shows the proof or says why there is none. It is a
command, deduxit, and a Rust library, the crate deduxit. Its suites
are linear logic (classical and intuitionistic, first-order and cyclic,
and the Lambek calculus) and propositional logic (classical,
intuitionistic and minimal), where a sequent that is not valid gets a
Kripke countermodel and classical logic has truth tables and tableaux.
It proves step by step, draws proof nets and countermodels, reads
intuitionistic proofs as lambda-terms, and exports proofs to LaTeX,
Typst, SVG, PNG, PDF and Rocq. The web page
proves step by step in the browser with the same library. It began as
linlog, a linear logic library (up to 0.2.0), and is growing to take in
more calculi.
Install
Each release has the
command built for Linux (an archive, a .deb, an .rpm and an Arch
Linux package), macOS and Windows. With Rust 1.92 or later, or with Nix:
The library is the crate deduxit:
[]
= "0.4"
The manual's Install deduxit has the commands for each system, updating and removing, and the library's features.
A first proof
$ deduxit prove "A, A -o B |- B"
provable (MLL, classical, focus engine)
─────── ax ─────── ax
⊢ ~A, A ⊢ ~B, B
──────────────────── ⊗
⊢ ~A, A ⊗ ~B, B
$ deduxit prove "A |- B"
unprovable (MLL, classical, focus engine): A on the left has no A on the right to meet in an axiom
The first line is the verdict, with the fragment of linear logic the
sequent uses, the logic and the engine that searched. Then comes the
proof, which the proof checker has verified, or the reason there is
none. The proof is written one-sided, the standard form for classical
linear logic: ⊢ ~A, A is the axiom A ⊢ A. --classical-sides two
writes it with the sides you gave:
$ deduxit prove --classical-sides two "A, A -o B |- B"
provable (MLL, classical, focus engine)
───── ax ───── ax
A ⊢ A B ⊢ B
──────────────── ⊸L
A, A ⊸ B ⊢ B
With --logic, deduxit decides classical, intuitionistic or minimal
propositional logic instead. A sequent that is not valid comes with a
checked Kripke countermodel:
$ deduxit prove --logic intuitionistic "|- A \/ ~A"
not valid (intuitionistic logic by the SAT solver): a checked countermodel refutes it
world 0 (the model's world): forces nothing; below 1
world 1: forces A
At world 0, A is not yet true, and ~A fails since A holds at
world 1 above it.
The exit status is 0 for provable or valid, 1 for unprovable or not
valid, 3 for unknown and 2 for an error. deduxit <command> --help
shows every option.
Where to go next
- The manual,
deduxit.github.io/deduxit/manual,
starts with a short tour, then has a guide for each task (deciding a
sequent, checking a proof, exporting, Rocq certificates, proving step
by step, other logics, the library), the reference, how the search
works, and the benchmarks
beside the other provers. It describes
main; a release's manual is thedocs/directory of its tag. - The web page, deduxit.github.io: proving step by step in the browser, with lessons.
- The library's API: docs.rs/deduxit for
the releases, deduxit.github.io/deduxit
for
main. - For AI models: the Agent Skill
skills/deduxit/, a summary and a full reference whose examples a test runs, also served as llms.txt and llms-full.txt. Copy the directory into an agent's skills (~/.claude/skills/for Claude Code). - The Rocq library,
rocq-deduxit(deduxit/rocq-deduxit): the calculi, checkers and soundness theorems that the certificates of--kernel deduxitare proved with. - What changed: the changelog.
deduxit's code, tests and documentation were written with substantial AI assistance, by Anthropic's Claude models in Claude Code, in steps the author planned, directed and accepted. Every proof the library returns has passed its independent checker, and a Rocq certificate can be checked by Rocq. deduxit is much inspired by Click & coLLecT. Feature requests and contributions are welcome.
Citing
Each release is archived on Zenodo. To cite deduxit, use the DOI
10.5281/zenodo.23448588,
which always resolves to the latest version, or the DOI of the version
you used, which its Zenodo record gives. CITATION.cff
holds the entry, and GitHub's "Cite this repository" writes it as BibTeX
or APA.
Licence
deduxit is © Fabian Lukas Grubmüller and licensed under the European
Union Public Licence, version 1.2 (EUPL-1.2), whose text is in
LICENSE.
One part of the repository is someone else's work under its own licence:
the five math fonts in cli/fonts/, which the deduxit
command embeds to draw proofs, four under the SIL Open Font License 1.1:
Euler Math, © the American Mathematical Society, Khaled Hosny and
Daniel Flipo (cli/fonts/OFL.txt); STIX Two Math,
© the STIX Fonts Project Authors
(cli/fonts/STIXTwoMath-Regular-OFL.txt);
Garamond-Math, © Yuansheng Zhao and Xiangdong Zeng
(cli/fonts/Garamond-Math-OFL.txt);
and Asana Math, © Apostolos Syropoulos, Young Ryu and Claudio Beccari
(cli/fonts/Asana-Math-OFL.txt); and
New Computer Modern Math (its Book weight), © Antonis Tsolomitis, under
the GUST Font License, which is the LaTeX Project Public License 1.3c
(cli/fonts/NewCMMath-Book-LICENSE.txt,
which also says where the complete package is). The package
deduxit-cli is therefore EUPL-1.2 AND OFL-1.1 AND LPPL-1.3c; the
library deduxit contains no font. Drawings and documents made with the OFL
fonts are not covered by their licence (its condition 5); a PNG holds
no font, while a PDF embeds the part of the font its text uses, and for
New Computer Modern Math the LPPL makes no exception for documents.
deduxit's mark, at the head of this file, is not in the repository: it is served by deduxit's site, © Fabian Lukas Grubmüller, under CC BY 4.0. The name deduxit and its mark identify this project, and may not be used to suggest its endorsement of anything else.
The problem libraries and the other provers that the benchmarks and the comparison use are not part of this repository: the flake fetches each at a pinned version when it is needed, under its own licence. The LLTP library is GPL-3.0, the ILTP library states no licence, qcover's problems are Apache-2.0, and the manual's "Beside the other provers" gives the provers' licences.