Commutative pseudo-equality algebras

Commutative pseudo-equality algebras Pseudo-equality algebras were initially introduced by Jenei and Kóródi as a possible algebraic semantic for fuzzy-type theory, and they have been revised by Dvurečenskij and Zahiri under the name of JK-algebras. In this paper, we define and study the commutative pseudo-equality algebras. We give a characterization of commutative pseudo-equality algebras, and we prove that an invariant pseudo-equality algebra is commutative if and only if its corresponding pseudo-BCK(pC)-meet-semilattice is commutative. Other results consist of proving that every commutative pseudo-equality algebra is a distributive lattice and every finite invariant commutative pseudo-equality algebra is a symmetric pseudo-equality algebra. We introduce the notion of a commutative deductive system of a pseudo-equality algebra, and we give equivalent conditions for this notion. As applications of these notions and results, we define and study the measures and measure morphisms on pseudo-equality algebras, we prove new properties of state pseudo-equality algebras, and we introduce and investigate the pseudo-valuations on pseudo-equality algebras. We prove that any measure morphism on a pseudo-equality algebra is a measure on it, and the kernel of a measure is a commutative deductive system. We show that the quotient pseudo-equality algebra over the kernel of a measure is a commutative pseudo-equality algebra. It is also proved that a pseudo-equality algebra possessing an order-determining system is commutative. We prove that the two types of internal states on a pseudo-equality algebra coincide if and only if it is a commutative pseudo-equality algebra. Given a pseudo-equality algebra A, it is proved that the kernel of a commutative pseudo-valuation on A is a commutative deductive system of A. If, moreover, A is commutative, then we prove that any pseudo-valuation on A is commutative. Soft Computing Springer Journals

Commutative pseudo-equality algebras

Loading next page...
Springer Berlin Heidelberg
Copyright © 2016 by Springer-Verlag Berlin Heidelberg
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics
Publisher site
See Article on Publisher Site


You’re reading a free preview. Subscribe to read the entire article.

DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches


Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.



billed annually
Start Free Trial

14-day Free Trial