Results 1 to 10 of about 73,527 (164)
Reconstructing Classical Algebras via Ternary Operations
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified using ternary operations.
Jorge P. Fatelo, Nelson Martins-Ferreira
doaj +4 more sources
SOME FUNDAMENTAL PROPERTIES OF HEAPS
Heap is defined to be a non-empty set with ternary operation satisfying associativity, that is for every and satisfying Mal’cev identity, that is for all . There is a connection between heaps and groups.
Dwi Mifta Mahanani, Dewi Ismiarti
doaj +1 more source
Ternary Menger Algebras: A Generalization of Ternary Semigroups
Let n be a fixed natural number. Menger algebras of rank n, which was introduced by Menger, K., can be regarded as the suitable generalization of arbitrary semigroups.
Anak Nongmanee, Sorasak Leeratanavalee
doaj +1 more source
Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras [PDF]
Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of relational convolution
Brijesh Dongol +2 more
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Pluta, Bernard Russo
openaire +3 more sources
Ternary semigroups of topological transformations
A ternary semigroup is a nonempty set with a ternary operation which is associative. The purpose of the present paper is to give a characterization of open sets of finite-dimensional Euclidean spaces by ternary semigroups of pairs of homeomorphic ...
F.Kh. Muradov
doaj +1 more source
In this study, the logic‐in‐memory operations are demonstrated of ternary NAND and NOR logic gates consisting of double‐gated feedback field‐effect transistors.
Jaemin Son +3 more
doaj +1 more source
This paper presents a method for building a programming platform for ternary optical computer(TOC). Firstly, the reasons why the existing programming platform can not be directly applied to the ternary optical computer are analyzed. Then, the theoretical
Shuang Li +3 more
doaj +1 more source
Ternary Full Adder Designs Employing Unary Operators and Ternary Multiplexers
The design of the Ternary Full Adders (TFA) employing Carbon Nanotube Field-Effect Transistors (CNFET) has been widely presented in the literature. To obtain the optimal design of these ternary adders, we propose two new different designs, TFA1 with 59 CNFETs and TFA2 with 55 CNFETs, that use unary operator gates with two voltage supplies (Vdd and Vdd ...
Ramzi A. Jaber +3 more
openaire +4 more sources
TERNARY ∗-BANDS ARE GLOBALLY DETERMINED
A non-empty set \(S\) together with the ternary operation denoted by juxtaposition is said to be ternary semigroup if it satisfies the associativity property \(ab(cde)=a(bcd)e=(abc)de\) for all \(a,b,c,d,e\in S\).
Indrani Dutta, Sukhendu Kar
doaj +1 more source

