Results 281 to 290 of about 10,981,188 (298)
Some of the next articles are maybe not open access.
Stable Groups and Algebraic Groups
Journal of the London Mathematical Society, 2000Let \(G\) be a stable, saturated group, \(p\) be the strong type of an element of \(G\), and \(\langle p\rangle\) be the smallest type-definable (over \(\text{acl}(\emptyset)\)) subgroup of \(G\) containing \(p^G\). By \textit{L. Newelski}'s theorem [Notre Dame J. Formal Logic 32, No.
openaire +2 more sources
Archiv der Mathematik, 1993
Let \(Q\) be a loop; then the mappings \(L_ a(x)=ax\) and \(R_ a(x)=xa\), where \(a\in Q\), are permutations of \(Q\), and they generate a permutation group \(M(Q)\), which is called the multiplication group of \(Q\). In the paper \(p\)-groups are considered as loop groups (a loop group is a group that is isomorphic to the multiplication group of a ...
openaire +2 more sources
Let \(Q\) be a loop; then the mappings \(L_ a(x)=ax\) and \(R_ a(x)=xa\), where \(a\in Q\), are permutations of \(Q\), and they generate a permutation group \(M(Q)\), which is called the multiplication group of \(Q\). In the paper \(p\)-groups are considered as loop groups (a loop group is a group that is isomorphic to the multiplication group of a ...
openaire +2 more sources
Groups, Group Cognition and Groupware
2005More than we realize it, knowledge is often constructed through interactions among people in small groups. The Internet, by allowing people to communicate globally in limitless combinations, has opened enormous opportunities for the creation of knowledge and understanding. A major barrier today is the poverty of adequate groupware.
openaire +1 more source