Computable Scott sentences and the weak Whitehead problem for finitely presented groups
From MaRDI portal
Cites work
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Aspects of free groups.
- Characterization of finitely generated groups by types
- Computable Scott sentences for quasi-Hopfian finitely presented structures
- Computable structures and the hyperarithmetical hierarchy
- Decidable Properties of Polycyclic Groups
- Describing free groups
- Describing groups
- Elementary subgroups of virtually free groups
- Endomorphisms of hyperbolic groups. I: The Hopf property
- Endomorphisms of infinite Soluble Groups
- Group-theoretic orbit decidability.
- scientific article; zbMATH DE number 3815938 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 67424 (Why is no real title available?)
- scientific article; zbMATH DE number 1032970 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 3266609 (Why is no real title available?)
- On equivalent sets of elements in a free group
- On optimal Scott sentences of finitely generated algebraic structures
- Orbit decidability and the conjugacy problem for some extensions of groups.
- Scott sentences for certain groups
- The isomorphism problem for all hyperbolic groups.
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)