ترغب بنشر مسار تعليمي؟ اضغط هنا

Theorems of Alternatives for Substructural Logics

141   0   0.0 ( 0 )
 نشر من قبل Almudena Colacito
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

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.



قيم البحث

اقرأ أيضاً

141 - Sean A. Fulop 2012
This paper is a survey of two kinds of compressed proof schemes, the emph{matrix method} and emph{proof nets}, as applied to a variety of logics ranging along the substructural hierarchy from classical all the way down to the nonassociative Lambek sy stem. A novel treatment of proof nets for the latter is provided. Descriptions of proof nets and matrices are given in a uniform notation based on sequents, so that the properties of the schemes for the various logics can be easily compared.
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.
271 - Stanislav Kikot 2014
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 axiom atisability, 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.
This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate especially the case of three-valued systems showing how paraconsistent three-valued logics can be obtained from them.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا