2000 character limit reached
Labelled Sequents for Inquisitive First-Order Modal Logic
Published 30 Jun 2026 in cs.LO | (2606.31868v1)
Abstract: In recent work, an inquisitive first-order modal logic has been proposed to reason about relations of modal dependence, including the notion of global supervenience (functional dependence among the extensions of predicates relative to a space of possibilities). At present, no proof system exists for this logic. We provide a complete labelled sequent calculus, extending a calculus developed by Litak and Sano for a weak version of inquisitive first-order logic. We prove strong completeness for the calculus and show that it enjoys desirable structural properties, including the invertibility of its rules and the admissibility of cut.
Paper Prompts
Sign up for free to create and run prompts on this paper.