Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
In Samson Abramsky, Juha Kontinen, Jouko Väänänen & Heribert V ollmer, editors: Dependence Logic: theory and applications
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative 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.
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.