×
McCrimmon, Kevin

The Zelmanov annihilator and nilpotence of the nil radical in quadratic Jordan algebras with chain conditions. (English) Zbl 0458.17005

J. Algebra 67, 230-253 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0458.17005

Cited in 8 Documents

MSC:

17C10 Structure theory for Jordan algebras

Keywords:

nilpotence of nil radical; quadratic Jordan algebras with chain conditions

Citations:

Zbl 0423.17007
Cite Review PDF
Full Text: DOI

References:

[1] Jacobson, N., Lectures on quadratic Jordan algebras (1970), Tata Institute Lecture Notes: Tata Institute Lecture Notes Bombay
[2] Jacobson, N.; McCrimmon, K., Quadratic Jordan algebras of quadratic forms with basepoint, J. Indian Math. Soc., 35, 1-45 (1971) · Zbl 0253.17014
[3] Loos, O., Jordan Pairs, (Springer Lecture Notes in Mathematics No. 460 (1975), Springer-Verlag: Springer-Verlag New York) · Zbl 0301.17003
[4] McCrimmon, K., Solvability and nilpotence for quadratic Jordan algebras, Scripta Math., 29, 467-483 (1972) · Zbl 0288.17011
[5] McCrimmon, K., The Zelmanov nilpotence theorem for quadratic Jordan algebras, J. Algebra, 63, 76-97 (1980) · Zbl 0439.17008
[6] Hogben, L., Radicals and semi-prime ideals of Jordan triple systems, Comm. Algebra, 7, 1313-1328 (1979) · Zbl 0415.17013
[7] Slin’ko, A. M., Jordan algebras with maximal condition, Algebra i Logika, 16, 98-101 (1977), [Russian] · Zbl 0394.17007
[8] Zelmanov, E. I., Jordan algebras with finiteness conditions, Algebra i Logika, 17, 693-704 (1978), [Russian] · Zbl 0423.17007
[9] Zhevlakov, K. A.; Slin’ko, A. M.; Shestakov, I. P.; Shirshov, A. I., Jordan Algebras, Novosibirsk (1976), [Russian] · Zbl 0343.17007
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.