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

DOI10.2178/JSL/1309952523MaRDI QIDQ3173529zbMATH OpenOpenAlexFDO

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

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

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)

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

Cites work

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

Cited in

(9)

• Turing computable embeddings, computable infinitary equivalence, and linear orders
• Isomorphism relations on computable structures
• Comparing classes of finite sums
• Computable embeddings for pairs of linear orders
• Torsion-free abelian groups with optimal Scott families
• Assigning an isomorphism type to a hyperdegree
• Computable topological abelian groups
• Computable abelian groups
• On \(\Delta_2^0\)-categoricity of equivalence relations

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)