Categoricity and complexity of relations over algebraic structures

DOI10.1007/S10469-015-9361-6zbMath1361.03034OpenAlexW2339560954MaRDI QIDQ5965135

Jamalbek Tussupov

Publication date: 2 March 2016

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

Full work available at URL: https://doi.org/10.1007/s10469-015-9361-6

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)

Cites Work

• Isomorphisms and algorithmic properties of structures with two equivalences
• Generic copies of countable structures
• Autostability and computable families of constructivizations
• Degree spectra and computable dimensions in algebraic structures
• Categoricity in hyperarithmetical degrees
• Enumerations in computable structure theory
• Intrinsic bounds on complexity and definability at limit levels
• Stability of nilpotent groups of class 2 and prime exponent
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Effective model theory vs. recursive model theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Categoricity and complexity of relations over algebraic structures