It is a well-known fact that MV-algebras, the algebraic counterpart of Łukasiewicz logic, correspond to a certain type of partial algebras: lattice-ordered effect algebras fulfilling the Riesz decomposition property. The latter are based on a partial, but cancellative addition, and we may construct from them the representing ℓ-groups in a straightforward manner. In this paper, we consider several logics differing from Łukasiewicz logics in that they contain further connectives: the PŁ-, PŁ'-, PŁ'△-, and ŁΠ-logics. For all their algebraic counterparts, we (...) characterise the corresponding type of partial algebras. We moreover consider the representing f-rings. All in all, we get three-fold correspondences: the total algebras - the partial algebras - the representing rings. (shrink)

The last decade has seen an enormous development in infinite-valued systems and in particular in such systems which have become known as mathematical fuzzy logics. The paper discusses the mathematical background for the interest in such systems of mathematical fuzzy logics, as well as the most important ones of them. It concentrates on the propositional cases, and mentions the first-order systems more superficially. The main ideas, however, become clear already in this restricted setting.

In this paper we provide a categorical equivalence for the category \ of product algebras, with morphisms the homomorphisms. The equivalence is shown with respect to a category whose objects are triplets consisting of a Boolean algebra B, a cancellative hoop C and a map \ from B × C into C satisfying suitable properties. To every product algebra P, the equivalence associates the triplet consisting of the maximum boolean subalgebra B, the maximum cancellative subhoop C, of P, and the (...) restriction of the join operation to B × C. Although several equivalences are known for special subcategories of \ , up to our knowledge, this is the first equivalence theorem which involves the whole category of product algebras. The syntactic counterpart of this equivalence is a syntactic reduction of classical logic CL and of cancellative hoop logic CHL to product logic, and viceversa. (shrink)

We investigate the variety corresponding to a logic, which is the combination of ukasiewicz Logic and Product Logic, and in which Gödel Logic is interpretable. We present an alternative axiomatization of such variety. We also investigate the variety, called the variety of algebras, corresponding to the logic obtained from by the adding of a constant and of a defining axiom for one half. We also connect algebras with structures, called f-semifields, arising from the theory of lattice-ordered rings, and prove that (...) every algebra can be regarded as a structure whose domain is the interval [0, 1] of an f-semifield, and whose operations are the truncations of the operations of to [0, 1]. We prove that such a structure is uniquely determined by up to isomorphism, and we establish an equivalence between the category of algebras and that of f-semifields. (shrink)

Product logic Π is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for Π but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for Π and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.

This work presents a model-theoretic approach to the study of the amalgamation property for varieties of semilinear commutative residuated lattices. It is well-known that if a first-order theory T enjoys quantifier elimination in some language L, the class of models of the set of its universal consequences \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm T_\forall}$$\end{document} has the amalgamation property. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}(\mathbb{K})}$$\end{document} be the theory of an elementary subclass (...) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{K}}$$\end{document} of the linearly ordered members of a variety \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} of semilinear commutative residuated lattices. We show that whenever \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}(\mathbb{K})}$$\end{document} has elimination of quantifiers, and every linearly ordered structure in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} is a model of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}_\forall(\mathbb{K})}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} has the amalgamation property. We exploit this fact to provide a purely model-theoretic proof of amalgamation for particular varieties of semilinear commutative residuated lattices. (shrink)

This paper continues the investigation, started in Lávička and Noguera : 521–551, 2017), of infinitary propositional logics from the perspective of their algebraic completeness and filter extension properties in abstract algebraic logic. If follows from the Lindenbaum Lemma used in standard proofs of algebraic completeness that, in every finitary logic, intersection-prime theories form a basis of the closure system of all theories. In this article we consider the open problem of whether these properties can be transferred to lattices of filters (...) over arbitrary algebras of the logic. We show that in general the answer is negative, obtaining a richer hierarchy of pairwise different classes of infinitary logics that we separate with natural examples. As by-products we obtain a characterization of subdirect representation for arbitrary logics, develop a fruitful new notion of natural expansion, and contribute to the understanding of semilinear logics. (shrink)

Classification of certain group-like FL $_e$ -chains is given: We define absorbent-continuity of FL $_e$ -algebras, along with the notion of subreal chains, and classify absorbent-continuous, group-like FL $_e$ -algebras over subreal chains: The algebra is determined by its negative cone, and the negative cone can only be chosen from a certain subclass of BL-chains, namely, one with components which are either cancellative (that is, those components are negative cones of totally ordered Abelian groups) or two-element MV-algebras, and with no (...) two consecutive cancellative components. It is shown that the classification theorem does not hold if we drop the absorbent-continuity condition. Our result is the first classification theorem in the literature on FL $_e$ -algebras that does not assume the condition of being naturally ordered (which, under certain conditions, corresponds to continuity of the monoid operation). In our classification theorem, continuity is replaced by the much weaker absorbent-continuity. (shrink)

The paper presents a particular example of a formula which is a standard tautology of Łukasiewicz but not its general tautology; an example of a model in which the formula is not true is explicitly constructed. Analogous example of a formula and its model is given for product logic.

ABSTRACT The term fuzzy logic has two different meanings -broad and narrow. In Zadeh's opinion, fuzzy logic is an extension of many- valued logic but having a different agenda—as generalized modus ponens, max-min inference, linguistic quantifiers etc. The question we address in this paper is whether there is something in Zadeh's specific agenda which cannot be grasped by “classiceli”, “traditional” mathematical logic. We show that much of fuzzy logic can be understood as classical deduction in a many-sorted many-valued Pavelka- Lukasiewicz (...) style rational quantification logic. This means that, besides the linguistic or approximation aspects, the logical aspect is present too and can be made explicit. (shrink)

