اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA dichotomy for some elementarily generated modal logics
281
0
0.0
(
0
)
تأليف
Stanislav Kikot
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $forall x_0 exists x_1 dots exists x_n bigwedge x_i R_lambda x_j$. We prove that many properties of these logics, such as finite axiomatisability, elementarity, axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula, together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
قيم البحث
اقرأ أيضاً
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of Godel logic. The calculi are used to establish completeness and complexity results for these fragments.
Given a class $mathcal C$ of models, a binary relation ${mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $mathcal C$ in $L$ where the modal operator is interpreted via
$mathcal R$. We discuss how modal theories of $mathcal C$ and ${mathcal R}$ depend on the model-theoretic language, their Kripke completeness, and expressibility of the modality inside $L$. We calculate such theories for the submodel and the quotient relations. We prove a downward Lowenheim--Skolem theorem for first-order language expanded with the modal operator for the extension relation between models.
This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set Gamma of modal formulas of the form gamma(x, p1, . . ., pn), where x occurs only positively in gamma, the language Lsharp (Gamma) is
obtained by adding to the language of polymodal logic a connective sharp_gamma for each gamma epsilon. The term sharp_gamma (varphi1, . . ., varphin) is meant to be interpreted as the least fixed point of the functional interpretation of the term gamma(x, varphi 1, . . ., varphi n). We consider the following problem: given Gamma, construct an axiom system which is sound and complete with respect to the concrete interpretation of the language Lsharp (Gamma) on Kripke frames. We prove two results that solve this problem. First, let Ksharp (Gamma) be the logic obtained from the basic polymodal K by adding a Kozen-Park style fixpoint axiom and a least fixpoint rule, for each fixpoint connective sharp_gamma. Provided that each indexing formula gamma satisfies the syntactic criterion of being untied in x, we prove this axiom system to be complete. Second, addressing the general case, we prove the soundness and completeness of an extension K+ (Gamma) of K_sharp (Gamma). This extension is obtained via an effective procedure that, given an indexing formula gamma as input, returns a finite set of axioms and derivation rules for sharp_gamma, of size bounded by the length of gamma. Thus the axiom system K+ (Gamma) is finite whenever Gamma is finite.
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative formulas in
the R-mingle logic RM to the validity of a linear combination of these formulas, and Gordans theorem for solutions of linear systems over the real numbers, that yields an analogous reduction for validity in Abelian logic A. In this paper, general conditions are provided for axiomatic extensions of involutive uninorm logic without additive constants to admit a theorem of alternatives. It is also shown that a theorem of alternatives for a logic can be used to establish (uniform) deductive interpolation and completeness with respect to a class of dense totally ordered residuated lattices.
We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the logic is compl
ete; in addition, has the finite model property, and again ADF. This argument can be iterated, and as an application we obtain the finite model property for PDL-like expansions of logics that ADF.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
