TL;DR: In this article, Henkin made the observation that certain second-order existential formulas may be thought of as the Skolem normal forms of formulas of a language which is first-order in every respect except its incorporation of a form of partially-ordered quantification.
Abstract: In [3] Henkin made the observation that certain second-order existential formulas may be thought of as the Skolem normal forms of formulas of a language which is first-order in every respect except its incorporation of a form of partially-ordered quantification. One formulation of this sort of language is the closure of a first-order language under the formation rule that Qφ is a formula whenever φ is a formula and Q, which is to be thought of as a quantifier-prefix, is a system of partial order whose universe is a set of quantifiers. Although he introduced this idea in a discussion of infinitary logic, Henkin went on to discuss its application to finitary languages, and he concluded his discussion with a theorem of Ehrenfeucht that the incorporation of an extremely simple partially-ordered quantifier-prefix (the quantifiers ∀x, ∀y, ∃v, and ∃w, with the ordering {〈∀x, ∃v〉, 〈∀y, ∃w〉}) into any first-order language with identity gives a language capable of expressing the infinitary quantifier ∃zκ0x.
TL;DR: A modal language which involves the concept of dependence is introduced and two game-theoretic definitions for the semantics of the language, and one inductive, are given, and the equivalence of all three is proved.
Abstract: We introduce a modal language which involves the concept of dependence. We give two game-theoretic definitions for the semantics of the language, and one inductive, and prove the equivalence of all three.
TL;DR: In this paper, the authors give an overview of dependence and independence logic and discuss conditional independence atoms and prove that conditional and non-conditional independence logic are equivalent, and briefly discuss an application of their logics to belief representation.
Abstract: We give an overview of some developments in dependence and independence logic. This is a tiny selection, intended for a newcomer, from a rapidly growing literature on the topic. Furthermore, we discuss conditional independence atoms and we prove that conditional and non-conditional independence logic are equivalent. Finally, we briefly discuss an application of our logics to belief representation.
TL;DR: In this article, Glazer and Rubenstein present a game theoretic approach to the Pragmatic of Persuasion: a game Theoretical approach for infinite multiplayer games.
Abstract: 9789089640574 - 2[-] Table of Contents - 6[-] Preface - 8[-] The Logic of Conditional Doxastic Actions - 10[-] Comments on 'The Logic of Conditional Doxastic Actions' - 34[-] Belief Revision in a Temporal Framework - 46[-] Yet more Modal Logic of Preference Change and Belief Revision - 82[-] Meaningful Talk - 106[-] A Study in the Pragmatic of Persuasion: a Game Theoretical Approach - 122[-] On Glazer and Rubenstein on Persuasion - 142[-] Solution Concepts and Algorithms for Infinite Multiplayer Games - 152[-] Games in Language - 180[-] 'Games That Make Sense': Logic, Language and Multi-Agent Interaction - 198[-] Solution of Church's Problem: A Tutorial - 212[-] Modal Dependence Logic - 238[-] Declarations of Dependence - 256[-] Backward Induction and Common Strong Belief of Rationality - 266[-] Efficient Coalitions in Boolean Games - 284[-] Interpretation if Optimal Signals[-] - 300[-] A Criterion for the Existence of Pure and Stationary Optimal Strategies in Markov Decision Processes[-] - 314
TL;DR: In this article, the authors studied extensions and variants of dependence logic on the first-order, propositional and modal level, and obtained, among others, the following results: • First-order dependence logic extended with intuitionistic and linear connectives characterizes all second-order downwards monotone properties.
Abstract: Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following results: • First-order dependence logic extended with intuitionistic and linear connectives characterizes all second-order downwards monotone properties. • First-order independence logic extended with intuitionistic and linear connectives, and first-order inclusion logic extended with maximal implication are both equivalent to the full second-order logic over sentences. • Complete axiomatizations for propositional dependence logic, propositional intuitionistic dependence logic, propositional independence logic extended with nonempty atom. • Intuitionistic connectives are definable, but not uniformly definable in propositional dependence logic. • Modal intuitionistic dependence logic has a connection with modal intuitionistic logic. • Model checking problem for modal intuitionistic dependence logic is PSPACEcomplete.