Left-orderable computable groups
From MaRDI portal
Computable structure theory, computable model theory (03C57) Model-theoretic algebra (03C60) Theory of numerations, effectively presented structures (03D45) Ordered groups (06F15) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Abstract: We answer a question of Downey and Kurtz on left-orderable groups by showing that there is a computable left-orderable group which is not classically isomorphic to a computable group with a computable left-order.
Recommendations
Cites work
- \(\Pi_{1}^{0}\) classes and orderable groups
- Combinatorial group theory.
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- scientific article; zbMATH DE number 890270 (Why is no real title available?)
- scientific article; zbMATH DE number 3045421 (Why is no real title available?)
- scientific article; zbMATH DE number 3057900 (Why is no real title available?)
- Ordering coproducts of groups and semigroups
- Recursion theory and ordered groups
- Some constructivizations of Abelian groups
Cited in
(8)- \(\Pi_{1}^{0}\) classes and orderable groups
- Regular left-orders on groups
- Orders on magmas and computability theory
- Groups with orderings of arbitrary algorithmic complexity
- COMPUTABILITY, ORDERS, AND SOLVABLE GROUPS
- Embeddings into left‐orderable simple groups
- Spaces of orders and their Turing degree spectra
- Algorithmic aspects of left-orderings of solvable Baumslag-Solitar groups via its dynamical realization
This page was built for publication: Left-orderable computable groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638986)