The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Didactical note: probabilistic conditionality in a Boolean algebra.”

Modus ponens on Boolean algebras revisited.

Enric Trillas, Susana Cubillo (1996)

Mathware and Soft Computing

Similarity:

In a Boolean Algebra B, an inequality f(x,x --> y)) ≤ y satisfying the condition f(1,1)=1, is considered for defining operations a --> b among the elements of B. These operations are called Conditionals'' for f. In this paper, we obtain all the boolean Conditionals and Internal Conditionals, and some of their properties as, for example, monotonicity are briefly discussed.

Relational probabilities on intuitionistic lattices.

Enric Trillas (1988)

Stochastica

Similarity:

In this paper we present and develop, only elementarily, an axiomatic frame for some special fuzzy relations, the so called relational probabilities, which happen to be families of functions which in some cases are quantic probabilities [1] on sublattices of a given lattice; in this way we obtain calculations similar to the ordinary ones but based on a weaker lattice background. This framework is inspired on the presentation of conditional probability on Boolean algebras made in [5]...

On Boolean modus ponens.

Sergiu Rudeanu (1998)

Mathware and Soft Computing

Similarity:

An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].