|Title:||Trees and ehrenfeucht-fraïssé games||Journal:||Annals of Pure and Applied Logic||Volume:||100||Issue:||1-3||First page:||69||Last page:||97||Issue Date:||15-Oct-1999||Rank:||M22||ISSN:||0168-0072||DOI:||10.1016/S0168-0072(98)00064-5||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.
Show full item record
checked on Jan 30, 2023
checked on Jan 31, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.