Isomorphisms and algorithmic properties of structures with two equivalences

DOI10.1007/S10469-016-9375-8MaRDI QIDQ321265zbMATH OpenOpenAlexFDO

Authors D. A. Tusupov

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

zbMATH Keywords

isomorphismsarithmetic and hyperarithmetic hierarchiescomputable structuresdefinable relationsScott family

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 89183
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs
• Isomorphisms, definable relations, and Scott families of class 2 nilpotent groups
• Computable transformations of structures
• scientific article; zbMATH DE number 4124985

Cites work

• scientific article; zbMATH DE number 3314372 (Why is no real title available?)
• Computable structures and the hyperarithmetical hierarchy
• Enumerations in computable structure theory
• Isomorphisms and definable relations on computable models

Cited in

(5)

• Categoricity and complexity of relations over algebraic structures
• On the effective universality of mereological theories
• Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
• HKSS-completeness of modal algebras
• Categoricity spectra of computable structures

This page was built for publication: Isomorphisms and algorithmic properties of structures with two equivalences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q321265)