Separating the basic logics of the basic recurrences
نویسندگان
چکیده
منابع مشابه
Separating the basic logics of the basic recurrences
This paper shows that, even at the most basic level (namely, in combination with only ¬,∧,∨), the parallel, countable branching and uncountable branching recurrences of computability logic validate different principles. MSC: primary: 03B47; secondary: 03B70; 68Q10; 68T27; 68T15.
متن کاملBasic Description Logics
This chapter provides an introduction to Description Logics as a formal language for representing knowledge and reasoning about it. It first gives a short overview of the ideas underlying Description Logics. Then it introduces syntax and semantics, covering the basic constructors that are used in systems or have been introduced in the literature, and the way these constructors can be used to bu...
متن کاملThe Data Complexity of MDatalog in Basic Modal Logics
We study the data complexity of the modal query language MDatalog and its extension eMDatalog in basic modal logics. MDatalog is a modal extension of Datalog, while eMDatalog is the general modal Horn fragment with the allowedness condition. As the main results, we prove that the data complexity of MDatalog and eMDatalog in K4, KD4, and S4 is PSPACE-complete, in K is coNP-complete, and in KD , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2012
ISSN: 0168-0072
DOI: 10.1016/j.apal.2011.11.009