It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...