Please use this identifier to cite or link to this item:
https://scidar.kg.ac.rs/handle/123456789/10025
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.rights.license | restrictedAccess | - |
dc.contributor.author | Damljanovic, Nada | - |
dc.contributor.author | Ciric, Miroslav | - |
dc.contributor.author | Bogdanovic V. | - |
dc.date.accessioned | 2021-04-20T14:40:38Z | - |
dc.date.available | 2021-04-20T14:40:38Z | - |
dc.date.issued | 2011 | - |
dc.identifier.issn | 0037-1912 | - |
dc.identifier.uri | https://scidar.kg.ac.rs/handle/123456789/10025 | - |
dc.description.abstract | In a series of papers, Green's relations on the additive and multiplicative reducts of a semiring proved to be a very useful tool in the study of semirings. However, in the vast majority of cases, Green's relations are not congruences, and we show that in such cases it is much more convenient to use the congruence openings of Green's relations, instead of the Green's relations themselves. By means of these congruence openings we define and study several very interesting operators on the lattices of varieties of semirings and additively idempotent semirings, and, in particular, we establish order embeddings of the lattice of varieties of additively idempotent semirings into the direct products of the lattices of open (resp. closed) varieties with respect to two opening (resp. closure) operators on this lattice that we introduced. © 2010 Springer Science+Business Media, LLC. | - |
dc.rights | info:eu-repo/semantics/restrictedAccess | - |
dc.source | Semigroup Forum | - |
dc.title | Congruence openings of additive Green's relations on a semiring | - |
dc.type | article | - |
dc.identifier.doi | 10.1007/s00233-010-9255-9 | - |
dc.identifier.scopus | 2-s2.0-79956107984 | - |
Appears in Collections: | Faculty of Technical Sciences, Čačak |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PaperMissing.pdf Restricted Access | 29.86 kB | Adobe PDF | View/Open |
Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.