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,349

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

Almost free groups and long Ehrenfeucht–Fraı̈ssé games.Pauli Väisänen - 2003 - Annals of Pure and Applied Logic 123 (1-3):101-134.
Almost free groups and Ehrenfeucht–Fraı̈ssé games for successors of singular cardinals.Saharon Shelah & Pauli Väisänen - 2002 - Annals of Pure and Applied Logic 118 (1-2):147-173.
On non‐determined ehrenfeucht‐fraïssé games and unstable theories.Tapani Hyttinen & T. Hyttinen - 1992 - Mathematical Logic Quarterly 38 (1):399-408.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
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: Stevo Todorcevic, Trees, Subtrees and Order Types; Stevo Todorcevic, Aronszajn Trees and Partitions. [REVIEW]Dan Velleman - 1989 - Journal of Symbolic Logic 54 (2):638-639.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Games and trees in infinitary logic: A survey.Jouko Väänänen - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 105--138.
On Ehrenfeucht-fraïssé equivalence of linear orderings.Juha Oikkonen - 1990 - Journal of Symbolic Logic 55 (1):65-73.
Chain models, trees of singular cardinality and dynamic ef-games.Mirna Džamonja & Jouko Väänänen - 2011 - Journal of Mathematical Logic 11 (1):61-85.
An Ehrenfeucht‐Fraïssé game for Lω1ω.Jouko Väänänen & Tong Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):357-370.
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.
Computational complexity of logical theories of one successor and another unary function.Pascal Michel - 2007 - Archive for Mathematical Logic 46 (2):123-148.

Analytics

Added to PP
2014-01-16

Downloads
30 (#519,519)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

Citations of this work

-Definability at uncountable regular cardinals.Philipp Lücke - 2012 - Journal of Symbolic Logic 77 (3):1011-1046.
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