Trees and Ehrenfeucht–Fraı̈ssé games

&
Annals of Pure and Applied Logic 100 (1-3):69-97 (1999)
  Copy   BIBTEX

Abstract

Trees are natural generalizations of ordinals and this is especially apparent when one tries to find an uncountable analogue of the concept of the Scott-rank of a countable structure. The purpose of this paper is to introduce new methods in the study of an ordering between trees whose analogue is the usual ordering between ordinals. For example, one of the methods is the tree-analogue of the successor operation on the ordinals.

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(98)00064-5

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

My notes

Similar books and articles

Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Games on Trees and Syntactical Complexity of Formulas.Michał Krynicki & Jose Maria Turull Torres - 2007 - Logic Journal of the IGPL 15 (5-6):653-687.
On non‐determined ehrenfeucht‐fraïssé games and unstable theories.Tapani Hyttinen & T. Hyttinen - 1992 - Mathematical Logic Quarterly 38 (1):399-408.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Trees and Π 1 1 -Subsets of ω1 ω 1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052 - 1070.
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.
Trees and $Pi^11$-Subsets of $^{omega_1}omega1$.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
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.
Computable trees of Scott rank ω 1CK, and computable approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283-298.
On potential isomorphism and non-structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.

Analytics

Added to PP
2017-02-19

Downloads
25 (#618,847)

6 months
9 (#295,075)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

Citations of this work

Large cardinals and definable well-orders, without the GCH.Sy-David Friedman & Philipp Lücke - 2015 - Annals of Pure and Applied Logic 166 (3):306-324.
Universality for Orders and Graphs Which Omit Large Substructures.Katherine Thompson - 2006 - Notre Dame Journal of Formal Logic 47 (2):233-248.
Stationary sets and infinitary logic.Saharon Shelah & Jouko Väänänen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.

Add more citations

References found in this work

No references found.

Add more references