Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/699
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bleblou O. | en |
dc.contributor.author | Šešelja B. | en |
dc.contributor.author | Tepavčević, Andreja | en |
dc.date.accessioned | 2019-09-23T10:10:19Z | - |
dc.date.available | 2019-09-23T10:10:19Z | - |
dc.date.issued | 2019-01-01 | en |
dc.identifier.issn | 1860949X | en |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/699 | - |
dc.description.abstract | © Springer Nature Switzerland AG 2019. A new notion of a lattice valued Boolean algebra is introduced. It is based on an algebra with two binary, a unary and two nullary operations, which is not a crisp Boolean algebra in general. The classical equality is replaced by a lattice valued equivalence so that the Boolean algebra identities are correspondingly satisfied. Main properties of the new introduced notion are proved, and a connection with the notion of a generalized lattice valued lattice is provided. As an application, the paper contains basic structures for developing generalized Boolean functions. | en |
dc.relation.ispartof | Studies in Computational Intelligence | en |
dc.title | Generalized boolean algebras and applications | en |
dc.type | Book Chapter | en |
dc.identifier.doi | 10.1007/978-3-030-00485-9_16 | en |
dc.identifier.scopus | 2-s2.0-85054741899 | en |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/85054741899 | en |
dc.relation.lastpage | 145 | en |
dc.relation.firstpage | 139 | en |
dc.relation.volume | 796 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.orcid | 0000-0002-5716-604X | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | PMF Publikacije/Publications |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.