Constructive models of regularly infinite algorithmic dimension
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(5)- Computable classes of constructivizations for models of infinite algorithmic dimension
- A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
- scientific article; zbMATH DE number 4212019 (Why is no real title available?)
- scientific article; zbMATH DE number 1302875 (Why is no real title available?)
- scientific article; zbMATH DE number 749929 (Why is no real title available?)
This page was built for publication: Constructive models of regularly infinite algorithmic dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1842380)