Generalized join-hemimorphisms on Boolean algebras.
Celani, Sergio (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Celani, Sergio (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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].
Ž. Mijajlović (1974)
Matematički Vesnik
Similarity:
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.
Bernasconi, Anna (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
L. Szczerba (1973)
Fundamenta Mathematicae
Similarity:
Sergiu Rudeanu (2007)
Mathematica Slovaca
Similarity:
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).