Detecting properties from descriptions of groups

DOI10.1007/s00153-019-00690-xzbMath1481.03043arXiv1903.05143OpenAlexW2966992113WikidataQ105300388 ScholiaQ105300388MaRDI QIDQ2309493

Jennifer Chubb, Iva Bilanovic, Sam Roven

Publication date: 1 April 2020

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

decision problemscomputability theorycombinatorial group theoryarithmetical hierarchyorderable groupscomputable model theory

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Ordered groups (06F15) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57)

Related Items (1)

Decidability problem for exponential equations in finitely presented groups

Cites Work

• 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
• Decision problems in classes of group presentations with uniformly solvable word problem
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• Computable structures and the hyperarithmetical hierarchy
• Combinatorial group theory.
• On recognising properties of groups which have solvable word problem
• Describing free groups
• Note on ordered groups and rings
• Index sets of computable structures
• The computational complexity of torsion-freeness of finitely presented groups
• The word and geodesic problems in free solvable groups
• On a Problem of J.H.C. Whitehead and a Problem of Alonzo Church.

This page was built for publication: Detecting properties from descriptions of groups