Pages that link to "Item:Q1305085"
From MaRDI portal
The following pages link to On the complexity of the isomorphism relation for finitely generated groups (Q1305085):
Displaying 35 items.
- The bi-embeddability relation for finitely generated groups. II (Q283098) (← links)
- The Friedman embedding theorem. (Q645257) (← links)
- Isomorphism of subshifts is a universal countable Borel equivalence relation (Q839908) (← links)
- On the concept of ``largeness'' in group theory. (Q848514) (← links)
- On the complexity of the quasi-isometry and virtual isomorphism problems for finitely generated groups (Q931867) (← links)
- Continuous versus Borel reductions (Q1042439) (← links)
- Homology of holomorphs of free groups. (Q1421803) (← links)
- Topological full groups of minimal subshifts and the classification problem for finitely generated complete groups (Q1733172) (← links)
- On the complexity of the classification problem for torsion-free abelian groups of rank two. (Q1812471) (← links)
- A topological zero-one law and elementary equivalence of finitely generated groups (Q2220487) (← links)
- Isomorphism of finitely generated solvable groups is weakly universal. (Q2254323) (← links)
- On the complexity of the classification problem for torsion-free Abelian groups of finite rank (Q2778661) (← links)
- JSL volume 79 issue 2 Cover and Back matter (Q2933683) (← links)
- A Descriptive View of Combinatorial Group Theory (Q3011105) (← links)
- Decomposing locally compact groups into simple pieces (Q3068830) (← links)
- Isomorphism and weak conjugacy of free Bernoulli subflows (Q3299559) (← links)
- A remark on the Higman–Neumann–Neumann embedding theorem (Q3393372) (← links)
- The commensurability relation for finitely generated groups (Q3401164) (← links)
- Isomorphisms, definable relations, and Scott families of class 2 nilpotent groups (Q3546091) (← links)
- The computational complexity of torsion-freeness of finitely presented groups (Q4374809) (← links)
- COUNTABLE BOREL EQUIVALENCE RELATIONS (Q4551991) (← links)
- THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM (Q4692086) (← links)
- The classification problem for torsion-free abelian groups of finite rank (Q4780402) (← links)
- Uncountable structures are not classifiable up to bi-embeddability (Q5114807) (← links)
- Kaleidoscopic groups: permutation groups constructed from dendrite homeomorphisms (Q5207328) (← links)
- <i>Canonical Ramsey Theory on Polish Spaces</i> (Encyclopedia of Mathematics and its Applications 202) <i>By</i> Vladimir Kanovei, Marcin Sabok and Jindřich Zapletal (Q5255545) (← links)
- Uniformity, universality, and computability theory (Q5268400) (← links)
- LOCALLY NORMAL SUBGROUPS OF TOTALLY DISCONNECTED GROUPS. PART II: COMPACTLY GENERATED SIMPLE GROUPS (Q5280250) (← links)
- Complete analytic equivalence relations (Q5313312) (← links)
- GENERIC COMPLEXITY OF THE CONJUGACY PROBLEM IN HNN-EXTENSIONS AND ALGORITHMIC STRATIFICATION OF MILLER'S GROUPS (Q5386949) (← links)
- Cayley graphs of finitely generated groups (Q5695770) (← links)
- On the complexity of the isomorphism relation for fields of finite transcendence degree (Q5939827) (← links)
- Quotients by countable normal subgroups are hyperfinite (Q6062652) (← links)
- Rotation equivalence and cocycle superrigidity (Q6134657) (← links)
- The isomorphism problem for oligomorphic groups with weak elimination of imaginaries (Q6593635) (← links)
