A Friedberg enumeration of equivalence structures

DOI10.1142/S0219061317500088zbMATH Open1423.03153OpenAlexW2741910292MaRDI QIDQ4596664FDOQ4596664

Authors: Alexander Melnikov, Keng Meng Ng, Rodney G. Downey 

Publication date: 4 December 2017

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061317500088

Recommendations

• Classifications of computable structures
• Equivalence Relations on Classes of Computable Structures
• scientific article; zbMATH DE number 218551
• \({\Sigma}^0_1\) and \({\Pi}^0_1\) equivalence structures
• Calculable enumerations and equivalence relations

zbMATH Keywords

index setisomorphismFriedberg enumerationcomputable equivalence structures

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Recursive equivalence types of sets and structures, isols (03D50)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computable structures and the hyperarithmetical hierarchy
• On Σ¹ ₁ equivalence relations over the natural numbers
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Subgroups of finitely presented groups
• Title not available (Why is that?)
• Computable models of theories with few models
• Limitwise monotonic sequences and degree spectra of structures
• A Note on Positive Equivalence Relations
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Effectively categorical abelian groups
• Effective categoricity of equivalence structures
• Abelian \(p\)-groups and the halting problem
• Computable completely decomposable groups
• Title not available (Why is that?)
• Effectively closed sets and enumerations
• Title not available (Why is that?)
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Degree spectra and computable dimensions in algebraic structures
• Iterated effective embeddings of abelian \(p\)-groups
• Summands of Separable Abelian Groups: Dedicated to Paul Turán on his 60th Birthday
• η-representation of sets and degrees
• Title not available (Why is that?)
• Universal computably enumerable equivalence relations
• Classifications of computable structures

Cited In (7)

• Many-sorted elementary equivalence
• Enumerating abelian \(p\)-groups
• A note on the equivalence of a set of egds to a set of FDs
• On functors enumerating structures
• Generalization of Shapiro's theorem to higher arities and noninjective notations
• Classifications of definable subsets
• ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES

This page was built for publication: A Friedberg enumeration of equivalence structures

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