首页> 外文期刊>Journal of mathematical logic >Decomposing Aronszajn lines
【24h】

Decomposing Aronszajn lines

机译:Decomposing Aronszajn lines

获取原文
获取原文并翻译 | 示例
           

摘要

We show that under the proper forcing axiom the class of all Aronszajn lines behave like sigma-scattered orders under the embeddability relation. In particular, we are able to show that the class of better-quasi-order labeled fragmented Aronszajn lines is itself a better-quasi-order. Moreover, we show that every better-quasi-order labeled Aronszajn line can be expressed as a finite sum of labeled types which are algebraically indecomposable. By encoding lines with finite labeled trees, we are also able to deduce a decomposition result, that for every Aronszajn line L there is an integer n such that for any finite coloring of L there is subset L' of L isomorphic to L which uses no more than n colors.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号