Club-guessing and non-structure of trees

@article{TapaniHyttinen2001,
abstract = {We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.},
author = {Tapani Hyttinen},
journal = {Fundamenta Mathematicae},
keywords = {trees; non-structure; club-guessing sequence},
language = {eng},
number = {3},
pages = {237-249},
title = {Club-guessing and non-structure of trees},
url = {http://eudml.org/doc/282578},
volume = {168},
year = {2001},
}

TY - JOUR
AU - Tapani Hyttinen
TI - Club-guessing and non-structure of trees
JO - Fundamenta Mathematicae
PY - 2001
VL - 168
IS - 3
SP - 237
EP - 249
AB - We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.
LA - eng
KW - trees; non-structure; club-guessing sequence
UR - http://eudml.org/doc/282578
ER -