Results 81 to 90 of about 61,871 (198)
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 The step Boolean function is a function of the algebra of logic of n Boolean variables, n = 1, 2, … , reducing to 1 on all of the sets of an n -dimensional unit cube, the ordinal numbers of which are not lower than the given set.
S.A. Lozhkin, D.S. Kinzhikeyeva
doaj +1 more source
The Boolean algebra and central Galois algebras
International Journal of Mathematics and Mathematical Sciences, 2001 Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(x)b for all x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤) generated by {0,eg∣g∈G} and a set of ...
George Szeto, Lianyong Xue
doaj +1 more source
Logical Methods in Computer ScienceThe author has recently introduced an abstract algebraic framework of analogical proportions within the general setting of universal algebra. This paper studies analogical proportions in the boolean domain consisting of two elements 0 and 1 within his ...
Christian Antić
doaj +1 more source
De Vries powers: a generalization of Boolean powers for compact Hausdorff spaces [PDF]
, 2013 We generalize the Boolean power construction to the setting of compact Hausdorff spaces. This is done by replacing Boolean algebras with de Vries algebras (complete Boolean algebras enriched with proximity) and Stone duality with de Vries duality.
Bezhanishvili, Guram +3 more
core
Zarankiewicz bounds from distal regularity lemma
Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
ROUGH LATTICE OVER BOOLEAN ALGEBRA
Journal of New Theory, 2015 − Rough Set Theory (RST) is a mathematical formalism for representing uncertainty thatcan be considered as an extension of the classical set theory. It has been used in many differentresearch areas, including those related to inductive machine learning ...
Dipankar Rana, Sankar Kumar Roy
doaj
A Boolean algebra for genetic variants. [PDF]
Bioinformatics, 2023 Vis JK +3 more
europepmc +1 more source
Is Quantum Field Theory Necessarily “Quantum”?
Quantum ReportsThe mathematical universe of the quantum topos, which is formulated on the basis of classical Boolean snapshots, delivers a neo-realist description of quantum mechanics that preserves realism.
Ali Shojaei-Fard
doaj +1 more source
Universal logic-in-memory cell enabling all basic Boolean algebra logic. [PDF]
Sci Rep, 2022 Baek E, Cho K, Kim S.
europepmc +1 more source
Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors [PDF]
Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘
Philip Meguire
core