On the complexity of the successivity relation in computable linear orderings (Q3094355)
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: On the complexity of the successivity relation in computable linear orderings |
scientific article; zbMATH DE number 5962795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the successivity relation in computable linear orderings |
scientific article; zbMATH DE number 5962795 |
Statements
ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS (English)
0 references
24 October 2011
0 references
computable linear ordering
0 references
successivity
0 references
spectra of relations
0 references
0.878265380859375
0 references
0.8759761452674866
0 references
0.846477210521698
0 references
0.84580397605896
0 references
0.7976664304733276
0 references
