کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6875737 | 1441983 | 2018 | 38 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Simple and subdirectly irreducible finitely supported Cb-sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The aim of this paper is to study and characterize simple, subdirectly irreducible, and indecomposable finitely supported Cb-sets. To study and find their relations, we introduce the notion of fix-simple Cb-sets, and completely describe them. Among other things, we show that under some conditions on supports, fix-simple finitely supported Cb-sets are exactly the ones whose congruence lattices are the two or three element chains. Also, it is shown that an infinite finitely supported Cb-set is simple if and only if it is a special fix-simple one. Furthermore, we observe that all the elements of a simple or subdirectly irreducible infinite Cb-set are finitely supported if we have enough elements with finite support.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 706, 6 January 2018, Pages 1-21
Journal: Theoretical Computer Science - Volume 706, 6 January 2018, Pages 1-21
نویسندگان
M.M. Ebrahimi, Kh. Keshvardoost, M. Mahmoudi,