The Friedman embedding theorem.
recursion theorycountable groups2-generator groupscombinatorial group theoryTuring degreesBorel equivalence relationsHigman-Neumann-Neumann embedding theoremHigman-Neumann-Neumann extensions
Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Descriptive set theory (03E15) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Word problems, etc. in computability and recursion theory (03D40)
- scientific article; zbMATH DE number 4091484 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- A remark on the Higman–Neumann–Neumann embedding theorem
- Borel determinacy
- Borel equivalence relations and classifications of countable models
- DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
- Embedding Countable Groups in 2-Generator Groups
- Embedding Theorems for Groups
- Embeddings into hopfian groups
- On the complexity of the isomorphism relation for finitely generated groups
- The axiom of determinateness and reduction principles in the analytical hierarchy
- The space of finitely generated groups
This page was built for publication: The Friedman embedding theorem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645257)