کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
422811 685144 2014 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Meet Precontinuous Posets
ترجمه فارسی عنوان
مشاهده پست های پیشین
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی

In this paper, we introduce the concept of meet precontinuous posets, a generalization of meet continuous lattices to posets. The main results are: (1) A poset P is meet precontinuous iff its normal completion is a meet continuous lattice iff a certain system γ(P) which is, in the case of complete lattices, the lattice of all Scott-closed sets is a complete Heyting algebra; (2) A poset P is precontinuous iff the way below relation is the smallest approximating auxiliary relation iff P is meet precontinuous and there is a smallest approximating auxiliary relation on P. Finally, given a poset P and an auxiliary relation on P, we characterize those join-dense subsets of P whose way-below relation agrees with the given auxiliary relation.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 301, 18 February 2014, Pages 179-188