- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On non‐determined ehrenfeucht‐fraïssé games and unstable theories
Mathematical Logic Quarterly 38 (1):399-408 (1992)
Abstract
In this paper we prove under some set theoretical assumptions that if T is a countable unstable theory then there is a pair of models of T such that Ehrenfeucht-Fraïssé games between these models of large variety of lengths are non-determinedMy notes
Similar books and articles
On potential isomorphism and non-structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
Ehrenfeucht-Fraïssé games without identity.Alasdair Urquhart - 2021 - Australasian Journal of Logic 18 (1):25-28.
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.
Locality and modular Ehrenfeucht–Fraïssé games.Achim Blumensath - 2012 - Journal of Applied Logic 10 (1):144-162.
Positional strategies in long ehrenfeucht–fraïssé games.S. Shelah, J. Väänänen & B. Veličković - 2015 - Journal of Symbolic Logic 80 (1):285-300.
Constructing strongly equivalent nonisomorphic models for unsuperstable theories, Part A.Tapani Hyttinen & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (3):984-996.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Analytics
Added to PP
2013-12-01
Downloads
22 (#979,103)
6 months
3 (#1,480,774)
2013-12-01
Downloads
22 (#979,103)
6 months
3 (#1,480,774)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-2w72m uwo