کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
438192 690235 2008 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Arity hierarchy for temporal logics
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Arity hierarchy for temporal logics
چکیده انگلیسی

A major result concerning temporal logics is Kamp’s Theorem which states that the pair of modalities “until” and “since” is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals.The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp’s Theorem, for every n there is a modality of arity n definable by a monadic logic formula, which is not equivalent over trees to any temporal logic formula which uses modalities of arity less than n. Its proof takes advantage of an instance of Shelah’s composition theorem.This result has interesting corollaries, for instance reproving that CTL∗ and ECTL+ have no finite basis.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 403, Issues 2–3, 28 August 2008, Pages 373-381