Related papers: Complete Conditional Type Structures
At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…
In this paper, we introduce a large class of (so-called) conditional indicators, on a complete probability space with respect to a sub $\sigma$-algebra. A conditional indicator is a positive mapping, which is not necessary linear, but may…
Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…
We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…
Traditional economic models typically treat private information, or signals, as generated from some underlying state. Recent work has explicated alternative models, where signals correspond to interpretations of available information. We…
We propose a game-theoretic framework that incorporates both incomplete information and general ambiguity attitudes on factors external to all players. Our starting point is players' preferences on payoff-distribution vectors, essentially…
We study Lindstrom quantifiers that satisfy certain closure properties which are motivated by the study of polymorphisms in the context of constraint satisfaction problems (CSP). When the algebra of polymorphisms of a finite structure B…
A natural way to represent beliefs and the process of updating beliefs is presented by Bayesian probability theory, where belief of an agent a in P can be interpreted as a considering that P is more probable than not P. This paper attempts…
This paper builds fundamental perfect fields of positive characteristic and shows the structure of perfect fields that a field of positive characteristic is a perfect field if and only if it is an algebraic extension of a fundamental…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty is represented using LPSs (lexicographic probability…
Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial parameters of structures. In this paper, we develop a framework whereby the…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
This paper focuses on finite-player incomplete information games where players may hold mutually inconsistent beliefs without a common prior. We introduce absolute continuity of beliefs, extending the classical notion of absolutely…
While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…
This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…
We prove completeness results for a wide variety of intuitionistic conditional logics. We do so by first using a canonical model construction obtain completeness with respect to descriptive conditional frames, and then introducing the…