Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information

From MaRDI portal
Publication:645985

DOI10.1016/j.apal.2011.08.005zbMath1250.03047arXiv1106.1323OpenAlexW2034690236MaRDI QIDQ645985

Pietro Galliani

Publication date: 11 November 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.1323




Related Items

Boolean dependence logic and partially-ordered connectivesPropositional union closed team logicsDependence logic with a majority quantifierA double team semantics for generalized quantifiersA finite axiomatization of conditional independence and inclusion dependenciesFrame Theory, Dependence Logic and StrategiesAxiomatizations of team logicsDoubly strongly first order dependenciesOn the expressive power of TeamLTL and first-order team logic over hyperpropertiesA parameterized view on the complexity of dependence logicCoherence in inquisitive first-order logicSeparation logic and logics with team semanticsUnifying hidden-variable problems from quantum mechanics by logics of dependence and independenceOn elementary logics for quantitative dependenciesOn the Presburger fragment of logics with multiteam semanticsOn definability of team relations with \(k\)-invariant atomsEmbedding causal team languages into predicate logicEnumerating teams in first-order team logicsUnnamed ItemQuestions and dependency in intuitionistic logicComplexity of Propositional Independence and Inclusion LogicModal Inclusion Logic: Being Lax is Simpler than Being StrictModel-checking games for logics of imperfect informationThe expressive power of modal logic with inclusion atomsAlternating (in)dependence-friendly logicModified numerals and split disjunction: the first-order caseCOMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIESUpwards closed dependencies in team semanticsCapturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logicStrongly first order, domain independent dependencies: the union-closed caseParameterized complexity of propositional inclusion and independence logicGeneral models and entailment semantics for independence logicAxiomatizing first order consequences in inclusion logicUnnamed ItemUnnamed ItemDependence and independenceUnnamed ItemUnnamed ItemAxiomatizing first-order consequences in independence logicTransition semantics: the dynamics of dependence logicDynamic Logics of Imperfect Information: From Teams and Games to TransitionsTeam semantics for the specification and verification of hyperpropertiesOn the complexity of team logic and its two-variable fragmentComplexity of validity for propositional dependence logicsCharacterizing quantifier extensions of dependence logicPropositional team logicsGeneralized quantifiers in dependence logicComplexity of syntactical tree fragments of independence-friendly logicBreaking the Atom with SamsonA logical approach to context-specific independenceThe expressive power of \(k\)-ary exclusion logicCharacterising modal definability of team-based logics via the universal modalityNegation and partial axiomatizations of dependence and independence logic revisitedApproximation and dependence via multiteam semanticsCHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIESSafe dependency atoms and possibility operators in team semanticsTeam semantics for interventionist counterfactuals: observations vs. interventionsTractability frontiers in probabilistic team semantics and existential second-order logic over the realsTractability frontiers in probabilistic team semantics and existential second-order logic over the realsParameterised complexity of model checking and satisfiability in propositional dependence logicLOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCEExpressivity and Complexity of Dependence LogicGrelling on DependenceOn Strongly First-Order DependenciesGames for Inclusion Logic and Fixed-Point LogicApproximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete DataDependence and Independence in Social Choice: Arrow’s TheoremA Class of Automata for the Verification of Infinite, Resource-Allocating BehavioursFrontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositionsCanonical Models and the Complexity of Modal Team LogicDependency Concepts up to Equivalence.Unnamed ItemComplexity thresholds in inclusion logicA Logical Approach to Context-Specific IndependenceThe Expressive Power of k-ary Exclusion LogicCharacterizing Relative Frame Definability in Team Semantics via the Universal ModalityCounting of Teams in First-Order Team LogicsSOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATIONModel Checking and Validity in Propositional and Modal Inclusion LogicsCharacterizing counterfactuals and dependencies over (generalized) causal teamsINQUISITIVE BISIMULATIONOn Dependence LogicUnnamed ItemThe implication problem for functional dependencies and variants of marginal distribution equivalences



Cites Work