A Classification of Countable Lower 1-transitive Linear Orders
A Classification of Countable Lower 1-transitive Linear Orders
复制标题
可数低1传递线性阶的分类
DOI:
10.1007/s11083-017-9427-2
复制
发表时间:
2017
期刊:
影响因子:
0.4
通讯作者:
Barbina S
中科院分区:
文献类型:
--
作者:
Barbina S
This paper contains a classification of countable lower 1-transitive linear orders. This is the first step in the classification of countable 1-transitive trees given in Chicot and Truss (2009): the notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and it is essential for the structure theory of 1-transitive trees. The classification is given in terms ofcoding trees, which describe how a linear order is fabricated from simpler pieces using concatenations, lexicographic products and other kinds of construction. We define coding trees and show that a coding tree can be constructed from a lower 1-transitive linear orderby examining all the invariant partitions onX. Then we show that a lower 1-transitive linear order can be recovered from a coding tree up to isomorphism.
登录
查看更多内容
影响因子:
0.6
作者:
G. Campero;J. Truss
通讯作者:
J. Truss
影响因子:
1.8
作者:
M. Droste;W. Holland;H. D. Macpherson
通讯作者:
H. D. Macpherson
DOI:
10.1007/978-3-319-51718-6_11
发表时间:
2017
期刊:
Ann. Pure Appl. Log.
影响因子:
--
作者:
Katie Chicot;J. Truss
通讯作者:
J. Truss
影响因子:
1.9
作者:
M. Droste
通讯作者:
M. Droste