SearcharxivSearch

arXiv · 1602.07828

State pseudo equality algebras

Abstract

Pseudo equality algebras were initially introduced by Jenei and $\rm K\acute{o}r\acute{o}di$ as a possible algebraic semantic for fuzzy type theory, and they have been revised by Dvure\v censkij and Zahiri under the name of JK-algebras. The aim of this paper is to investigate the internal states and the state-morphisms on pseudo equality algebras. We define and study new classes of pseudo equality algebras, such as commutative, symmetric, pointed and compatible pseudo equality algebras. We prove that any internal state (state-morphism) on a pseudo equality algebra is also an internal state (state-morphism) on its corresponding pseudo BCK(pC)-meet-semilattice, and we prove the converse for the case of linearly ordered symmetric pseudo equality algebras. We also show that any internal state (state-morphism) on a pseudo BCK(pC)-meet-semilattice is also an internal state (state-morphism) on its corresponding pseudo equality algebra. The notion of a Bosbach state on a pointed pseudo equality algebra is introduced and proved that any Bosbach state on a pointed pseudo equality algebra is also a Bosbach state on its corresponding pointed pseudo BCK(pC)-meet-semilattice. For the case of an invariant pointed pseudo equality algebra, we show that the Bosbach states on the two structures coincide.

Explore related subjects

Keep this discovery

BibTeXRIS

Lavinia Corina Ciungu. 2016-02-25. State pseudo equality algebras. https://arxiv.org/abs/1602.07828

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO