Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
Logic Journal of IGPL 5(4), pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.LO 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.
Satisfiability of propositional logic with nonemptiness atom NE in team semantics is NP-complete, validity coNP-complete, and model checking polynomial-time.
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.
-
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
Satisfiability of propositional logic with nonemptiness atom NE in team semantics is NP-complete, validity coNP-complete, and model checking polynomial-time.