Groups with orderings of arbitrary algorithmic complexity

DOI10.1142/9789813223523_0009MaRDI QIDQ5137321zbMATH OpenOpenAlexFDO

Authors Jennifer Chubb, Mieczysław K. Dabkowski, Valentina Harizanov

Publication date 2 December 2020

Published in Sets and Computations (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Theory of numerations, effectively presented structures (03D45) Ordered groups (06F15) Applications of logic to group theory (20A15) Residual properties and generalizations; residually finite groups (20E26) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Recommendations

• Left-orderable computable groups
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Spaces of orders and their Turing degree spectra
• \(\Pi_{1}^{0}\) classes and orderable groups
• Degrees of orders on torsion-free abelian groups

Cited in

(9)

• \(\Pi_{1}^{0}\) classes and orderable groups
• Algorithmically complex residually finite groups
• Detecting properties from descriptions of groups
• scientific article; zbMATH DE number 3877408 (Why is no real title available?)
• Left-orderable computable groups
• scientific article; zbMATH DE number 1885201 (Why is no real title available?)
• Bi-orders do not arise from total orders
• COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
• Spaces of orders and their Turing degree spectra

This page was built for publication: Groups with orderings of arbitrary algorithmic complexity

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