On recursively enumerable structures

DOI10.1016/0168-0072(94)00050-6zbMath0856.03036OpenAlexW2030965397MaRDI QIDQ1919770

Victor L. Selivanov

Publication date: 11 February 1997

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)00050-6

zbMATH Keywords

decision problemsquasivarietiesindex setsacceptable numerationsfree countable structuresuniversal r.e. structures

Mathematics Subject Classification ID

Quasivarieties (08C15) Theory of numerations, effectively presented structures (03D45)

Related Items

NOTES ON THE DPRM PROPERTY FOR LISTABLE STRUCTURES ⋮ Precomplete numberings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchies of hyperarithmetical sets and functions
• Algorithmic complexity of algebraic systems
• Index sets of quotient objects of the Post numeration
• Semantically universal classes of models
• Recursively enumerable many-one degrees
• Fine hierarchy and definable index sets
• The metamathematics of algebraic systems. Collected papers: 1936-1967. Translated, edited, and provided with supplementary notes by Benjamin Franklin Wells III
• Recursively enumerable vector spaces
• Computable Algebra, General Theory and Theory of Computable Fields