|
A computably enumerable partial ordering without computably enumerable maximal chains and antichains
A. S. Morozovab a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.
Keywords:
computable order, computably enumerable order, chain, antichain.
Received: 14.04.2016
Citation:
A. S. Morozov, “A computably enumerable partial ordering without computably enumerable maximal chains and antichains”, Sibirsk. Mat. Zh., 59:3 (2018), 587–595; Siberian Math. J., 59:3 (2018), 463–469
Linking options:
https://www.mathnet.ru/eng/smj2996 https://www.mathnet.ru/eng/smj/v59/i3/p587
|
Statistics & downloads: |
Abstract page: | 237 | Full-text PDF : | 72 | References: | 37 | First page: | 5 |
|