The aim of this paper is to develop a general construction method of finite series of a group G based on the existence of suitable finite series in the countable subgroups of G. This method is applied to prove that certain group theoretical properties are countably recognizable
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
Andras Biro and Vera Sos prove that for any subgroup G of T generated freely by nitely many generato...
The aim of this paper is to develop a general construction method of finite series of a group G base...
Countably recognizable group classes were introduced by Reinhold Baer and provide a very ingenious w...
Countably recognizable group classes were introduced by Reinhold Baer and provide a very ingenious w...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
A class X of groups is said to be countably recognizable if a group belongs to X whenever all its co...
A prominent, recurring feature of group theory has been the determination of groups (all of) whose s...
We describe soluble groups in which the set of all subgroups is countable and show that locally (sol...
AbstractWe define a relative property A for a countable group with respect to a finite family of sub...
AbstractIt is proved that certain classes of groups that are either (locally soluble)-by-finite rank...
In this BSc thesis we consider the concept of solvable groups. It turns out that this concept is one...
A group class ${ X}$ is said to be countably recognizable if a group belongs to ${X}$ whenever all i...
AbstractWe show that if G is a finite group then no chain of modular elements in its subgroup lattic...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
Andras Biro and Vera Sos prove that for any subgroup G of T generated freely by nitely many generato...
The aim of this paper is to develop a general construction method of finite series of a group G base...
Countably recognizable group classes were introduced by Reinhold Baer and provide a very ingenious w...
Countably recognizable group classes were introduced by Reinhold Baer and provide a very ingenious w...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
A class X of groups is said to be countably recognizable if a group belongs to X whenever all its co...
A prominent, recurring feature of group theory has been the determination of groups (all of) whose s...
We describe soluble groups in which the set of all subgroups is countable and show that locally (sol...
AbstractWe define a relative property A for a countable group with respect to a finite family of sub...
AbstractIt is proved that certain classes of groups that are either (locally soluble)-by-finite rank...
In this BSc thesis we consider the concept of solvable groups. It turns out that this concept is one...
A group class ${ X}$ is said to be countably recognizable if a group belongs to ${X}$ whenever all i...
AbstractWe show that if G is a finite group then no chain of modular elements in its subgroup lattic...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
Andras Biro and Vera Sos prove that for any subgroup G of T generated freely by nitely many generato...
DOI
Add to ORKG