A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings (Q3710515): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2274189 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2002729262 / rank | |||
Normal rank | |||
Latest revision as of 23:25, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings |
scientific article |
Statements
A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings (English)
0 references
1984
0 references
infinite subsequences
0 references
infinite recursive linearly ordered set
0 references
counterexamples
0 references
order types
0 references
effective translation
0 references
infinite injury priority argument
0 references
