Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/7614
Title: Upward saturated hyperclones
Authors: Čolić J.
Machida H.
Pantović, Jovanka 
Issue Date: 1-Jan-2014
Journal: Journal of Multiple-Valued Logic and Soft Computing
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.
URI: https://open.uns.ac.rs/handle/123456789/7614
ISSN: 15423980
Appears in Collections:FTN Publikacije/Publications

Show full 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.