Trees and Ehrenfeucht–Fraı̈ssé games

Stevo Todorčević, Jouko Väänänen
<span title="">1999</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bnojym2hjzcgnpa4wixi2axhnq" style="color: black;">Annals of Pure and Applied Logic</a> </i> &nbsp;
Trees are natural generalizations of ordinals and this is especially apparent when one tries to ÿnd 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0168-0072(98)00064-5">doi:10.1016/s0168-0072(98)00064-5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6bva7mizgnhqnm6g5zexsh2n6a">fatcat:6bva7mizgnhqnm6g5zexsh2n6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217233506/https://core.ac.uk/download/pdf/82259859.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/04/21/04218d5b0b690b3b62074f760719a8a5c0f0b658.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0168-0072(98)00064-5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>