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

Research output: Contribution to journalArticlepeer-review

Abstract

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

Original languageEnglish
Pages (from-to)463-469
Number of pages7
JournalSiberian Mathematical Journal
Volume59
Issue number3
DOIs
Publication statusPublished - 1 May 2018

Keywords

  • antichain
  • chain
  • computable order
  • computably enumerable order

Fingerprint

Dive into the research topics of 'A Computably Enumerable Partial Ordering Without Computably Enumerable Maximal Chains and Antichains'. Together they form a unique fingerprint.

Cite this