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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	463-469
Number of pages	7
Journal	Siberian Mathematical Journal
Volume	59
Issue number	3
DOIs	https://doi.org/10.1134/S0037446618030096
Publication status	Published - 1 May 2018

ID: 14317996