Results 11 to 20 of about 178,207 (183)
Decidability of predicate logics with team semantics [PDF]
, 2016 We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete.
Kontinen, Juha +2 more
core +6 more sources
Safe Dependency Atoms and Possibility Operators in Team Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it.
Pietro Galliani
doaj +7 more sources
Team Semantics and Independence Notions in Quantum Physics [PDF]
arXiv, 2021 We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework introduced by the first author in a prior paper.
Abramsky, Samson +2 more
arxiv +3 more sources
Team Semantics and Recursive Enumerability [PDF]
, 2014 It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models.
Kuusisto, Antti
core +2 more sources
A Van Benthem Theorem for Modal Team Semantics [PDF]
arXiv, 2014 The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic MDL and team semantics.
Kontinen, Juha +3 more
arxiv +6 more sources
The expressive power of modal logic with inclusion atoms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Lauri Hella, Johanna Stumpf
doaj +4 more sources
Inclusion and Exclusion Dependencies in Team Semantics: On Some Logics of Imperfect Information [PDF]
Annals of Pure and Applied Logic, 2011 We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic.
Galliani, Pietro
core +4 more sources
On the Complexity of Linear Temporal Logic with Team Semantics [PDF]
arXiv, 2020 A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets of sets of traces. One logical approach to this is team logic, which is a logical framework for the specification
arxiv +5 more sources
Synchronous Team Semantics for Temporal Logics [PDF]
arXivWe present team semantics for two of the most important linear and branching time specification languages, Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). With team semantics, LTL is able to express hyperproperties, which have in the last decade been identified as a key concept in the verification of information flow properties.
Krebs, Andreas +3 more
arxiv +3 more sources
Two strong undefinability results in inquisitive and team semantics [PDF]
arXivWe prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with tensor; 2) we show the undefinability of global disjunction in extended propositional dependence logic.
arxiv +3 more sources