Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/7614| Nаziv: | Upward saturated hyperclones | Аutоri: | Čolić J. Machida H. Pantović, Jovanka |
Dаtum izdаvаnjа: | 1-јан-2014 | Čаsоpis: | Journal of Multiple-Valued Logic and Soft Computing | Sažetak: | © 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. | URI: | https://open.uns.ac.rs/handle/123456789/7614 | ISSN: | 15423980 |
| Nаlаzi sе u kоlеkciјаmа: | FTN Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
Prеglеd/i stаnicа
25
Prоtеklа nеdеljа
14
14
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.