Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems
From MaRDI portal
Publication:3298249
DOI10.1007/978-3-319-51718-6_6zbMath1436.06045OpenAlexW2621191476MaRDI QIDQ3298249
Publication date: 14 July 2020
Published in: Groups, Modules, and Model Theory - Surveys and Recent Developments (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51718-6_6
Model-theoretic algebra (03C60) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (06F15) Model theory of ordered structures; o-minimality (03C64) Infinite automorphism groups (20B27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of group theoretic problems
- Sublattice subgroups of finitely presented lattice-ordered groups.
- The group generated by \(x\mapsto x+1\) and \(x\mapsto x^ p\) is free
- Normal subgroups and elementary theories of lattice-ordered groups
- Ordering coproducts of groups and semigroups
- Infinite permutation groups. I: Products of conjugacy classes
- Model theory
- Wreath products of ordered permutation groups
- Nonaxiomatizability of lattice orderable groups
- O-primitive ordered permutation groups. II
- The lattice-ordered group of automorphisms of an ordered set
- Automorphism groups of totally ordered sets: A retrospective survey
- The Word Problem for Lattice-Order Groups
- Right orderability and graphs of groups
- A finitely presented orderable group with insoluble word problem
- Subgroups of finitely presented groups
- Conjugacy in lattice-ordered groups and right ordered groups
- Word problems, embeddings, and free products of right-ordered groups with amalgamated subgroup
- Bi-Interpretable Groups and Lattices
- Recognizing the Real Line
- Arithmetic Permutations
- An algebraic characterization of groups with soluble word problem
- Expanded theory of ordered Abelian groups
- Groups of homeomorphisms with manageable automorphism groups
- ON DISTINGUISHING QUOTIENTS OF ORDERED PERMUTATION GROUPS
- Free Groups from Fields
- EMBEDDING FINITELY GENERATED ABELIAN LATTICE-ORDERED GROUPS: HIGMAN'S THEOREM AND A REALISATION OF $\pi$
- Finitely generated lattice-ordered groups with soluble word problem
- Amalgamations of Lattice Ordered Groups
- An Algebraically Simple Ordered Group
- The word problem
This page was built for publication: Groups of Automorphisms of Totally Ordered Sets: Techniques, Model Theory and Applications to Decision Problems