A computably enumerable partial ordering without computably enumerable maximal chains and antichains (Q1673673)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A computably enumerable partial ordering without computably enumerable maximal chains and antichains |
scientific article; zbMATH DE number 6935974
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computably enumerable partial ordering without computably enumerable maximal chains and antichains |
scientific article; zbMATH DE number 6935974 |
Statements
A computably enumerable partial ordering without computably enumerable maximal chains and antichains (English)
0 references
13 September 2018
0 references
computable order
0 references
computably enumerable order
0 references
chain
0 references
antichain
0 references
0.9183373
0 references
0 references
0.8680599
0 references
0.8660591
0 references
0.86179537
0 references
0.8588748
0 references
0.85863626
0 references
0.85753715
0 references
0.85657114
0 references
