The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and the (...) Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (shrink)

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and Δ-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics–namely the class of algebras defined over the real unit (...) interval, the rational unit interval, the hyperreals , the strict hyperreals and finite chains, respectively–and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. (shrink)

A simple complete axiomatic system is presented for the many-valued propositional logic based on the conjunction interpreted as product, the coresponding implication (Goguen's implication) and the corresponding negation (Gödel's negation). Algebraic proof methods are used. The meaning for fuzzy logic (in the narrow sense) is shortly discussed.

Residuated fuzzy logic calculi are related to continuous t-norms, which are used as truth functions for conjunction, and their residua as truth functions for implication. In these logics, a negation is also definable from the implication and the truth constant $\overline{0}$ , namely $\neg \varphi$ is $\varphi \to \overline{0}$. However, this negation behaves quite differently depending on the t-norm. For a nilpotent t-norm (a t-norm which is isomorphic to Łukasiewicz t-norm), it turns out that $\neg$ is an involutive negation. However, (...) for t-norms without non-trivial zero divisors, $\neg$ is Gödel negation. In this paper we investigate the residuated fuzzy logics arising from continuous t-norms without non-trivial zero divisors and extended with an involutive negation. (shrink)

The monoidal t-norm based logic MTL is obtained from Hájek''s Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (...) (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics. (shrink)

The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0, 1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness of (...) some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0, 1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics. (shrink)

In this paper we provide a finite axiomatization (using two finitary rules only) for the propositional logic (called $L\Pi$ ) resulting from the combination of Lukasiewicz and Product Logics, together with the logic obtained by from $L \Pi$ by the adding of a constant symbol and of a defining axiom for $\frac{1}{2}$ , called $L \Pi\frac{1}{2}$ . We show that $L \Pi \frac{1}{2}$ contains all the most important propositional fuzzy logics: Lukasiewicz Logic, Product Logic, Gödel's Fuzzy Logic, Takeuti and Titani's (...) Propositional Logic, Pavelka's Rational Logic, Pavelka's Rational Product Logic, the Lukasiewicz Logic with $\Delta$ , and the Product and Gödel's Logics with $\Delta$ and involution. Standard completeness results are proved by means of investigating the algebras corresponding to $L \Pi$ and $L \Pi \frac{1}{2}$ . For these algebras, we prove a theorem of subdirect representation and we show that linearly ordered algebras can be represented as algebras on the unit interval of either a linearly ordered field, or of the ordered ring of integers, Z. (shrink)

This article proposes the meeting of fuzzy logic with paraconsistency in a very precise and foundational way. Specifically, in this article we introduce expansions of the fuzzy logic MTL by means of primitive operators for consistency and inconsistency in the style of the so-called Logics of Formal Inconsistency (LFIs). The main novelty of the present approach is the definition of postulates for this type of operators over MTL-algebras, leading to the definition and axiomatization of a family of logics, expansions of (...) MTL, whose degree-preserving counterpart are paraconsistent and moreover LFIs. (shrink)

IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an involutive negation and their residua. The structure of such t-norms is still not known. Nevertheless, Jenei introduced in [20] a new way to obtain rotation-invariant semigroups and, in particular, IMTL-algebras and left-continuous t-norm with an involutive negation, by means of the disconnected rotation method. In order to give an algebraic interpretation (...) to this construction, we generalize the concepts of perfect, bipartite and local algebra used in the classification of MV-algebras to the wider variety of IMTL-algebras and we prove that perfect algebras are exactly those algebras obtained from a prelinear semihoop by Jenei's disconnected rotation. We also prove that the variety generated by all perfect IMTL-algebras is the variety of the IMTL-algebras that are bipartite by every maximal filter and we give equational axiomatizations for it. (shrink)

In this paper we carry out an algebraic investigation of the weak nilpotent minimum logic and its t-norm based axiomatic extensions. We consider the algebraic counterpart of WNM, the variety of WNM-algebras and prove that it is locally finite, so all its subvarieties are generated by finite chains. We give criteria to compare varieties generated by finite families of WNM-chains, in particular varieties generated by standard WNM-chains, or equivalently t-norm based axiomatic extensions of WNM, and we study their standard completeness (...) properties. We also characterize the generic WNM-chains, i. e. those that generate the variety [MATHEMATICAL DOUBLE-STRUCK CAPITAL W]ℕ[MATHEMATICAL DOUBLE-STRUCK CAPITAL M], and we give finite axiomatizations for some t-norm based extensions of WNM. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb Log (...) 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

In this paper we study and equationally characterize the subvarieties of BL, the variety of BL-algebras, which are generated by families of single-component BL-chains, i.e. MV-chains, Product-chain or Gödel-chains. Moreover, it is proved that they form a segment of the lattice of subvarieties of BL which is bounded by the Boolean variety and the variety generated by all single-component chains, called ŁΠG.

In this paper we study intermediate logics between the logic G≤∼, the degree preserving companion of Gödel fuzzy logic with involution G∼ and classical propositional logic CPL, as well as the intermediate logics of their finite-valued counterparts G≤n∼. Although G≤∼ and G≤ are explosive w.r.t. Gödel negation ¬, they are paraconsistent w.r.t. the involutive negation ∼. We introduce the notion of saturated paraconsistency, a weaker notion than ideal paraconsistency, and we fully characterize the ideal and the saturated paraconsistent logics between (...) G≤n∼ and CPL. We also identify a large family of saturated paraconsistent logics in the family of intermediate logics for degree-preserving finite-valued Łukasiewicz logics. (shrink)

A symmetric residuated lattice is an algebra such that is a commutative integral bounded residuated lattice and the equations x=x and =xy are satisfied. The aim of the paper is to investigate the properties of the unary operation ε defined by the prescription εx=x→0. We give necessary and sufficient conditions for ε being an interior operator. Since these conditions are rather restrictive →0)=1 is satisfied) we consider when an iteration of ε is an interior operator. In particular we consider the (...) chain of varieties of symmetric residuated lattices such that the n iteration of ε is a boolean interior operator. For instance, we show that these varieties are semisimple. When n=1, we obtain the variety of symmetric stonean residuated lattices. We also characterize the subvarieties admitting representations as subdirect products of chains. These results generalize and in many cases also simplify, results existing in the literature. (shrink)

