Email this article A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains
- Authors: Morozov A.S.1
-
Affiliations:
- Sobolev Institute of Mathematics Novosibirsk State University
- Issue: Vol 59, No 3 (2018)
- Pages: 463-469
- Section: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171865
- DOI: https://doi.org/10.1134/S0037446618030096
- ID: 171865
Cite item
Open Access
Access granted
Subscription Access
Abstract
We construct a computably enumerable partial ordering having neither computably enumerable maximal chains nor computably enumerable maximal antichains.
Keywords
About the authors
A. S. Morozov
Sobolev Institute of Mathematics Novosibirsk State University
Author for correspondence.
Email: morozov@math.nsc.ru
Russian Federation, Novosibirsk
