Results 141 to 150 of about 47,397 (182)
Some of the next articles are maybe not open access.
Free algebras in varieties of BL-algebras with a Boolean retract.
Algebra Universalis, 2002BL-algebras, introduced by \textit{P.\ Hájek} [Metamathematics of fuzzy logic. Trends in Logic -- Studia Logica Library 4, Kluwer Academic Publishers, Dordrecht (1998; Zbl 0937.03030)], are an algebraic counterpart of basic fuzzy logic. It is known that BL-algebras form a variety of residuated lattices or residuated \(\ell \)-monoids.
Cignoli, Roberto, Torrens, Antoni
openaire +1 more source
Elementary theories of free topo-Boolean and pseudo-Boolean algebras
Mathematical Notes of the Academy of Sciences of the USSR, 1985As is well known there exists a dual isomorphism between the lattice of extensions of the modal logic S4 (the intuitionistic logic Int) and the lattice of varieties of topo-Boolean (pseudo-Boolean) algebras assigning to a logic \(\lambda\) the variety algebras var(\(\lambda)\).
openaire +2 more sources
On the nonexistence of free complete Boolean algebras
1962Rieger asked in 1951 if there exists a free complete Boolean algebra on ω complete generators. Crawley and Dean proved in 1955 that there does not exist a free complete lattice on three complete generators, but their method does not extend to Boolean algebras. In this thesis Rieger's question is answered in the negative.
openaire +1 more source
Super-Boolean Functions and Free Boolean Quasilattices
Discret. Math. Algorithms Appl., 2014Yu. M. Movsisyan, V. Aslanyan
semanticscholar +1 more source
Multidisciplinary standards of care and recent progress in pancreatic ductal adenocarcinoma
Ca-A Cancer Journal for Clinicians, 2020Aaron J Grossberg +2 more
exaly
A Solution of the Word Problem for Free Double Boolean Algebras
2007Double Boolean algebras were introduced in [Wi00a] as a variety fundamental for Boolean Concept Logic, an extension of Formal Concept Analysis allowing negations of formal concepts. In this paper, the free double Boolean algebra generated by the constants is described. Moreover, we show that every free double Boolean algebra with at least one generator
openaire +1 more source
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
CADE, 2007Viktor Kunčak, M. Rinard
semanticscholar +1 more source
Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors
International Journal of General Systems, 2003Philip Meguire
semanticscholar +1 more source
A model in which every Boolean algebra has many subalgebras
Journal of Symbolic Logic (JSL), 1995J. Cummings, S. Shelah
semanticscholar +1 more source

