Displaying similar documents to “Minimal and maximal sets of Bell-type inequalities holding in a logic.”

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.