Results 111 to 120 of about 53,255 (147)

Reconfigurable Logic Gates with in‐Plane Magnetic Tunnel Junctions Representing Full Boolean Functions

Physica Status Solidi (a), 2019
Logic functions implemented by input terminal extension are proposed, which is uniquely achievable in magnetic tunnel junctions (MTJs). With two inputs assigned by the two independent physical variables of magnetic field and spin transfer torque for each
G. Bae, Yechan Hwang, Sangmin Lee, W. Park   +3 more
semanticscholar   +1 more source

Algebraic Behavior of Idempotent Elements in Near Ring

Computational Mathematics Today
The study of Boolean near-rings and idempotent elements forms an important part of modern algebra, particularly in exploring the structural behavior of near-rings and their algebraic properties.
Ambreen Zehra, Sarwar J. Abbasi, Nazrah Shaikh   +2 more
semanticscholar   +1 more source

N-Way Joint Mutual Exclusion Does Not Imply Any Pairwise Mutual Exclusion for Propositions

arXiv.org
Given a set of N propositions, if any pair is mutual exclusive, then the set of all propositions are N-way jointly mutually exclusive. This paper provides a new general counterexample to the converse.
R. Freedman
semanticscholar   +1 more source

𝔐-Endoregular lattices

Communications in Algebra
In a previous work, (dual)-m -Rickart lattices were studied. Now, in this paper, we introduce m -endoregular lattices as those lattices L such that m is a regular monoid, where m is a submonoid with zero of Endlin(L) .
M. Medina-Bárcenas, H. Rincón-Mejía
semanticscholar   +1 more source

A Unification of Two Approaches to Vagueness: The Boolean Many-Valued Approach and the Modal-Precisificational Approach

Journal of Philosophical Logic, 2017
Ken Akiba
semanticscholar   +2 more sources

Structural Functionality as a Fundamental Property of Boolean Algebra and Base for Its Real-Valued Realizations

International Conference on Information Processing and Management of Uncertainty, 2014
D. Radojevic
semanticscholar   +1 more source

Interpolative Realization of Boolean Algebra as a Consistent Frame for Gradation and/or Fuzziness

, 2008
D. Radojevic
semanticscholar   +1 more source

Copeland Arthur H. Sr., and Harary Frank. The extension of an arbitrary Boolean algebra to an implicative Boolean algebra. Proceedings of the American Mathematical Society, vol. 4 (1953), pp. 751–758.

Journal of Symbolic Logic (JSL), 1959
K. E. Aubert
semanticscholar   +1 more source

Variational algorithms for linear algebra

Science Bulletin, 2021
Xiaosi Xu, Jinzhao Sun, Suguru Endo
exaly  

Serrell Robert. Elements of Boolean algebra for the study of information-handling systems. Proceedings of the I.R.E., vol. 41 (1953), pp. 1366–1380.Serrell Robert. Correction. Proceedings of the I.R.E., vol. 42 (1954), p. 475.

Journal of Symbolic Logic (JSL), 1954
A. Church
semanticscholar   +1 more source