Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.03035

Fantastic deductive systems in probability theory on generalizations of fuzzy structures

Lavinia Corina Ciungu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The aim of this paper is to introduce the notion of fantastic deductive systems on generalizations of fuzzy structures, and to emphasize their role in the probability theory on these algebras. We give a characterization of commutative pseudo-BE algebras and we generalize an axiom system consisting of four identities to the case of commutative pseudo-BE algebras. We define the fantastic deductive systems of pseudo-BE algebras and we investigate their properties. It is proved that, if a pseudo-BE(A) algebra $A$ is commutative, then all deductive systems of $A$ are fantastic. Moreover, we generalize the notions of measures, state-measures and measure-morphisms to the case of pseudo-BE algebras and we also prove that there is a one-to-one correspondence between the set of all Bosbach states on a bounded pseudo-BE algebra and the set of its state-measures. The notions of internal states and state-morphism operators on pseudo-BCK algebras are extended to the case of pseudo-BE algebras and we also prove that any type II state operator on a pseudo-BE algebra is a state-morphism operator on it. The notions of pseudo-valuation and commutative pseudo-valuation on pseudo-BE algebras are defined and investigated. For the case of commutative pseudo-BE algebras we prove that the two kind of pseudo-valuations coincide. Characterizations of pseudo-valuations and commutative pseudo-valuations are given. We show that the kernel of a Bosbach state (state-morphism, measure, type II state operator, pseudo-valuation) is a fantastic deductive system.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Lavinia Corina Ciungu. 2017-09-10. Fantastic deductive systems in probability theory on generalizations of fuzzy structures. https://arxiv.org/abs/1709.03035

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