Related papers: Rational Lukasiewicz logic and DMV-algebras

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

We answer Mundici's problem number 3 (D. Mundici. Advanced {\L}ukasiewicz calculus. Trends in Logic Vol. 35. Springer 2011, p. 235): Is the category of locally finite MV-algebras equivalent to an equational class? We prove: (i) The category…

The rationality and C_2-cofiniteness of the orbifold vertex operator algebra V_{L_{2}}^{A_{4}} are established and all the irreducible modules are constructed and classified. This is part of classification of rational vertex operator…

The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function…

We extend \L ukasiewicz logic obtaining the infinitary logic $\mathcal{IR}\L$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space. Equivalently, our models are unit intervals in…

Positive MV-algebras are the subreducts of MV-algebras with respect to the signature $\{\oplus, \odot, \lor, \land, 0, 1\}$. We provide a finite quasi-equational axiomatization for the class of such algebras.

In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…

Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…

Explicit formulas to calculate MV functions in a basis-free representation are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on analysis of the roots of minimal MV polynomial and covers defective MVs,…

Dynamical systems are abstract models of interaction between space and time. They are often used in fields such as physics and engineering to understand complex processes, but due to their general nature, they have found applications for…

We classify all uniserial modules of the solvable Lie algebra $\mathfrak{g}=\langle x\rangle \ltimes V$, where $V$ is an abelian Lie algebra over an algebraically closed field of characteristic 0 and $x$ is an arbitrary automorphism of $V$.

This paper is devoted to the construction of conditional logic system of {\L}ukasiewicz m-valued propositional logic. We construct conditional logic system {\L}CR based on {\L}ukasiewicz m-valued propositional logic. We construct world…

Let $n$-Medvedev's logic $\mathbf{ML}_n$ be the intuitionistic logic of Medvedev frames based on the non-empty subsets of a set of size $n$, which we call $n$-Medvedev frames. While these are tabular logics, after characterizing…

The class of defeasible logics is only vaguely defined -- it is defined by a few exemplars and the general idea of efficient reasoning with defeasible rules. The recent definition of the defeasible logic $DL(\partial_{||})$ introduced new…

Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…

Quasi-MV* algebras were introduced as generalizations of MV*-algebras and quasi-MV algebras. The recent investigation into quasi-MV* algebras shows that they are closely related to quantum computational logic and complex fuzzy logic. In…

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…

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…

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…

Building on the correspondence between finitely axiomatised theories in {\L}ukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of {\L}ukasiewicz logic with $n\geq 2$ variables is nullary. This solves…