Computable Scott sentences and the weak Whitehead problem for finitely presented groups
From MaRDI portal
Publication:6539429
DOI10.1016/J.APAL.2024.103441MaRDI QIDQ6539429
Publication date: 14 May 2024
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40) Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group-theoretic orbit decidability.
- The isomorphism problem for all hyperbolic groups.
- Endomorphisms of hyperbolic groups. I: The Hopf property
- Computable structures and the hyperarithmetical hierarchy
- Scott sentences for certain groups
- Aspects of free groups.
- Elementary subgroups of virtually free groups
- On equivalent sets of elements in a free group
- Computable Scott sentences for quasi-Hopfian finitely presented structures
- Describing free groups
- Describing groups
- On optimal Scott sentences of finitely generated algebraic structures
- Orbit decidability and the conjugacy problem for some extensions of groups
- Decidable Properties of Polycyclic Groups
- Endomorphisms of infinite Soluble Groups
- Characterization of finitely generated groups by types
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS
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 Q6539429)
