2020
DOI: 10.1007/s00009-020-01510-w
|View full text |Cite
|
Sign up to set email alerts
|

Laws of the Lattices of $$\sigma $$-Local Formations of Finite Groups

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 35 publications
0
3
0
Order By: Relevance
“…In computer programming, various abstract data types can be considered as monoids. Because the operation takes two values of a given type and returns a new value of the same type, it can be chained indefinitely, and associativity abstracts away the details of construction; see [40,Example 3.1]. A list (array) is a fine example of a monoid.…”
Section: Inductive Lattices Of Formationsmentioning
confidence: 99%
“…In computer programming, various abstract data types can be considered as monoids. Because the operation takes two values of a given type and returns a new value of the same type, it can be chained indefinitely, and associativity abstracts away the details of construction; see [40,Example 3.1]. A list (array) is a fine example of a monoid.…”
Section: Inductive Lattices Of Formationsmentioning
confidence: 99%
“…Corollary 2 [21,Proposition 3.1. ] Let be a -local formation, F be the formation of languages associated with , and let C p be the formation of languages associated with formation of groups where p ∈ ( ) .…”
Section: Example 4 ( -Local Formations)mentioning
confidence: 99%
“…Skiba [9,10] was proved that the lattice l σ n of all n-multiply σ-local formations of finite groups is algebraic and modular. A.A. Tsarev [16] showed that every law of the lattice of all formations is fulfilled in the lattice l σ n and that for any nonnegative integer n the lattice l σ n is modular but is not distributive. I.N.…”
Section: Introductionmentioning
confidence: 99%