Constructive models of regularly infinite algorithmic dimension (Q1842380)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructive models of regularly infinite algorithmic dimension |
scientific article; zbMATH DE number 745963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructive models of regularly infinite algorithmic dimension |
scientific article; zbMATH DE number 745963 |
Statements
Constructive models of regularly infinite algorithmic dimension (English)
0 references
17 May 1995
0 references
In papers of \textit{S. S. Goncharov} [Algebra Logika 19, 23-44 (1980; Zbl 0468.03022)] and of \textit{S. S. Goncharov} and \textit{V. D. Dzgoev} [ibid. 19, 45-58 (1980; Zbl 0468.03023)], the classes of unbounded and branching models are defined and their algorithmic dimensions are proved to be equal to \(\omega\). Here, the author defines a class of models of infinite algorithmic dimension which includes the classes mentioned above.
0 references
constructivization
0 references
unbounded model
0 references
computable class of constructivizations
0 references
branching models
0 references
infinite algorithmic dimension
0 references
