Related papers: On Boolean reliability algebra
In the subjective Bayesian approach uncertainty is described by a prior distribution chosen by the statistician. Fuzzy set theory is another way of representing uncertainty. Here we give a decision theoretic approach which allows a Bayesian…
Geometric modeling of multivariate reliability polynomials is based on algebraic hypersurfaces, constant level sets, rulings etc. The solved basic problems are: (i) find the reliability polynomial using the Maple and Matlab software…
Using the concept of fuzzy field, we have considered the fuzzy field of real and complex numbers and thereafter we have established a few standard results of real and complex numbers with respect to a membership function.
We study betweenness of membership functions in the fuzzy setting and for membership functions taking values in the set of hyperbolic numbers.
The concept of boolean autonomous deterministic regular asynchronous system has its origin in switching theory, the theory of modeling the switching circuits from the digital electrical engineering. The attribute boolean vaguely refers to…
We propose a classification of measurement apparatuses based on their reliability and accessibility. Our notion of reliability parameterises the possibility of getting unexpected wrong results when using the apparatus in a given time…
In a recent paper [1] we introduced the Fuzzy Bayesian Learning (FBL) paradigm where expert opinions can be encoded in the form of fuzzy rule bases and the hyper-parameters of the fuzzy sets can be learned from data using a Bayesian…
In this paper we focus on algebraic aspects of contractions of Lie and Leibniz algebras. The rigidity of algebras plays an important role in the study of their varieties. The rigid algebras generate the irreducible components of this…
In this paper, We have introduced a new class of sequences of fuzzy numbers defined by using modulus function and generalized weighted mean over the class defined in \cite{OS}. We have proved that this class form a quasilinear complete…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
The classical concept of bounded completeness and its relation to sufficiency and ancillarity play a fundamental role in unbiased estimation, unbiased testing, and the validity of inference in the presence of nuisance parameters. In this…
This article explores the connection between boolean-valued class models of set theory and the theory of arbitrary objects in roughly Kit Fine's sense of the word. In particular, it explores the hypothesis that the set theoretic universe as…
The likelihood function represents statistical evidence in the context of data and a probability model. Considerable theory has demonstrated that evidence strength for different parameter values can be interpreted from the ratio of…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
Linearizability is the strongest correctness property for both shared memory and message passing systems. One of its useful features is the compositionality: a history (execution) is linearizable if and only if each object (component)…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
Evaluating argument strength in quantitative argumentation systems has received increasing attention in the field of abstract argumentation. The concept of acceptability degree is widely adopted in gradual semantics, however, it may not be…
We study in general algebras Gratzer's notion of congruence preserving function, characterizing functions in terms of stability under inverse image of particular Boolean algebras of subsets generated from any subset of the algebra.…
In this paper, we show that coherent sets of gambles and coherent lower and upper previsions can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical…