Computable classes of constructivizations for models of infinite algorithmic dimension

DOI10.1007/BF00739415MaRDI QIDQ1346928zbMATH OpenFDO

Authors Yu. G. Ventsov

Publication date 20 April 1995

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00739415

zbMATH Keywords

autostable modelbranching modelcomputable class of constructivizationsconstructivizable modelconstructivizationinfinite algorithmic dimensionrecursively categorical modelunbounded model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 804044
• Constructive models of regularly infinite algorithmic dimension
• Effectively infinite classes of weak constructivizations of models
• scientific article; zbMATH DE number 1534360
• Computable classes of constructive models with non-limit-equivalent indexations

Cites work

• Autostability of models
• Equationally compact distributive lattices
• scientific article; zbMATH DE number 4101161 (Why is no real title available?)
• Nonuniform autostability of models

Cited in

(10)

• Computable classes of constructivizations for models of finite constructivizability type
• A solution of the Goncharov-Ash problem and the spectrum problem in the theory of computable models.
• Constructive models of regularly infinite algorithmic dimension
• Computability and universal determinability of negatively representable models
• scientific article; zbMATH DE number 4217338 (Why is no real title available?)
• The Complexity of Infinite Computations In Models of Set Theory
• scientific article; zbMATH DE number 4164817 (Why is no real title available?)
• scientific article; zbMATH DE number 4093434 (Why is no real title available?)
• scientific article; zbMATH DE number 1534360 (Why is no real title available?)
• scientific article; zbMATH DE number 804044 (Why is no real title available?)

This page was built for publication: Computable classes of constructivizations for models of infinite algorithmic dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346928)