This page is inspired by Peter Smith's LaTeX for Logicians.
General
Most symbols used in logic are part of the Unicode character set and accessible as named symbols in Typst.
For example, linear logicians can use times.o for the multiplicative conjunction ⊗, amp.inv for the multiplicative disjunction ⅋, multimap for the linear implication ⊸, etc.
One can also use #let then = math.class("binary", "⨟") for function composition in diagrammatic order.
Proof theory
- proof trees
- curryst is the most widely used package. prooflists and proofstack offer alternative interfaces for this package: the former is built around various kinds of lists, while the latter provides a stack-based interface in the style of LaTeX's ebproof.
- Fitch-style proofs
- fitchcraft, frederic, and derive-it
A package for proof nets and a package for structured calculational proofs (possibly named calculemus) would be welcome contributions.
Type theory
- terms
- lambdabus (parse, normalise, and display), or lambdabe (parse, reduce, and visualise)
- Tromp diagrams
- trompet (built on top of lambdabus)
Semantics and set theory
- truth tables
- truthfy (empty or automatically filled)
- venn diagrams
- cetz-venn (for two or three sets)
Category theory
- commutative diagrams
- fletcher (built on top of CeTZ), or the simpler commute
- string diagrams
- drawstring (for monoidal categories with copying and discarding)
- ZX-calculus
- typograph-zx (ZX and continuous-variable ZX notation)