scientific article; zbMATH DE number 7447734
From MaRDI portal
Publication:3384878
Recommendations
- Safe dependency atoms and possibility operators in team semantics
- Probabilistic team semantics
- Team semantics for the specification and verification of hyperproperties
- Approximation and dependence via multiteam semantics
- Approximation and dependence via multiteam semantics
- Upwards closed dependencies in team semantics
- Upwards closed dependencies in team semantics
- Compositionality of safe communication in systems of team automata
- Separation logic and logics with team semantics
- Decidability of predicate logics with team semantics
Cites work
- A double team semantics for generalized quantifiers
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
- Compositional semantics for a language of imperfect information
- Dependence and independence
- Dependence logic. A new approach to independence friendly logic
- Epistemic operators in dependence logic
- Expressivity and Complexity of Dependence Logic
- Generalized quantifiers in dependence logic
- Hierarchies in Dependence Logic
- Hierarchies in independence logic
- scientific article; zbMATH DE number 4118333 (Why is no real title available?)
- scientific article; zbMATH DE number 972408 (Why is no real title available?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Independence in database relations
- On strongly first-order dependencies
- On the complexity of team logic and its two-variable fragment
- Proceedings of the fourth international symposium on games, automata, logics and formal verification, GandALF 2013, Borca di Cadore, Dolomites, Italy, August 29--31, 2013
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- Team logic
- Team Logic and Second-Order Logic
Cited in
(6)- Safe dependency atoms and possibility operators in team semantics
- Compositionality of safe communication in systems of team automata
- Characterizing strongly first order dependencies: the non-jumping relativizable case
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- The flattening operator in team-based logics
- Upwards closed dependencies in team semantics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384878)