Abstract
This chapter continues the investigations of Chapter 16 and generalizes Theorem 14.1.3. For arbitrary k, l ∈ ℕ with 2 ≤ l ≤ k − 1 all maximal classes of PolkEl are determined. With the help of these maximal classes, one can easily give a completeness criterion for PolkEl.
The proofs given in this chapter resemble those ones from Chapter 6; that is, the results of this chapter were achieved with the means which were developed by I. G. Rosenberg in [Ros 70a].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Maximal Classes of PolkEl for 2 ≤ l < k. In: Function Algebras on Finite Sets. Springer Monographs in Mathematics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36023-9_25
Download citation
DOI: https://doi.org/10.1007/3-540-36023-9_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36022-3
Online ISBN: 978-3-540-36023-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)