Constructive models of regularly infinite algorithmic dimension

DOI10.1007/BF00739993zbMath0832.03022OpenAlexW1999956186MaRDI QIDQ1842380

Yu. G. Ventsov

Publication date: 17 May 1995

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

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

zbMATH Keywords

branching modelsconstructivizationcomputable class of constructivizationsinfinite algorithmic dimensionunbounded model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Unnamed Item
• Autostability of models
• Computable classes of constructivizations for models of infinite algorithmic dimension

This page was built for publication: Constructive models of regularly infinite algorithmic dimension