A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains
- 作者: Morozov A.1
-
隶属关系:
- Sobolev Institute of Mathematics Novosibirsk State University
- 期: 卷 59, 编号 3 (2018)
- 页面: 463-469
- 栏目: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171865
- DOI: https://doi.org/10.1134/S0037446618030096
- ID: 171865
如何引用文章
详细
We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.
作者简介
A. Morozov
Sobolev Institute of Mathematics Novosibirsk State University
编辑信件的主要联系方式.
Email: morozov@math.nsc.ru
俄罗斯联邦, Novosibirsk