کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
423431 | 685222 | 2008 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Coequational Logic for Finitary Functors
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Coequations, which are subsets of a cofree coalgebra, can be viewed as properties of systems. In case of a polynomial functor, a logic of coequations was formulated by J. Adámek. However, the logic is more complicated for other functors than polynomial ones, and simple deduction rules can no longer be formulated. A simpler coequational logic for finitely branching labelled transition systems was later presented by the author. The current paper carries that research further: it yields a simple coequational logic for finitary functors that preserve preimages. Furthermore we prove a statement for semantical consequences of sets of coequations in the case of accessible functors.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 203, Issue 5, 12 June 2008, Pages 243-262
Journal: Electronic Notes in Theoretical Computer Science - Volume 203, Issue 5, 12 June 2008, Pages 243-262