2000 character limit reached
Ehrenfeucht-Fraïssé Games for Continuous First-Order Logic
Published 26 Feb 2024 in math.LO | (2402.16662v2)
Abstract: 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 elementarily equivalent up to quantifier rank $n$. We then demonstrate the usefulness of the game with some examples. Finally, we discus connections between the game of length $\omega$ and infinitary logic.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.