A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains

Сибирский математический журнал

A. S. Morozov¹ 

[1] Sobolev Institute of Mathematics Novosibirsk State University

关键词: computable order;    computably enumerable order;    chain;    antichain;   

DOI  :  10.1134/S0037446618030096

学科分类：数学（综合）

来源: Izdatel stvo Instituta Matematiki Rossiiskoi Akademii Nauk

【 摘 要 】

We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.

【 授权许可】

CC BY