Isomorphisms and algorithmic properties of structures with two equivalences
From MaRDI portal
Publication:321265
DOI10.1007/S10469-016-9375-8zbMath1420.03107OpenAlexW2395023523MaRDI QIDQ321265
Publication date: 13 October 2016
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-016-9375-8
isomorphismscomputable structuresarithmetic and hyperarithmetic hierarchiesdefinable relationsScott family
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35) Hierarchies of computability and definability (03D55)
Related Items (5)
Index set of structures with two equivalence relations that are autostable relative to strong constructivizations ⋮ On the effective universality of mereological theories ⋮ HKSS-completeness of modal algebras ⋮ Categoricity spectra of computable structures ⋮ Categoricity and complexity of relations over algebraic structures
Cites Work
This page was built for publication: Isomorphisms and algorithmic properties of structures with two equivalences