The logics RŁ, RP, and RG have been obtained by expanding Łukasiewicz logic Ł, product logic P, and Gödel–Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions, obtaining results that stand in contrast to the known situation in Ł, P, and G. Namely, RŁ is hereditarily structurally complete. RP is algebraized by the variety of rational product algebras that we show to be Q-universal. We provide a base of admissible rules (...) in RP, show their decidability, and characterize passive structural completeness for extensions of RP. Furthermore, structural completeness, hereditary structural completeness, and active structural completeness coincide for extensions of RP, and this is also the case for extensions of RG, where in turn passive structural completeness is characterized by the equivalent algebraic semantics having the joint embedding property. For nontrivial axiomatic extensions of RG, we provide a base of admissible rules. We leave the problem open whether the variety of rational Gödel algebras is Q-universal. (shrink)

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...) with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACSs A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. (shrink)

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)

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)

This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.

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)

Formal systems of fuzzy logic are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider (...) scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction. (shrink)

In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of logics expanding Leibniz (...) hierarchy: the hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an implicational semilinear logic iff it has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples of fuzzy logics and suggests new directions for research in the field. (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 many-valued logics with the unit interval as the set of truth values, from the standard negation and the product (or, more generally, from any strict Frank t-norm) all measurable logical functions can be derived, provided that also operations with countable arity are allowed. The question remained open whether there are other t-norms with this property or whether all strict t-norms possess this property. We give a full solution to this problem (in the case of strict t-norms), together with convenient (...) sufficient conditions. We list several families of strict t-norms having this property and provide also counterexamples (the Hamacher product is one of them). Finally, we discuss the consequences of these results for the characterization of tribes based on strict t-norms. (shrink)

In Hájek et al. (J Symb Logic 65(2):669–682, 2000) the authors introduce the concept of supersound logic, proving that first-order Gödel logic enjoys this property, whilst first-order Łukasiewicz and product logics do not; in Hájek and Shepherdson (Ann Pure Appl Logic 109(1–2):65–69, 2001) this result is improved showing that, among the logics given by continuous t-norms, Gödel logic is the only one that is supersound. In this paper we will generalize the previous results. Two conditions will be presented: the first (...) one implies the supersoundness and the second one non-supersoundness. To develop these results we will use, between the other machineries, the techniques of completions of MTL-chains developed in Labuschagne and van Alten (Proceedings of the ninth international conference on intelligent technologies, 2008) and van Alten (2009). We list some of the main results. The first-order versions of MTL, SMTL, IMTL, WNM, NM, RDP are supersound; the first-order version of an axiomatic extension of BL is supersound if and only it is n-potent (i.e. it proves the formula ${\varphi^{n}\,\to\,\varphi^{n\,{+}\,1}}$ for some ${n\,\in\,\mathbb{N}^+}$ ). Concerning the negative results, we have that the first-order versions of ΠMTL, WCMTL and of each non-n-potent axiomatic extension of BL are not supersound. (shrink)

We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.

A t-tautology is a propositional formula which is a tautology in all fuzzy logics defined by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable.

A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that ([ 0,1], *, 1) is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and ([ 0,1], *, →, 1) becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras ([ 0,1], *, →, 1), where (...) * is a continuous t-norm. In this paper we investigate the structure of the variety of basic hoops and some of its subvarieties. In particular we provide a complete description of the finite subdirectly irreducible basic hoops, and we show that the variety of basic hoops is generated as a quasivariety by its finite algebras. We extend these results to Hájek's BL-algebras, and we give an alternative proof of the fact that the variety of BL-algebras is generated by all algebras arising from continuous t-norms on [ 0,1] and their residua. The last part of the paper is devoted to the investigation of the subreducts of BL- algebras, of Gödel algebras and of product algebras. (shrink)

A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras, where * is a continuous t-norm. In this paper we investigate the structure of the (...) variety of basic hoops and some of its subvarieties. In particular we provide a complete description of the finite subdirectly irreducible basic hoops, and we show that the variety of basic hoops is generated as a quasivariety by its finite algebras. We extend these results to Hájek's BL-algebras, and we give an alternative proof of the fact that the variety of BL-algebras is generated by all algebras arising from continuous t-norms on [ 0,1] and their residua. The last part of the paper is devoted to the investigation of the subreducts of BL- algebras, of Gödel algebras and of product algebras. (shrink)

In this paper we prove the equivalence between the Gentzen system G LJ*\c , obtained by deleting the contraction rule from the sequent calculus LJ* (which is a redundant version of LJ), the deductive system IPC*\c and the equational system associated with the variety RL of residuated lattices. This means that the variety RL is the equivalent algebraic semantics for both systems G LJ*\c in the sense of [18] and [4], respectively. The equivalence between G LJ*\c and IPC*\c is a (...) strengthening of a result obtained by H. Ono and Y. Komori [14, Corollary 2.8.1] and the equivalence between G LJ*\c and the equational system associated with the variety RL of residuated lattices is a strengthening of a result obtained by P.M. Idziak [13, Theorem 1].An axiomatization of the restriction of IPC*\c to the formulas whose main connective is the implication connective is obtained by using an interpretation of G LJ*\c in IPC*\c. (shrink)