Results 111 to 120 of about 167 (147)
Studia Logica, 2022 Contact algebra is one of the main tools in region-based theory of space. In \cite{dmvw1, dmvw2,iv,i1} it is generalized by dropping the operation Boolean complement. Furthermore we can generalize contact algebra by dropping also the operation meet. Thus we obtain structures, called contact join-semilattices (CJS) and structures, called distributive ...
Tatyana Ivanova
exaly +3 more sources
Monotonic Distributive Semilattices [PDF]
Order, 2018 In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the variety of implicative meet-semilattices \cite{CelaniImplicative} \cite{ChajdaHalasKuhr}.
Sergio Celani
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Finite Distributive Semilattices
Applied Categorical Structures, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Generalized quasi-metric semilattices
Topology and its Applications, 2022In [Kōdai Math. Semin. Rep. 22, 443--468 (1970; Zbl 0222.06004)], \textit{Y. Nakamura} introduced entropy for semilattices equipped with a semivaluation in order to provide an abstract approach to the classical measure entropy by Kolmogorov and Sinai.
Dikranjan D. +4 more
openaire +3 more sources
Reflexive Topological Semilattices
Canadian Mathematical Bulletin, 1981The duality between compact 0-dimensional semilattices and discrete semilattices studied by K. H. Hofmann et al. [2] is here extended to larger categories of topological semilattices.We regard topological semilattices as objects in the category CvSl of convergence semilattices, believing CvSl to be the appropriate setting for this study.
Hong, S. S., Nel, L. D.
openaire +2 more sources
Asian-European Journal of Mathematics, 2008
In this paper we give equational and structural characterizations of all algebras representing the sequence (0, 3,1,1,…). In the first part of the paper we prove that an algebra without constants has exactly three distinct essentially unary term operations and exactly one essentially n-ary term operation for every n > 1 if and only if it is clone ...
Marczak, Adam W., Płonka, Jerzy
openaire +2 more sources
In this paper we give equational and structural characterizations of all algebras representing the sequence (0, 3,1,1,…). In the first part of the paper we prove that an algebra without constants has exactly three distinct essentially unary term operations and exactly one essentially n-ary term operation for every n > 1 if and only if it is clone ...
Marczak, Adam W., Płonka, Jerzy
openaire +2 more sources
Canadian Mathematical Bulletin, 1980
AbstractSeveral characterizations for prime semilattices are obtained. Prime semilattices that are compactly packed by filters have been characterized. Solution to the problem, “Find a condition on a semilattice by which every filter can be expressed as the intersection of all prime filters containing it”, is furnished.
Pawar, Y. S., Thakare, N. K.
openaire +2 more sources
AbstractSeveral characterizations for prime semilattices are obtained. Prime semilattices that are compactly packed by filters have been characterized. Solution to the problem, “Find a condition on a semilattice by which every filter can be expressed as the intersection of all prime filters containing it”, is furnished.
Pawar, Y. S., Thakare, N. K.
openaire +2 more sources
Order, 1991
The concept of a median semilattice is generalized in the following way: a meet semilattice \(S\) is called \(n\)-median semilattice iff all principal ideals in \(S\) are distributive lattices and any \(n\)-element subset of \(S\) has an upper bound whenever each of its \((n-1)\)-element subsets has an upper bound.
Bandelt, Hans-Jürgen +2 more
openaire +2 more sources
The concept of a median semilattice is generalized in the following way: a meet semilattice \(S\) is called \(n\)-median semilattice iff all principal ideals in \(S\) are distributive lattices and any \(n\)-element subset of \(S\) has an upper bound whenever each of its \((n-1)\)-element subsets has an upper bound.
Bandelt, Hans-Jürgen +2 more
openaire +2 more sources