Article
Licensed
Unlicensed
Requires Authentication
Finite probabilistic structures
-
V. V. Maximov
Published/Copyright:
September 30, 2008
Abstract
Consideration of the field of events in the theory of probability gives rise to the notion of the field of events ℱ(B) consisting of a set of subsets of some set B. On the field ℱ(B), two algebraic structures are naturally defined. These are the Boolean algebra 
(ℱ(B)) with the operations of union, intersection and complement, and the lattice L(ℱ(B)), where the order is defined according to inclusion of the sets of ℱ(B). In this paper, we consider one more algebraic structure on ℱ(B) and the abstract variant of this structure, the so-called probabilistic structure, which is closely related to properties of the measure on ℱ(B).
Received: 2007-05-15
Revised: 2008-06-20
Published Online: 2008-09-30
Published in Print: 2008-October
© de Gruyter 2008
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
Articles in the same Issue
- Finite probabilistic structures
- Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns
- A simple upper bound for the number of spanning trees of regular graphs
- Dynamic databases with optimal in order time complexity
- The closure operator with the equality predicate branching on the set of partial Boolean functions
- The fundamental difference between depth and delay
- Homomorphisms of shift registers into linear automata
- Provable security of digital signatures in the tamper-proof device model
- Local factorisations of nonlocal Fitting classes
