# <picture><source media="(prefers-color-scheme: dark)" srcset="https://deduxit.github.io/logo/wordmark-dark.svg"><img alt="deduxit" src="https://deduxit.github.io/logo/wordmark-light.svg" height="80"></picture>
> **dēdūxit** [deːˈduːk.sɪt] *Latin, verb*: "it has derived", the perfect of *dēdūcō*, to lead down, derive.
[](https://doi.org/10.5281/zenodo.23448588)
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](https://deduxit.github.io/)
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](https://github.com/deduxit/deduxit/releases) 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:
```sh
cargo install --locked deduxit-cli # build and install it
nix run github:deduxit/deduxit -- --help # run it once, without installing
nix profile add github:deduxit/deduxit#deduxit-cli # install it into your profile
```
The library is the crate [`deduxit`](https://crates.io/crates/deduxit):
```toml
[dependencies]
deduxit = "0.4"
```
The manual's
[Install deduxit](https://deduxit.github.io/deduxit/manual/installation.html)
has the commands for each system, updating and removing, and the
library's features.
## A first proof
```console
─────── 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:
```console
───── 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:
```console