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

Links

PhilArchive



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

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

Analytics

Added to PP
2014-01-16

Downloads
31 (#533,234)

6 months
8 (#415,230)

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