Effective choice for relations and reducibilities in classes of constructive and positive models

DOI10.1007/BF02259853zbMath0814.03030MaRDI QIDQ1317601

Yu. G. Ventsov

Publication date: 12 April 1994

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

Full work available at URL: https://eudml.org/doc/187601

zbMATH Keywords

autostable modelconstructivizable modeleffective choice problemsintrinsically recursively enumerable relationpositive models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

A robuster Scott rank ⋮ COMPUTABLE POLISH GROUP ACTIONS ⋮ On the complexity of the theory of a computably presented metric structure ⋮ On decidable categoricity and almost prime models ⋮ Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey ⋮ Categoricity properties for computable algebraic fields ⋮ Relativizing computable categoricity

Cites Work

• Autostability of models
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Unnamed Item
• Unnamed Item