Classes of Ulm type and coding rank-homogeneous trees in other structures

DOI10.2178/JSL/1309952523zbMATH Open1241.03042OpenAlexW2160413100MaRDI QIDQ3173529FDOQ3173529

Alexander Melnikov, J. F. Knight, E. B. Fokina, S. Quinn, C. Safranski

Publication date: 10 October 2011

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

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

Recommendations

• Turing computable embeddings and coding families of sets
• Embeddings of computable structures
• Turing computable embeddings
• On bi-embeddable categoricity of algebraic structures
• A first-order theory of Ulm type

zbMATH Keywords

Boolean algebrasabelian \(p\)-groupsTuring-computable embeddingabelian torsion groupsclass of Ulm typerank-homogeneous trees

Mathematics Subject Classification ID

Trees (05C05) Torsion groups, primary groups and generalized primary groups (20K10) Computable structure theory, computable model theory (03C57) Structure theory of Boolean algebras (06E05) Finite nilpotent groups, (p)-groups (20D15) Model theory of denumerable and separable structures (03C15) Applications of logic to group theory (20A15)

Cites Work

• Model Theory
• Computable structures and the hyperarithmetical hierarchy
• A Borel reductibility theory for classes of countable structures
• The effective Borel hierarchy
• Scott sentences and admissible sets
• The isomorphism relation on countable torsion free abelian groups
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Degree spectra and computable dimensions in algebraic structures
• THE CLASSIFICATION PROBLEM FOR p-LOCAL TORSION-FREE ABELIAN GROUPS OF RANK TWO
• Complexity of Categorical Theories with Computable Models
• On the complexity of the classification problem for torsion-free Abelian groups of finite rank
• Models with compactness properties relative to an admissible language
• Undecidable fragments of elementary theories

Cited In (9)

• ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
• Comparing classes of finite sums
• Isomorphism relations on computable structures
• Computable abelian groups
• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Computable embeddings for pairs of linear orders
• Torsion-free abelian groups with optimal Scott families
• On \(\Delta_2^0\)-categoricity of equivalence relations
• Computable topological abelian groups

This page was built for publication: Classes of Ulm type and coding rank-homogeneous trees in other structures

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