Welcome to the Inquisitive Logic project website!
This project formalizes inquisitive logic in Rocq, based on the work of e.g. Ivano Ciardelli.
The current focus lies on (bounded) inquisitive first-order logic, therefore providing a formalization of the basic syntax (using arity types), support and truth semantics, followed by the formalization of a sequent calculus by Litak/Sano whose corresponding paper (Bounded inquistive logics: Sequent calculi and schematic validity) got accepted for TABLEAUX 2025.
The theory is located under theories/
.
Some concrete instances of type classes (e.g. signatures) are located under instances/
.
We also provide some examples (examples/
) in order to demonstrate the implemented theory.
This is an open source project, licensed under the BSD 3-Clause “New” or “Revised” License.
The current stable release of Inquisitive Logic can be downloaded from GitHub.
The coqdoc presentation of the source files can be browsed here
Related publications, if any, are listed below.
Other versions stored here are listed in the following: