Equivalence Relations on Classes of Computable Structures

DOI10.1007/978-3-642-03073-4_21zbMath1268.03039OpenAlexW1531956457MaRDI QIDQ3576052

Ekaterina B. Fokina, Sy-David Friedman

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_21

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS, Compound Objects Comparators in Application to Similarity Detection and Object Recognition, Agreement reducibility, COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR, Reducibilities among equivalence relations induced by recursively enumerable structures, Isomorphism relations on computable structures, Turing computable embeddings of equivalences other than isomorphism, Computability of distributive lattices, Positive preorders, PRIORITY ARGUMENTS VIA TRUE STAGES, Degree spectra of structures, CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS, On the degree structure of equivalence relations under computable reducibility, Graphs realised by r.e. equivalence relations

Cites Work

• Unnamed Item
• Unnamed Item
• The isomorphism problem for classes of computable fields
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Analytic equivalence relations and bi-embeddability
• The isomorphism problem for computable Abelian _p-groups of bounded length
• New Directions in Descriptive Set Theory
• Complete analytic equivalence relations
• Turing computable embeddings
• Comparing Classes of Finite Structures