We characterize measures on free Boolean algebras and we examine the relationships that exists between measures and binary tables in relational databases. It is shown that these measures are completely defined by their values on positive conjunctions and an algorithm that leads to the construction of measures starting from its values on positive conjunction is also given, including a formula that allows the evaluation of measures for arbitrary polynomials. Finally, we study pairs of measures generated by ternary tables, that is, by tables that contain missing or unknown values. 1
We mimic the construction of guarded algebras and show how to extract a Church algebra out of the bi...
AbstractFor the case where B is a Boolean algebra of events and P is a probability (finitely additiv...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
In this section we begin a systematic study of algebras given by algebraic measures.Knowing that \ud...
Deals with cardinal number valued functions defined for any Boolean algebra. This title considers th...
This book is concerned with cardinal number valued functions defined for any Boolean algebra. Exampl...
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positiv...
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positiv...
A Borel probability measure is residual if it gives measure zero to all meager subsets. We first giv...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
AbstractWe investigate properties of minimally generated Boolean algebras. It is shown that all meas...
AbstractWe modify an example of Gaifman and obtain a boolean algebra B which has no positive measure...
Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure. They were ...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We mimic the construction of guarded algebras and show how to extract a Church algebra out of the bi...
AbstractFor the case where B is a Boolean algebra of events and P is a probability (finitely additiv...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
In this section we begin a systematic study of algebras given by algebraic measures.Knowing that \ud...
Deals with cardinal number valued functions defined for any Boolean algebra. This title considers th...
This book is concerned with cardinal number valued functions defined for any Boolean algebra. Exampl...
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positiv...
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positiv...
A Borel probability measure is residual if it gives measure zero to all meager subsets. We first giv...
We consider the theory of database queries on a relational data model that includes a set of fixed r...
AbstractWe investigate properties of minimally generated Boolean algebras. It is shown that all meas...
AbstractWe modify an example of Gaifman and obtain a boolean algebra B which has no positive measure...
Maharam algebras are complete Boolean algebras carrying a positive continuous submeasure. They were ...
In this paper, the support of a Boolean function is used to establish some algebraic properties. The...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
We mimic the construction of guarded algebras and show how to extract a Church algebra out of the bi...
AbstractFor the case where B is a Boolean algebra of events and P is a probability (finitely additiv...
We consider the theory of database queries on a relational data model that includes a set of fixed r...