Ehrenfeucht-fraïssé games on a class of scattered linear orders

Journal of Symbolic Logic 85 (1):37-60 (2020)
  Copy   BIBTEX

Abstract

Two structures A and B are n-equivalent if Player II has a winning strategy in the n-move Ehrenfeucht-Fraïssé game on A and B. In earlier articles we studied n-equivalence classes of ordinals and coloured ordinals. In this article we similarly treat a class of scattered order-types, focussing on monomials and sums of monomials in ω and its reverse ω*.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,296

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Ehrenfeucht–Fraïssé games on ordinals.F. Mwesigye & J. K. Truss - 2018 - Annals of Pure and Applied Logic 169 (7):616-636.
An Ehrenfeucht‐Fraïssé class game.Wafik Boulos Lotfallah - 2004 - Mathematical Logic Quarterly 50 (2):179-188.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
An Ehrenfeucht-Fraisse class game.Wafik Lotfallah - 2004 - Mathematical Logic Quarterly 50 (2):179-188.

Analytics

Added to PP
2019-12-11

Downloads
19 (#825,863)

6 months
15 (#185,276)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references