A Friedberg enumeration of equivalence structures
From MaRDI portal
(Redirected from Publication:4596664)
Recommendations
Cites work
- η-representation of sets and degrees
- A Note on Positive Equivalence Relations
- Abelian p-groups and the halting problem
- Classifications of computable structures
- Computable completely decomposable groups
- Computable models of theories with few models
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Effective categoricity of equivalence structures
- Effectively categorical abelian groups
- Effectively closed sets and enumerations
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- Iterated effective embeddings of abelian p-groups
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic sequences and degree spectra of structures
- On \(\Delta_2^0\)-categoricity of equivalence relations
- On Σ1 1 equivalence relations over the natural numbers
- Subgroups of finitely presented groups
- Summands of Separable Abelian Groups: Dedicated to Paul Turán on his 60th Birthday
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Universal computably enumerable equivalence relations
Cited in
(8)- Many-sorted elementary equivalence
- A note on the equivalence of a set of egds to a set of FDs
- Enumerating abelian \(p\)-groups
- Classifications of definable subsets
- On functors enumerating structures
- Generalization of Shapiro's theorem to higher arities and noninjective notations
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- Limit learning equivalence structures
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)