English
Related papers

Related papers: EF equivalent not isomorphic models

200 papers

Ehrenfeucht-Fra\"iss\'e (EF) games are a basic tool in finite model theory for proving definability lower bounds, with many applications in complexity theory and related areas. They have been applied to study various logics, giving insights…

Logic in Computer Science · Computer Science 2025-05-23 Gregoire Fournier , György Turán

We study the classification of omega_1-separable groups using Ehrenfeucht-Fraisse games and prove a strong classification result assuming PFA, and a strong non-structure theorem assuming diamond.

Logic · Mathematics 2008-02-03 Paul C. Eklof , Matthew Foreman , Saharon Shelah

A modeloid, a certain set of partial bijections, emerges from the idea to abstract from a structure to the set of its partial automorphisms. It comes with an operation, called the derivative, which is inspired by Ehrenfeucht-Fra\"iss\'e…

Logic in Computer Science · Computer Science 2022-12-12 Lucca Tiemens , Dana S. Scott , Christoph Benzmüller , Miroslav Benda

Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeucht-Fraisse (EF) games in two ways: first, MS games are…

Logic in Computer Science · Computer Science 2025-01-08 Marco Carmosino , Ronald Fagin , Neil Immerman , Phokion Kolaitis , Jonathan Lenchner , Rik Sengupta

Truth, consistency and elementary equivalence can all be characterised in terms of games, namely the so-called evaluation game, the model-existence game, and the Ehrenfeucht-Fraisse game. We point out the great affinity of these games to…

Logic · Mathematics 2023-03-23 Jouko Väänänen

We study multi-structural games, played on two sets $\mathcal{A}$ and $\mathcal{B}$ of structures. These games generalize Ehrenfeucht-Fra\"{i}ss\'{e} games. Whereas Ehrenfeucht-Fra\"{i}ss\'{e} games capture the quantifier rank of a…

Logic in Computer Science · Computer Science 2025-02-05 Ronald Fagin , Jonathan Lenchner , Kenneth W. Regan , Nikhil Vyas

Let $f: M \to M$ be a partially hyperbolic diffeomorphism with conformality on unstable manifolds. Consider a set of points with nondense forward orbit: $E(f, y) := \{ z\in M: y\notin \overline{\{f^k(z), k \in \mathbb{N}\}}\}$ for some $y…

Dynamical Systems · Mathematics 2013-11-22 Weisheng Wu

Despite considerable research on document spanners, little is known about the expressive power of generalized core spanners. In this paper, we use Ehrenfeucht-Fra\"iss\'e games to obtain general inexpressibility lemmas for the logic FC (a…

Logic in Computer Science · Computer Science 2023-06-29 Sam M. Thompson , Dominik D. Freydenberger

The authors show, by means of a finitary version square^{fin}_{lambda,D} of the combinatorial principle square^{b^*}_{lambda}, the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all…

Logic · Mathematics 2007-05-23 Juliette Kennedy , Saharon Shelah

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…

Logic · Mathematics 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

We construct a pair (E ,F), where E is a holomorphic vector bundle over a compact Riemann surface and F a holomorphic subbundle of E, such that both F and E/F admit holomorphic connections, but E does not.

Complex Variables · Mathematics 2015-10-30 Indranil Biswas , Viktoria Heu

While many types of non-measurable sets are never $(\alpha, \beta)$-winning in the sense of Schmidt's game, we show that this is not the case for certain Vitali sets. Our main theorems show that for certain values of $\alpha, \beta$ one can…

Logic · Mathematics 2026-01-05 James Atchley , Lior Fishman , Stephen Jackson , Daozheng Liu , Emily Yao

Recently, Boutonnet, Chifan, and Ioana proved that McDuff's examples of continuum many pairwise non-isomorphic separable II$_1$ factors are in fact pairwise non-elementarily equivalent. Their proof proceeded by showing that any ultrapowers…

Logic · Mathematics 2017-01-30 Isaac Goldbring , Bradd Hart , Henry Towsner

We introduce differential games for FO logic of graphs, a variant of Ehrenfeucht-Fra\"{i}ss\'e games in which the game is played on only one graph and the moves of both players restricted. We prove that, in a certain sense, these games are…

Logic in Computer Science · Computer Science 2020-07-23 Jakub Gajarský , Maximilian Gorsky , Stephan Kreutzer

Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to…

Logic in Computer Science · Computer Science 2014-11-04 Manfred Kufleitner , Jan Philipp Wächter

Recently, Boutonnet, Chifan, and Ioana proved that McDuff's family of continuum many pairwise nonisomorphic separable II$_1$ factors are in fact pairwise non-elementarily equivalent by proving that any ultrapowers of two distinct members of…

Logic · Mathematics 2016-02-05 Isaac Goldbring , Bradd Hart

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

Logic in Computer Science · Computer Science 2022-09-07 Kexu Wang , Xishun Zhao

We give an example of irrational vector $\pmb{\theta} \in \mathbb{R}^2$ such that the set $Bad_{\pmb{\theta}} := \{(\eta_1,\eta_2): \inf_{x\in\mathbb{N}} x^{\frac{1}{2}} \max_{i=1,2} \|x \theta_i-\eta_i\|>0\}$ is not absolutely winning with…

Number Theory · Mathematics 2018-08-22 Natalia Dyakova

We study the problem of computing an Extensive-Form Perfect Equilibrium (EFPE) in 2-player games. This equilibrium concept refines the Nash equilibrium requiring resilience w.r.t. a specific vanishing perturbation (representing mistakes of…

Computer Science and Game Theory · Computer Science 2016-11-16 Gabriele Farina , Nicola Gatti

We construct (\alpha ,\beta) and \alpha -winning sets in the sense of Schmidt's game, played on the support of certain measures (very friendly and awfully friendly measures) and show how to derive the Hausdorff dimension for some. In…

Number Theory · Mathematics 2010-11-11 Lior Fishman