Labelled sequent calculi are developed and shown sound and complete for four team-semantics logics, with admissible structural rules and terminating search procedures.
Annals of Pure and Applied Logic 173(6), pp
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
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.
-
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.