Related papers: EF equivalent not isomorphic models

We provide a deterministic-control-based interpretation for a broad class of fully nonlinear parabolic and elliptic PDEs with continuous Neumann boundary conditions in a smooth domain. We construct families of two-person games depending on…

We introduce a nonconvex Mean Field Games system by studying a model with a large number of identical pairs of players who are all rational, and each pair plays an identical zero-sum differential game. We study existence and uniqueness of…

We develop an algebraic and operational framework for quantum isomorphisms of hypergraphs, using tools from compact quantum group theory. We introduce a new synchronous version of the hypergraph isomorphism game whose game algebra uniformly…

Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…

Mean Field Game (MFG) models implicitly assume "rational expectations", meaning that the heterogeneous agents being modeled correctly know all relevant transition probabilities for the complex system they inhabit. When there is common…

Relying on recent generalizations of the Fra\"iss\'e theory to a broader category-theoretic context, we study the class of abstract finite games played between two players and show the existence of an infinitetly countable game which is…

J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal…

We classify certain sofic shifts (the irreducible Point Extension Type, or PET, sofic shifts) up to flow equivalence, using invariants of the canonical Fischer cover. There are two main ingredients: (1) An extension theorem, for extending…

In game theory, the notion of a player's beliefs about the game players' beliefs about other players' beliefs arises naturally. In this paper, we present a non-self-referential paradox in epistemic game theory which shows that completely…

We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…

We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are…

We study the spectrum of limit models assuming the existence of a nicely behaved independence notion. Under reasonable assumptions, we show that all `long' limit models are isomorphic, and all `short' limit models are non-isomorphic.…

Let $M$ be a finite von Neumann algebra. In the first part, we give asymptotic results about $M$-stable sequences of weak*-continuous mappings which are related with operators belonging to $M$. In the second part, we extend, by a shorter…

The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…

Let $E$ be a complete uniform topological algebra with Arens-Michael normed factors $\left(E_{\alpha}\right)_{\alpha\in\Lambda}.$ Then $M\left(E\right) \cong \varprojlim M\left(E_{\alpha}\right)$ within an algebra isomorphism $\varphi$. If…

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…

We propose an extension of the Ehrenfeucht-Fraisse game able to deal with logics augmented with Lindstrom quantifiers. We describe three different games with varying balance between simplicity and ease of use.

In this paper we study the operator inequality \phi(X)\leq X and the operator equation \phi(X)= X, where \phi is a w^*-continuous positive (resp. completely positive) linear map on B(H). We show that their solutions are in one-to-one…