Related papers: Alternating (In)Dependence-Friendly Logic
Hintikka and Sandu's independence-friendly (IF) logic is a conservative extension of first-order logic that allows one to consider semantic games with imperfect information. In the present article, we first show how several variants of the…
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. The properties of these logics and their relationships with other…
The dual or game-theoretical negation $\lnot$ of independence-friendly logic (IF) and dependence logic (D) exhibits an extreme degree of semantic indeterminacy in that for any pair of sentences $\phi$ and $\psi$ of IF/D, if $\phi$ and…
Ordinary first-order logic has the property that two formulas \phi and \psi have the same meaning in a structure if and only if the formula ``\phi iff \psi'' is true in the structure. We prove that independence-friendly logic does not have…
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Vaananen, and their compositional semantics due to Hodges. We show how Hodges' semantics can be seen as a special case of a general…
Intuitionistic dependence logic was introduced by Abramsky and Vaananen (2009) as a variant of dependence logic under a general construction of Hodges' (trump) team semantics. It was proven that there is a translation from intuitionistic…
We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of IF sentences; we give a syntactical criterion for deciding whether a sentence beginning with such prefix exists such that its…
Many important properties of multi-agent systems refer to the participants' ability to achieve a given goal, or to prevent the system from an undesirable event. Among intelligent agents, the goals are often of epistemic nature, i.e.,…
We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known…
We introduce a new semantical formalism for logics of imperfect information, based on Game Logic (and, in particular, on van Benthem, Ghosh and Lu's Concurrent Dynamic Game Logic). This new kind of semantics combines aspects from game…
A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential…
We introduce a variant of Dependence Logic in which truth is defined not in terms of existence of winning strategies for the Proponent (Eloise) in a semantic game, but in terms of lack of winning strategies for the Opponent (Abelard). We…
We examine the relationship between Dependence Logic and game logics. A variant of Dynamic Game Logic, called Transition Logic, is developed, and we show that its relationship with Dependence Logic is comparable to the one between…
We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor…
We study notions of fairness in decision-making systems when individuals have diverse preferences over the possible outcomes of the decisions. Our starting point is the seminal work of Dwork et al. which introduced a notion of individual…
We define a version of the Ehrenfeucht-Fra\"iss\'e game in the setting of metric model theory and continuous first-order logic and show that the second player having a winning strategy in a game of length $n$ exactly corresponds to being…
Ehrenfeucht-Fraisse games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht- Fraisse games to hybrid-dynamic…
We introduce incongruent normal form (INF), a structural representation for self-referential semantic sentences. An INF replaces a self-referential sentence with a finite family of non-self-referential sentences that are individually…
Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic…