Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
Journal of Philosophical Logic 34(5), p
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LO 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.
Develops cyclic labelled sequent calculi for propositional and first-order process logic over regular programs, with soundness via infinite descent and completeness via derivation of prior rules.
citing papers explorer
-
Labelled Sequent Calculi for Propositional Team Logics
Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
-
Labelled Sequents for Inquisitive First-Order Modal Logic
A complete labelled sequent calculus is developed for inquisitive first-order modal logic by extending prior work, with proofs of strong completeness, rule invertibility, and cut admissibility.
-
Labelled Process Logic
Develops cyclic labelled sequent calculi for propositional and first-order process logic over regular programs, with soundness via infinite descent and completeness via derivation of prior rules.