Antonio Di Nola, Brunella Gerla, Ciro Russo
In this paper, once recalled some properties of CMV-algebras, we introduce an expansion of the one-variable fragment of Lukasiewicz propositional logic whose algebraic semantics is the variety of CMV-algebras.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Using polyadic MV algebras, we show that many predicate many valued logics have the interpolation property.
We construct a De Morgan algebra-valued logic with quantifiers, where the truth values are in a finite De Morgan algebra, We show that there is a representation theorem of the cylindric algebra of this logic from which a completeness theorem for De Morgan algebra-valued logic follows. This is a generalization of the results in [2].
In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent algebraic semantics of the monadic fragment of Hájek's basic predicate logic. In addition, we start a systematic study of the main subvarieties of monadic BL-algebras, some of which constitute the algebraic semantics of well-known monadic logics: monadic Gödel logic and monadic Łukasiewicz logic. In the last section we give a complete characterization of totally …
Hereditarily Structurally Complete Superintuitionistic Logics and Primitive Varieties of Heyting Algebras
本文通过代数方法证明了中间逻辑的可遗传结构完备性与Heyting代数变种的原始性之间的等价性。
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to advance useful concepts, as for example computer algebra. In this paper we reffer in specially to BL-algebras and we present properties of finite rings or rings with a finite number of ideals in their connections with BL-rings.
The logic of quasi MV star algebras
本文引入与拟 MV* 代数项等价的拟 Wajsberg* 代数，研究其性质，并以更少演绎规则建立相应逻辑系统且证明其可靠性。
We define when a ternary term $m$ of an algebraic language $\mathcal{L}$ is called a \textit{distributive nearlattice term} (DN-term) of a sentential logic $\mathcal{S}$. Distributive nearlattices are ternary algebras generalising Tarski algebras and distributive lattices. We characterise the selfextensional logics with a DN-term through the interpretation of the DN-term in the algebras of the algebraic counterpart of the logics. We prove that the canonical class of algebras (under the point of view of Abstract Algebraic Logic) associated with a selfextensional logic with a DN-term is a variet…
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stone's representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof of completeness theorem in propositional logic will be given using Stone's theorem from Boolean algebra.
In a recent work Foulis and Pulmannov\' a \cite{Foulis2012} studied the logical connectives in lattice effect algebras. In this paper we extend their study and investigate further the logical calculus for which the lattice effect algebras can serve as semantic models. We shall first focus on some properties of lattice effect algebras and will then give a complete axiomatisation of this logic.
Several open problems in algebraic logic are solved.
The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too - so leading to completeness results. This motivates for an algebraic (in the sense of universal algebra) study of those relational structures that are subordinate algebras.
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of $\mathcal{Q}$ correspond to certain natural expansions of $L$, which we call {\em algebraic expansions}. These turn out to be a special case of the expansions by implicit connectives studied by X. Caicedo. We proceed to characterize all the AE-subclasses of Abelian $\ell$-groups and perfect MV-algebras, thus fully describing the algebraic expansions of their …
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics. To this end, we define inquisitive and dependence algebras and we investigate their model-theoretic properties. We show they are elementary structures axiomatised by Horn sentences and we use our completeness result to state a version of algebraisability for inquisitive and dependence logics. We then foc…
Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a simple axiom system in Gentzen style in order to axiomatize the logic induced by lattice effect algebras. For effect algebras which need not be lattice-ordered we introduce a certain kind of implication which is everywhere defined but whose result need not be a single element. Then we study effect implication algebras and prove the correspondence between these a…
Strong quasi-MV* algebras and their logics
本文定义强拟-MV*与强拟-Wajsberg*代数，证明其项等价、表示定理和标准完备性，并建立相应可靠且完备的逻辑系统。
We study Łukasiewicz logic enriched with a scalar multiplication with scalars taken in $[0,1]$. Its algebraic models, called {\em Riesz MV-algebras}, are, up to isomorphism, unit intervals of Riesz spaces with a strong unit endowed with an appropriate structure. When only rational scalars are considered, one gets the class of {\em DMV-algebras} and a corresponding logical system. Our research follows two objectives. The first one is to deepen the connections between functional analysis and the logic of Riesz MV-algebras. The second one is to study the finitely presented MV-algebras, DMV-algebr…
Rational Lukasiewicz logic and DMV-algebras
本文研究了可除MV-代数簇，证明了自由可除MV-代数是有理系数连续分段线性函数代数，并据此定义了Rational Łukasiewicz逻辑。
Algebraic Semantics for the Logic of Proofs
该研究基于布尔代数构建经典证明逻辑的代数语义，扩展证明逻辑语言以赋予证成项布尔结构与项相等谓词，最终得到相关代数的完备性定理与斯通表示定理的推广。
We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice translation from any countable logic into intuitionistic propositional logic in two variables is shown. The nonexistence of a translation from classical logic into intuitionistic propositional logic which preserves ``and'' and ``or'' but not necessarily ``true'' is proven. These results about translations follow from additional results about embeddings into free He…
Moisil in 1941, while constructing the algebraic models of n-valued Łukasiewicz logic defined the set $B^{[n]}$,where $B$ is a Boolean algebra and `n' being a natural number. Further it was proved by Moisil himself the representations of n-valued Łukasiewicz Moisil algebra in terms of $B^{[n]}$. In this article, structural representation results for Stone, dual Stone and double Stone algebras are proved similar to Moisil's work by showing that elements of these algebras can be looked upon as monotone ordered tuple of sets. 3-valued semantics of logic for Stone algebra, dual Stone algebras and …
We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We show that all axiomatic extensions of the basic hybrid logics, with or without the satisfaction operator, are complete with respect to their classes of hybrid algebras. Moreover, we show that by adding the usual non-orthodox rules to these logics, they become complete with respect to their classes of permeated hybrid algebras, corresponding to strongly descrip…
An algebraic investigation of Linear Logic
本文从代数视角研究 MALL 与 LL，证明其强可代数化并刻画对应 Girard 代数与 girales 簇的同余、结构及表示性质。
Independence-friendly logic is a conservative extension of first-order logic that has the same expressive power as existential second-order logic. In her Ph.D. thesis, Dechesne introduces a variant of independence-friendly logic called IFG logic. We attempt to algebraize IFG logic in the same way that Boolean algebra is the algebra of propositional logic and cylindric algebra is the algebra of first-order logic. We define independence-friendly cylindric set algebras and prove two main results. First, every independence-friendly cylindric set algebra over a structure has an underlying Kleene al…
An algebraic setting for the validity of Pavelka style completeness for some natural expansions of Łukasiewicz logic by new connectives and rational constants is given. This algebraic approach is based on the fact that the standard MV-algebra on the real segment $[0, 1]$ is an injective MV-algebra. In particular the logics associated with MV-algebras with product and with divisible MV-algebras are considered.
This paper aims at connecting the various classes that provide an algebraic semantics for three different conservative expansions of Lukasiewicz logic, using algebraic and category-theoretical techniques. We connect such classes of algebras by adjunctions, using the tensor product of MV-algebras and defining the tensor PMV-algebra of a semisimple MV-algebra, inspired by the construction of the tensor algebra of a vector space. We further apply the main results to prove amalgamation properties and, via categorical equivalence, we transfer all results to the framework of lattice- ordered groups.
We take a long magical tour in algebraic logic, starting from classical results on neat embeddings due to Henkin, Monk and Tarski, all the way to recent results in algebraic logic using so--called rainbow constructions invented by Hirsch and Hodkinson. Highlighting the connections with graph theory, model theory, and finite combinatorics, this article aspires to present topics of broad interest in a way that is hopefully accessible to a large audience. The paper has a survey character but it contains new approaches to old ones. We aspire to make our survey fairly comprehensive, at least in so …
In this paper, we focus on the variety DHMSH of dually hemimorphic semi-Heyting algebras from a logical point of view. Firstly, we present a Hilbert-style axiomatization of a new logic called Dually hemimorphic semi-Heyting logic (DHMSH, for short), as an expansion of semi-intuitionistic logic SI (also called SH) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety DHMSH. It is deduced that the logic DHMSH is algebraizable in the sense…
In this paper, we enlarge the language of MTL-algebras by a unary operation $\forall$ equationally described so as to abstract algebraic properties of the universal quantifier "for any" in its original meaning. The resulting class of algebras will be called \emph{MTL-algebras with universal quantifiers} (UMTL-algebras for short). After discussing some basic algebraic properties of UMTL-algebras, we start a systematic study of the main subclasses of UMTL-algebras, some of which constitute well known algebras: UMV-algebras and monadic Boolean algebra. Then we give some characterizations of repre…
Continuous Algebra: Algebraic Semantics for Continuous Propositional Logic
本文提出连续代数作为连续命题逻辑CPL的代数语义，并通过与2可除$\ell u$-群的对应关系，给出了CPL弱完备性定理的纯代数证明。
The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a one-to-one correspondence between lattice effect algebras and certain groupoids with an antitone involution. Using these groupoids, we are able to introduce a suitable logic for lattice effect algebras.
In this paper we study the tensor product for MV-algebras, the algebraic structures of Łukasiewicz $\infty$-valued logic. Our main results are: the proof that the tensor product is preserved by the categorical equivalence between the MV-algebras and abelian lattice-order groups with strong unit and the proof of the scalar extension property for semisimple MV-algebras. We explore consequences of this results for various classes of MV-algebras and lattice-ordered groups enriched with a product operation.
The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in the papers [15] and [16]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by an automorphism k-periodic (or Ck-algebras) where k is a positive integer; for k = 2 the class coincides with the one studied in [15] where the automorphism works as a new unary operator. In the first place, we prove the class Ck-algebras is a semisimple variety and we determine the generating algebras. Afterwards, we calculate the cardinality of the free Ck-algebra…
In [Mon11] are studied, for the axiomatic extensions of the monoidal t-norm based logic ([EG01]), the properties of single chain completeness. On the other side, in [GJKO07, Chapter 5] are studied many logical and algebraic properties (like Halldén completeness, variable separation properties, amalgamation property etc.), in the context of substructural logics. The aim of this paper is twofold: first of all we will specialize the properties studied in [GJKO07, Chapter 5] from the case of substructural logics to the one of extensions of MTL, by obtaining some general characterization. Moreover …
The paper has a form of a talk on the given topic. It consists of three parts. The first part of the paper contains main notions, the second one is devoted to logical geometry, the third part describes types and isotypeness. The problems are distributed in the corresponding parts. The whole material oriented towards universal algebraic geometry (UAG), i.e., geometry in an arbitrary variety of algebras $Θ$. We consider logical geometry (LG) as a part of UAG. This theory is strongly influenced by model theory and ideas of A.Tarski and A.I.Malcev.
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic dealing with cylindric and polyadic (Boolean algebras). We also prove several new neat embedding theorems, and obtain that the class of representable algebras based on (a generalized) Kripke semantics coincide with the class of algebras having the neat embedding property, that is those algebras that are subneat reducts of algebras having $ω$ extra dimensions.
The article is a study of two algebraic structures, the `contrapositionally complemented pseudo-Boolean algebra' (ccpBa) and `contrapositionally $\vee$ complemented pseudo-Boolean algebra' (c$\vee$cpBa). The algebras have recently been obtained from a topos-theoretic study of categories of rough sets. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. We study properties of these algebras, give examples, and compare them with relevant existing algebras. `Intuitionistic Log…
We introduce a universal algebraic generalization of de Jongh's notion of dependence for formulas of intuitionistic propositional logic, relating it to a notion of dependence defined by Marczewski for elements of an algebraic structure. Following ideas of de Jongh and Chagrova, we show how constructive proofs of (weak forms of) uniform interpolation can be used to decide dependence for varieties of abelian l-groups, MV-algebras, semigroups, and modal algebras. We also consider minimal provability results for dependence, obtaining in particular a complete description and decidability of depende…
A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always arises from the set theoretic complement. The corresponding propositional logic is then studied through a 3-valued and rough set semantics. It is also established that Kleene negation can be considered as a modal operator, and enables giving a perp semantics to the logic. One concludes with the observation that all the semantics for this logic are equivalent.
The unit interval in a partially ordered abelian group with order unit forms an interval effect algebra (IEA) which can be regarded as an algebraic model for the semantics of a formal deductive logic. There is a categorical equivalence between the category of IEA's and the category of unigroups enabling one to translate logical features of the IEA's to algebraic properties of the corresponding unigroup. In this article, we study the IEA-unigroup connection, focusing on the cases in which the IEA is a Boolean algebra, a quantum logic, an MV-algebra, or a Heyting MV-algebra.
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach is algebraic addressing (varieties generated by) complex algebras of Kripke semantics for such logic. Those algebras, whose elements are sets of states are common reducts of cylindric and polyadic algebras
Multialgebras (or hyperalgebras, or non-deterministic algebras) have been very much studied in Mathematics and in Computer Science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several logics of formal inconsistency (or LFIs) which cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are g…
Structural and universal completeness in algebra and logic
本文从代数与逻辑视角研究结构完备性与普遍完备性，给出拟簇的新代数刻画，并应用于有界格和子结构逻辑，完整刻画了MTL-代数的被动结构完备簇。
We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic logic does not belong to many valued logic. Generalizing results of Comer proved in the classical first order case; working out a sheaf duality on the Zarski topology defined on the prime spectrum of such algebras, we infer several definability theorems, and obtain a representation theorem for theories as continuous sections of Sheaves. We also prove an omitt…
Gödel modal logics can be seen as extenions of intutionistic modal logics with the prelinearity axiom. In this paper we focus on the algebraic and relational semantics for Gödel modal logics that leverages on the duality between finite Gödel algebras and finite forests, i.e. finite posets whose principal downsets are totally ordered. We consider different subvarieties of the basic variety of Gödel algebras with two modal operators (GAOs for short) and their corresponding classes of forest frames, either with one or two accessibility relations. These relational structures can be considered as p…
A mixed logic with binary operators
本文提出了一种包含可能性和充分性二元运算的逻辑系统，并证明了与弱混合代数相关的嵌入定理，解决了之前研究中的开放问题。
In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g. (generalized) orthomodular lattices, and MV-algebras, which admit a natural notion of implication. In fact, it turns out that skew Hilbert algebras play a similar role for (strongly) sectionally pseudocomplemented posets as Hilbert algebras do for relatively pseudocomplemented ones. We will discuss basic properties of closed, dense, and weakly dense elements …
The paper consists of two parts. The first part is devoted to logic for universal algebraic geometry. The second one deals with problems and some results. It may be regarded as a brief exposition of some ideas from the book in progress: B.Plotkin, E.Aladova, E.Plotkin, "Algebraic logic and logical geometry in arbitrary varieties of algebras"
Tense Logic via Truth Degrees: An Algebraic Completeness Result for Kashima's Calculus
本文从代数和证明论角度研究最小时态逻辑K_t，引入保真度逻辑及相继式演算，并通过Lindenbaum--Tarski构造改编，为Kashima演算建立了代数完备性定理，连接其嵌套相继式表述与时态布尔代数语义。
In this paper we continue the study of the variety $\mathbb{MG}$ of monadic Gödel algebras. These algebras are the equivalent algebraic semantics of the S5-modal expansion of Gödel logic, which is equivalent to the one-variable monadic fragment of first-order Gödel logic. We show three families of locally finite subvarieties of $\mathbb{MG}$ and give their equational bases. We also introduce a topological duality for monadic Gödel algebras and, as an application of this representation theorem, we characterize congruences and give characterizations of the locally finite subvarieties mentioned a…
Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subuintuitionistic logics, i.e., logics in the language of intuitionistic logic that are defined semantically by using Kripke models, in the same way as intuitionistic logic is defined, but without requiring of the models some of the properties required in the intuitionistic case. Also in relation with the study of subintuitionistic logics, Celani and Jansana get these algebra…
There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_α$, where $α$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the varieties of modal algebras that corresponds to the polymodal logics. We prove that the elementary theories of the free $\emptyset$-generated $GLP_{n}$ -algebras are decidable for all finite ordinals $n$.
Let L be a quantifier predicate logic. Let K be a class of algebras. We say that K is sensitive to L, if there is an algebra in K, that is L interpretable into an another algebra, and this latter algebra is elementary equivalent to an algebra not in K. (In particular, if L is L_{ω,ω}, this means that K is not elementary). We show that the class of neat reducts of every dimension is sensitive to quantifier free predicate logics with infinitary conjunctions; for finite dimensions, we do not need infinite conjunctions.
Closure algebras of depth two with extremal relations: Their frames, logics, and structural completeness
本文研究典范关系为两层且层级限制为恒等或全关系的有限闭包代数所生成的簇，刻画了相应深度二框架的逻辑及其结构完备性。
Unityped algebras
本文引入了单一类型代数的概念，并证明其与逻辑几何等价性一致，推动了普遍代数几何与模型论的交叉研究。
Recovery operators in quasi-Nelson logic: the prelinear case
研究准Nelson逻辑中的一致性和确定性算子，在预线性条件下推广了LFIs/LFUs的结果，无需对合性假设。
The main objective of this paper is to show that the notion of type which was developed within the frames of logic and model theory has deep ties with geometric properties of algebras. These ties go back and forth from universal algebraic geometry to the model theory through the machinery of algebraic logic. We show that types appear naturally as logical kernels in the Galois correspondence between filters in the Halmos algebra of first order formulas with equalities and elementary sets in the corresponding affine space.
Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved-independently of Löwenheim and Skolem's earlier work-the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also presented important programmatic remarks on the significance of the decision problem and of decision procedures more generally. The tex…
The Beth Definability Property holds for an algebraizable logic if and only if every epimorphism in the corresponding category of algebras is surjective. Using this technique, Urquhart in 1999 showed that the Beth Definability Property fails for a wide class of relevant logics, including T, E, and R. However, the counterexample for those logics does not extend to the algebraic counterpart of the super relevant logic KR, the so-called Boolean monoids. Following a suggestion of Urquhart, we use modular lattices constructed by Freese to show that epimorphisms need not be surjective in a wide clas…
Maximal theories of product logic
本文研究乘积代数的极大滤子及其与乘积hoop的关系，通过构造证明乘积hoop同构于乘积代数的极大滤子，刻画了乘积代数极大滤子的等式理论，完善了乘积逻辑的代数语义研究。
In this paper, three semilinear substructural logics ULw, IULw and HpsUL*w are constructed. Then the completeness of ULw and IULw with respect to classes of finite UL and IUL-algebras, respectively, is proved. Algebraically, non-integral ULw and IULw-algebras have the finite embeddability property, which gives a characterization for finite UL and IUL-algebras. Furthermore, the standard completeness of ULw, IULw and HpsUL*w is proved, which shows that they are substructural fuzzy logics.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。