On definability in dependence logic
From MaRDI portal
Publication:735407
DOI10.1007/S10849-009-9082-0zbMATH Open1182.03063OpenAlexW2007760364MaRDI QIDQ735407FDOQ735407
Authors: Juha Kontinen, Jouko Väänänen 
Publication date: 21 October 2009
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10849-009-9082-0
Recommendations
Cites Work
- Dependence logic. A new approach to independence friendly logic
- Compositional semantics for a language of imperfect information
- Finite partially-ordered quantification
- Title not available (Why is that?)
- Some combinatorics of imperfect information
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (50)
- Expressivity and Complexity of Dependence Logic
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- Dependence logic. A new approach to independence friendly logic
- Dependence and independence
- Propositional logics of dependence
- Counting of Teams in First-Order Team Logics
- Games for inclusion logic and fixed-point logic
- Compactness in team semantics
- Characterizing quantifier extensions of dependence logic
- Definable deduction relation
- Propositional union closed team logics
- Separation logic and logics with team semantics
- Characterizing downwards closed, strongly first-order, relativizable dependencies
- Dependence logic with a majority quantifier
- Dependence logic in pregeometries and \(\omega\)-stable theories
- Model-checking games for logics of imperfect information
- Dependence logic with generalized quantifiers: axiomatizations
- Dependency Concepts up to Equivalence.
- Uniform definability in propositional dependence logic
- The expressive power of \(k\)-ary exclusion logic
- Title not available (Why is that?)
- Parameterized complexity of weighted team definability
- Title not available (Why is that?)
- Epistemic operators in dependence logic
- General models and entailment semantics for independence logic
- Expressing second-order sentences in intuitionistic dependence logic
- The expressive power of \(k\)-ary exclusion logic
- Dependence and Independence in Social Choice: Arrow’s Theorem
- Modified numerals and split disjunction: the first-order case
- A remark on negation in dependence logic
- Enumerating teams in first-order team logics
- On definability of team relations with \(k\)-invariant atoms
- On the Presburger fragment of logics with multiteam semantics
- Transition semantics: the dynamics of dependence logic
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Deciding whether a relation defined in Presburger logic can be defined in weaker logics
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
- Team Logic and Second-Order Logic
- Erratum to: ``On definability in dependence logic
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals
- Editorial introduction to the special issue: Dependence and independence in logic
- Expressivity of imperfect information logics without identity
- Coherence and computational complexity of quantifier-free dependence logic formulas
- Generalized quantifiers in dependence logic
- On dependence logic
- Alternating (in)dependence-friendly logic
- Coherence in inquisitive first-order logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Dynamic logics of imperfect information: from teams and games to transitions
- Negation and partial axiomatizations of dependence and independence logic revisited
This page was built for publication: On definability in dependence logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735407)
