Isomorphism relations on computable structures

DOI10.2178/jsl/1327068695zbMath1255.03040OpenAlexW1985493589MaRDI QIDQ5388722

Antonio Montalbán, Ekaterina B. Fokina, Julia F. Knight, Valentina S. Harizanov, Charles F. D. McCoy, Sy-David Friedman

Publication date: 19 April 2012

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

Full work available at URL: https://projecteuclid.org/euclid.jsl/1327068695

zbMATH Keywords

equivalenceisomorphismcomputable structureFF-reducibilityFF-complete set

Mathematics Subject Classification ID

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

Related Items (27)

Comparing classes of finite sums ⋮ DEGREE SPECTRA OF ANALYTIC COMPLETE EQUIVALENCE RELATIONS ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ Torsion-free abelian groups with optimal Scott families ⋮ Souslin quasi-orders and bi-embeddability of uncountable structures ⋮ The theory of ceers computes true arithmetic ⋮ Agreement reducibility ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ COMPUTABLE REDUCIBILITY OF EQUIVALENCE RELATIONS AND AN EFFECTIVE JUMP OPERATOR ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Jumps of computably enumerable equivalence relations ⋮ Bi‐embeddability spectra and bases of spectra ⋮ STRUCTURAL HIGHNESS NOTIONS ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ A Survey on Universal Computably Enumerable Equivalence Relations ⋮ Minimal equivalence relations in hyperarithmetical and analytical hierarchies ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ On computably enumerable structures ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Computable topological groups and Pontryagin duality ⋮ Enumerating classes of effective quasi-Polish spaces ⋮ Graphs realised by r.e. equivalence relations ⋮ EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS ⋮ Computable embeddability for algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effective theory of Borel equivalence relations
• The computable embedding problem
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable categoricity and the Ershov hierarchy
• Computable structures and the hyperarithmetical hierarchy
• Effective categoricity of equivalence structures
• A Borel reductibility theory for classes of countable structures
• Analytic equivalence relations and bi-embeddability
• Classes of Ulm type and coding rank-homogeneous trees in other structures
• $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures
• Equivalence Relations on Classes of Computable Structures
• On the Equimorphism Types of Linear Orderings
• Ulm's Theorem for Partially Ordered Structures Related to Simply Presented Abelian p-Groups
• New Directions in Descriptive Set Theory
• The isomorphism relation on countable torsion free abelian groups
• Complete analytic equivalence relations
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Recursive Pseudo-Well-Orderings
• The classification of hypersmooth Borel equivalence relations

This page was built for publication: Isomorphism relations on computable structures