RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive
Sibirsk. Mat. Zh., 2018 Volume 59, Number 3, Pages 587–595 (Mi smj2996)
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.

UDC: 510.5

MSC: 35R30

Received: 14.04.2016

DOI: 10.17377/smzh.2018.59.309


 English version: Siberian Mathematical Journal, 2018, 59:3, 463–469

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025