The bi-embeddability relation for finitely generated groups II

&
Archive for Mathematical Logic 55 (3-4):385-396 (2016)
  Copy   BIBTEX

Abstract

We study the isomorphism and bi-embeddability relations on the spaces of Kazhdan groups and finitely generated simple groups.

Categories

Keywords

Reprint years

DOI

10.1007/s00153-015-0455-6

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
Satisfaction of existential theories in finitely presented groups and some embedding theorems.Abderezak Ould Houcine - 2006 - Annals of Pure and Applied Logic 142 (1):351-365.
Model theoretic connected components of finitely generated nilpotent groups.Nathan Bowler, Cong Chen & Jakub Gismatullin - 2013 - Journal of Symbolic Logic 78 (1):245-259.
Finitely generated free MV-algebras and their automorphism groups.Antonio Di Nola, Revaz Grigolia & Giovanni Panti - 1998 - Studia Logica 61 (1):65-78.
Hyperbolic Towers and Independent Generic Sets in the Theory of Free Groups.Larsen Louder, Chloé Perin & Rizos Sklinos - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):521-539.
Finitely approximable groups and actions Part II: Generic representations.Christian Rosendal - 2011 - Journal of Symbolic Logic 76 (4):1307-1321.
Borel reducibility and finitely Hölder (α) embeddability.Longyun Ding - 2011 - Annals of Pure and Applied Logic 162 (12):970-980.
The descriptive set-theoretical complexity of the embeddability relation on models of large size.Luca Motto Ros - 2013 - Annals of Pure and Applied Logic 164 (12):1454-1492.
Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras.Oleg V. Belegradek - 1996 - Notre Dame Journal of Formal Logic 37 (4):613-624.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.
Describing groups.André Nies - 2007 - Bulletin of Symbolic Logic 13 (3):305-339.
Model companions for finitely generated universal horn classes.Stanley Burris - 1984 - Journal of Symbolic Logic 49 (1):68-74.
Review: S. I. Adan, The Algorithmic Unsolvability of the Problem of Checking Certain Properties of Groups; S. I. Adan, Finitely Generated Groups and Algorithms. [REVIEW]Andrzej Ehrenfeucht - 1958 - Journal of Symbolic Logic 23 (1):54-54.
Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited.Anvar M. Nurakunov & Michał M. Stronkowski - 2013 - Studia Logica 101 (4):827-847.
Concerning axiomatizability of the quasivariety generated by a finite Heyting or topological Boolean algebra.Wles?aw Dziobiak - 1982 - Studia Logica 41 (4):415 - 428.

Analytics

Added to PP
2016-02-04

Downloads
15 (#919,495)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

Borel Determinancy.Donald A. Martin - 1984 - Journal of Symbolic Logic 49 (4):1425-1425.
Universal countable borel quasi-orders.Jay Williams - 2014 - Journal of Symbolic Logic 79 (3):928-954.

Add more references