Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
Tim S. Lyon, Ian Shillito, Alwen Tiu

TL;DR
This paper introduces the first sound and complete proof system for first-order bi-intuitionistic logic with increasing domains, using a polytree sequent calculus with explicit eigenvariable contexts to control variable scope and avoid domain collapse.
Contribution
It presents a novel proof system for first-order bi-intuitionistic logic with non-constant domains, featuring cut-elimination and conservativity over intuitionistic logic, formalized via polytree sequents with explicit variable contexts.
Findings
Proof system is sound and complete for first-order bi-intuitionistic logic.
The calculus enjoys cut-elimination and is conservative over intuitionistic logic.
Explicit eigenvariable context controls variable scope and encodes Scott's existence predicate.
Abstract
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting problem to find a sound and complete proof system for first-order bi-intuitionistic logic with non-constant domains that is also conservative over first-order intuitionistic logic. We solve this problem by presenting the first sound and complete proof system for first-order bi-intuitionistic logic with increasing domains. We formalize our proof system as a polytree sequent calculus (a notational variant of nested sequents), and prove that it enjoys cut-elimination and is conservative over first-order intuitionistic logic. A key feature of our calculus is an explicit eigenvariable context, which allows us to control precisely the scope of free…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
