Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (Q4596667)
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: Corrigendum: "On the complexity of the successivity relation in computable linear orderings" |
scientific article; zbMATH DE number 6815217
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corrigendum: "On the complexity of the successivity relation in computable linear orderings" |
scientific article; zbMATH DE number 6815217 |
Statements
Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (English)
0 references
4 December 2017
0 references
