Computable Scott sentences and the weak Whitehead problem for finitely presented groups
From MaRDI portal
Publication:6515551
arXiv2401.00079MaRDI QIDQ6515551
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computable structure theory, computable model theory (03C57)
This page was built for publication: Computable Scott sentences and the weak Whitehead problem for finitely presented groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6515551)