The relation of recursive isomorphism for countable structures

DOI10.2178/JSL/1190150114MaRDI QIDQ3149999zbMATH OpenOpenAlexFDO

Authors Riccardo Camerlo

Publication date 4 December 2002

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1190150114

zbMATH Keywords

Boolean algebrasBorel completenessrecursive isomorphismcountable structurescountable treesdefinable equivalence relationsuniversal countable Borel equivalence relations

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Descriptive set theory (03E15) Model theory of denumerable and separable structures (03C15)

Recommendations

• ISOMORPHISM ON HYP
• The completeness of the isomorphism relation for countable Boolean algebras
• Isomorphism of homogeneous structures
• Isomorphism relations on computable structures
• On the complexity of the isomorphism relation for fields of finite transcendence degree

Cites work

• scientific article; zbMATH DE number 976831 (Why is no real title available?)
• A Borel reductibility theory for classes of countable structures
• Conjugacy equivalence relation on subgroups
• Stability of nilpotent groups of class 2 and prime exponent
• The completeness of the isomorphism relation for countable Boolean algebras
• The structure of countable Boolean algebras

Cited in

(7)

• Turing computable embeddings of equivalences other than isomorphism
• Isomorphism of homogeneous structures
• Recursive versus recursively enumerable binary relations
• On the complexity of the isomorphism relation for fields of finite transcendence degree
• ISOMORPHISM ON HYP
• Isomorphism and classification for countable structures
• scientific article; zbMATH DE number 1302872 (Why is no real title available?)

This page was built for publication: The relation of recursive isomorphism for countable structures

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