Related papers: On Boolean reliability algebra
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…
Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…
In this work we cast the problem of binary classification in terms of estimating a partition on Bernoulli data. When the explanatory variables are all categorical, the problem can be modelled using the language of boolean functions. We…
The first step in statistical reliability studies of coherent systems is the estimation of the reliability of each system component. For the cases of parallel and series systems the literature is abundant. It seems that the present paper is…
A robust estimation framework for binary regression models is studied, aiming to extend traditional approaches like logistic regression models. While previous studies largely focused on logistic models, we explore a broader class of models…
We investigate rigidity of measurable structure for higher rank abelian algebraic actions. In particular, we show that ergodic measures for these actions fiber over a 0 entropy measure with Haar measures along the leaves. We deduce various…
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
The notion of rough set captures indiscernibility of elements in a set. But, in many real life situations, an information system establishes the relation between different universes. This gave the extension of rough set on single universal…
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…
In this paper, it shows that for each fuzzy set $u$ on $\mathbb{R}^m$, the set $D(u)$ is at most countable. Based on this, it modifies the proof of assertion (I) in step 2 of the sufficiency part of Theorem 4.1 in paper: Characterizations…
Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalized from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued…
The Sensitivity Conjecture is a long-standing problem in theoretical computer science that seeks to fit the sensitivity of a Boolean function into a unified framework formed by the other complexity measures of Boolean functions, such as…
The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…
In this paper, we show that coherent sets of gambles can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical structure of desirability and secondly, it…
In dealing with veracity of data analytics, fuzzy methods are more and more relying on probabilistic and statistical techniques to underpin their applicability. Conversely, standard statistical models usually disregard to take into account…
Rule-based classification models described in the language of logic directly predict boolean values, rather than modeling a probability and translating it into a prediction as done in statistical models. The vast majority of existing…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
We develop here a simple quantisation formalism that make use of Lie algebra properties of the Poisson bracket. When the brackets $\{H,\phi_i\}$ and $\{\phi_i,\phi_j\}$, where $H$ is the Hamiltonian and $\phi_i$ are primary and secondary…