Lexicographically ordered trees
暂无分享,去创建一个
Abstract We characterize trees whose lexicographic ordering produces an order isomorphic copy of some sets of real numbers, or an order isomorphic copy of some set of ordinal numbers. We characterize trees whose lexicographic ordering is order complete, and we investigate lexicographically ordered ω -splitting trees that, under the open-interval topology of their lexicographic orders, are of the first Baire category. Finally we collect together some folklore results about the relation between Aronszajn trees and Aronszajn lines, and use earlier results of the paper to deduce some topological properties of Aronszajn lines.
[1] D. Lutzer,et al. Branch space representations of lines , 2005 .
[2] R. Engelking,et al. Paracompactness in ordered spaces , 1977 .
[3] Kenneth Kunen,et al. Handbook of Set-Theoretic Topology , 1988 .
[4] David Lutzer,et al. Monotonically normal spaces , 1973 .
[5] T. Mackowiak. On decompositions of hereditarily smooth continua , 1977 .
[6] Stevo Todorcevic,et al. Trees and Linearly Ordered Sets , 1984 .