A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings (Q3710515): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 5 February 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
