×

zbMATH — the first resource for mathematics

Normal autometrized lattice ordered algebras. (English) Zbl 0988.06011
A normal autometrized lattice ordered algebra (N\(A\ell \)-algebra) is an abelian lattice ordered monoid \(A=(A;0,+,\vee ,\wedge)\) with an autometric binary operation \(*\) on \(A\) satisfying certain further conditions. N\(A\ell \)-algebras were introduced by K. L. N. Swamy as a common generalization of abelian lattice ordered groups and Brouwerian lattices. An N\(A\ell \)-algebra \(A\) is called semiregular if \(x\geq 0\) implies \(x*0=x\) for each \(x\in A\). Structure properties of semiregular N\(A\ell \)-algebras were studied by K. L. N. Swamy, N. P. Rao, M. Hansen and the reviewer. In the paper under review, the author proves some of those properties for general N\(A\ell \)-algebras without the assumption of semiregularity.

MSC:
06F05 Ordered semigroups and monoids
PDF BibTeX XML Cite
Full Text: EuDML
References:
[1] HANSEN M.: Minimal prime ideals in autometrized algebras. Czechoslovak Math. J. 44 (1994), 81-90. · Zbl 0814.06011
[2] HANSEN M.: Filets and z-ideals in autometrized algebras. Czechoslovak Math. J.
[3] RACHŮNEK J.: Prime ideals in autometrized algebras. Czechoslovak Math. J. 37 (1987), 65-69. · Zbl 0692.06007
[4] RACHŮNEK J.: Polars in autometrized algebras. Czechoslovak Math. J. 39 (1989), 681-685. · Zbl 0705.06010
[5] RACHŮNEK J.: Regular ideaLs in autometrized algebras. Math. Slovaca 40 (1990), 117-122. · Zbl 0738.06014
[6] SWAMY K. L. N.: A general theory of autometrized algebras. Math. Ann. 157 (1964), 65-74. · Zbl 0135.02602
[7] SWAMY K. L. N.-RAO N. P.: Ideals in autometrized algebras. J. Austral. Math. Soc. 24 (1977), 362-374. · Zbl 0427.06006
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.