3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Some properties of pseudo-BCK- and pseudo-BCI-algebras

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Pseudo-BCI-algebras generalize both BCI-algebras and pseudo-BCK-algebras, which are a non-commutative generalization of BCK-algebras. In this paper, following [J.G. Raftery and C.J. van Alten, Residuation in commutative ordered monoids with minimal zero, Rep. Math. Log. 34 (2000) 23-57], we show that pseudo-BCI-algebras are the residuation subreducts of semi-integral residuated po-monoids and characterize those pseudo-BCI-algebras which are direct products of pseudo-BCK-algebras and groups (regarded as pseudo-BCI-algebras). We also show that the quasivariety of pseudo-BCI-algebras is relatively congruence modular; in fact, we prove that this holds true for all relatively point regular quasivarieties which are relatively ideal determined, in the sense that the kernels of relative congruences can be described by means of ideal terms.

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Article: not found

          An algebra related with a propositional calculus

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Ideals in universal algebras

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Logics without the contraction rule

              We will study syntactical and semantical properties of propositional logics weaker than the intuitionistic, in which the contraction rule (or, the exchange rule or the weakening rule, in some cases) does not hold. Here, the contraction rule means the rule of inference of the form if we formulate our logics in a Gentzen-type formal system. Some syntactical properties of these logics have been studied firstly by the second author in [11], in connection with the study of BCK-algebras (for information on BCK-algebras, see [9]). There, it turned out that such a syntactical method is a powerful and promising tool in studying BCK-algebras. Using this method, considerable progress has been made since then (see, e.g., [8], [18], [27]). In this paper, we will study these logics more comprehensively. We notice here that the distributive law does not hold necessarily in these logics. By adding some axioms (or initial sequents) and rules of inference to these basic logics, we can obtain a lot of interesting nonclassical logics such as Łukasiewicz's many-valued logics, relevant logics, the intuitionistic logic and logics related to BCK-algebras, which have been studied separately until now. Thus, our approach will give a uniform way of dealing with these logics. One of our two main tools in doing so is Gentzen-type formulation of logics in syntax, and the other is semantics defined by using partially ordered monoids.
                Bookmark

                Author and article information

                Journal
                31 August 2018
                Article
                10.1016/j.fss.2016.12.014
                1808.10697
                a8b2835c-063b-4bcc-bbc7-e26c0b7f7ca6

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Fuzzy Sets and Systems 339 (2018) 1-16
                math.RA

                Algebra
                Algebra

                Comments

                Comment on this article