Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (Q4596667): Difference between revisions
From MaRDI portal
Latest revision as of 10:32, 30 July 2024
scientific article; zbMATH DE number 6815217
Language | Label | Description | Also known as |
---|---|---|---|
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