کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
434284 689713 2014 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On lattices from combinatorial game theory modularity and a representation theorem: Finite case
ترجمه فارسی عنوان
در جرثقیل های ترکیبی از نظریه بازی نظریه مدولاسیون و قضیه نمایندگی: مورد محدود است
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی

We show that a self-generated set of combinatorial games, S, may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question “Is there a set which will give a non-distributive but modular lattice?” appears. A useful necessary condition for the existence of a finite non-distributive modular L(S)L(S) is proved. We show the existence of S   such that L(S)L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 527, 27 March 2014, Pages 37–49
نویسندگان
, , , , , , ,