COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS

DOI10.1017/jsl.2020.34zbMath1485.03172arXiv1909.05720OpenAlexW2972898018MaRDI QIDQ5858922

Arman Darbinyan

Publication date: 15 April 2021

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

Full work available at URL: https://arxiv.org/abs/1909.05720

zbMATH Keywords

orderable groupscomputable groupscomputable structure theorycomputable orders

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (group-theoretic aspects) (20F60) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Embeddings into left‐orderable simple groups ⋮ Generic algebraic properties in spaces of enumerated groups ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ On decidability of amenability in computable groups ⋮ Regular left-orders on groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Pi_{1}^{0}\) classes and orderable groups
• Undecidability and recursive inseparability
• Embedding Theorems for Ordered Groups
• Group Embeddings with Algorithmic Properties
• Word problems, embeddings, and free products of right-ordered groups with amalgamated subgroup
• LEFT-ORDERABLE COMPUTABLE GROUPS
• Computable Algebra, General Theory and Theory of Computable Fields

This page was built for publication: COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS