- 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 Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
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é class game.Wafik Boulos Lotfallah - 2004 - Mathematical Logic Quarterly 50 (2):179-188.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Comparing the power of games on graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
Review: Solomon Feferman, Some Recent Work of Ehrenfeucht and Fraisse. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):282-282.
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
Review: A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories. [REVIEW]Erwin Engeler - 1967 - Journal of Symbolic Logic 32 (2):281-282.
Ehrenfeucht games and ordinal addition.Françoise Maurin - 1997 - Annals of Pure and Applied Logic 89 (1):53-73.
On winning Ehrenfeucht games and monadic NP.Thomas Schwentick - 1996 - Annals of Pure and Applied Logic 79 (1):61-92.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Vectorization hierarchies of some graph quantifiers.Lauri Hella & Juha Nurmonen - 2000 - Archive for Mathematical Logic 39 (3):183-207.
Analytics
Added to PP
2013-12-01
Downloads
17 (#849,202)
6 months
4 (#800,606)
2013-12-01
Downloads
17 (#849,202)
6 months
4 (#800,606)
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-7c76586df8-5tf24 uwo