This paper aims at being a systematic investigation of different completeness properties of first-order predicate logics with truth-constants based on a large class of left-continuous t-norms . We consider standard semantics over the real unit interval but also we explore alternative semantics based on the rational unit interval and on finite chains. We prove that expansions with truth-constants are conservative and we study their real, rational and finite chain completeness properties. Particularly interesting is the case of considering canonical real and (...) rational semantics provided by the algebras where the truth-constants are interpreted as the numbers they actually name. Finally, we study completeness properties restricted to evaluated formulae of the kind , where φ has no additional truth-constants. (shrink)

In this paper we prove strong completeness of axiomatic extensions of first-order strict core fuzzy logics with the so-called quasi-witnessed axioms with respect to quasi-witnessed models. As a consequence we obtain strong completeness of Product Predicate Logic with respect to quasi-witnessed models, already proven by M.C. Laskowski and S. Malekpour in [19]. Finally we study similar problems for expansions with Δ, define Δ-quasi-witnessed axioms and prove that any axiomatic extension of a first-order strict core fuzzy logic, expanded with Δ, and (...) Δ-quasi-witnessed axioms are complete with respect to Δ-quasi-witnessed models. (shrink)

In this paper we provide a simplified, possibilistic semantics for the logics K45, i.e. a many-valued counterpart of the classical modal logic K45 over the [0, 1]-valued Gödel fuzzy logic \. More precisely, we characterize K45 as the set of valid formulae of the class of possibilistic Gödel frames \, where W is a non-empty set of worlds and \ is a possibility distribution on W. We provide decidability results as well. Moreover, we show that all the results also apply (...) to the extension of K45 with the axiom, provided that we restrict ourselves to normalised Gödel Kripke frames, i.e. frames \ where \ satisfies the normalisation condition \ = 1\). (shrink)