Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/15121
DC FieldValueLanguage
dc.contributor.authorPantović, Jovankaen
dc.contributor.authorVojvodić G.en
dc.date.accessioned2020-03-03T14:58:39Z-
dc.date.available2020-03-03T14:58:39Z-
dc.date.issued2005-01-01en
dc.identifier.issn0195623Xen
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/15121-
dc.description.abstractFor any finite set A, the partial clone lattice on A is embedded into the partial hyperclone lattice on A. It is shown that there are maximal intervals in the partial hyperclone lattice and there are four minimal partial hyperclones such that their join contains all partial hype rope rations. It is proved in [5] that the mapping λ from the lattice of partial hyperclones on A into the lattice of clones of operations on P(A) defined by λ(C) = δ(C#), where δ(C#) is the clone of operations on P(A) generated by C # , is an order embedding, but not a full one. In this paper, it is proved that there are continuum many clones of operations on P(A) that are in the interval [λ( J A ), λ(Hp A )] but these are not in the set imλ of all images of the mapping λ, where J A is the set of all (partial) hyperprojections and HpA is the set of all partial hyperoperations on A. © 2005 IEEE.en
dc.relation.ispartofProceedings of The International Symposium on Multiple-Valued Logicen
dc.titleOn the partial hyperclone latticeen
dc.typeConference Paperen
dc.identifier.scopus2-s2.0-24644437710en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/24644437710en
dc.relation.lastpage100en
dc.relation.firstpage96en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptFakultet tehničkih nauka, Departman za opšte discipline u tehnici-
crisitem.author.parentorgFakultet tehničkih nauka-
Appears in Collections:FTN Publikacije/Publications
Show simple item record

Page view(s)

21
Last Week
12
Last month
0
checked on May 10, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.