Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (Q4596667): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1142/s0219061317920027 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2734597511 / rank | |||
Normal rank |
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