Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/7614
DC FieldValueLanguage
dc.contributor.authorČolić J.en
dc.contributor.authorMachida H.en
dc.contributor.authorPantović, Jovankaen
dc.date.accessioned2019-09-30T09:03:13Z-
dc.date.available2019-09-30T09:03:13Z-
dc.date.issued2014-01-01en
dc.identifier.issn15423980en
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/7614-
dc.description.abstract© 2014 Old City Publishing, Inc. A set of hyperoperations on a finite set A is upward saturated if it contains all super-hyperoperations of each hyperoperation belonging to the set. The set of all upward saturated hyperclones, ordered by set inclusion, is an algebraic lattice. We describe a class of maximal hyperclones determined by bounded partial orders. Hyperclones from this class are upward saturated.en
dc.relation.ispartofJournal of Multiple-Valued Logic and Soft Computingen
dc.titleUpward saturated hyperclonesen
dc.typeJournal/Magazine Articleen
dc.identifier.scopus2-s2.0-84908661774en
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84908661774en
dc.relation.lastpage201en
dc.relation.firstpage189en
dc.relation.issue1-4en
dc.relation.volume24en
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)

25
Last Week
14
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.