The superposition calculus, which underlies first-order theorem provers such as E, SPASS,
and Vampire, combines ordered resolution and equality reasoning. As a step towards …

We describe a formal proof of the independence of the continuum hypothesis (CH) in the
Lean theorem prover. We use Boolean-valued models to give forcing arguments for both …

We describe a formalization of forcing using Boolean-valued models in the Lean 3 theorem
prover, including the fundamental theorem of forcing and a deep embedding of first-order …

We present a DPLL SAT solver, which we call TrueSAT, developed in the verification-
enabled programming language Dafny. We have fully verified the functional correctness of …

The propositional compactness theorem is of principal importance for any meta-logical
development because of the myriad of applications in logic and combinatorics. Typically, this …

Classical logics are explosive, meaning that everything follows from a contradiction.
Paraconsistent logics are logics that are not explosive. This paper presents the meta-theory …