Computable classes of constructivizations for models of infinite algorithmic dimension (Q1346928)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 738974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computable classes of constructivizations for models of infinite algorithmic dimension |
scientific article; zbMATH DE number 738974 |
Statements
Computable classes of constructivizations for models of infinite algorithmic dimension (English)
0 references
20 April 1995
0 references
The author gives a positive answer to the problem, posed by S. S. Goncharov, whether there exists a constructivizable model of infinite algorithmic dimension \((\omega)\) and which has no computable classes containing \(\omega\) non-autoequivalent constructivizations. It should be noted that, as proved recently by \textit{O. V. Kudinov} (in the paper ``Some properties of autostable models'', submitted to Algebra Logika), the result of the author in Algebra Logika 26, No. 6, 684-714 (1987; Zbl 0659.03011) is false, and the given paper relies upon it.
0 references
constructivization
0 references
branching model
0 references
unbounded model
0 references
computable class of constructivizations
0 references
autostable model
0 references
recursively categorical model
0 references
constructivizable model
0 references
infinite algorithmic dimension
0 references
0.860369861125946
0 references
0.860369861125946
0 references
0.851300835609436
0 references
