Complete Distributive Lattice Research Articles

O-fuzzy ideals of [formula omitted]-valued general fuzzy automata

This study aims to examine the concept of O-fuzzy ideals of “LB-valued general fuzzy automata” (for simplicity, LB-valued GFA), where B is regarded as a set of propositions about the GFA, and its underlying structure is a complete distributive lattice as a generalization of δ-fuzzy ideals. We provide a necessary and sufficient condition for χ{0} to be an O-fuzzy ideal, and we investigate the relationship between the concepts of O-fuzzy ideals and α-fuzzy ideals in a set B. Accordingly, the related notions and the results obtained in this study are clarified and explicated by some examples.

Lattice Algebraic Structures on LDMFS Domains

The premise of the soft set was designed to model vague ideas. In this kind of model, where the set of parameters exhibits some degree of order, lattice order theory is quite beneficial. For researchers studying uncertainty, the notion of soft sets, lattices, and fuzzy sets has proven essential. In this study, the postulation of the Lattice ordered Linear Diophantine Multi-Fuzzy Soft Set (LLDMFSS) is laid out. The fundamental objective of this study is the formation of hybrid algebraic structures for LLDMFSS. Particularly, the characteristics of complete lattice, modular lattice, and distributive lattice were inhibited in LLDMFSS, and some pertinent findings were obtained. Subsequently, the modular and distributive LLDMFSS characterization theorem was implemented. The notion of the direct product for two LLDMFSSs was then addressed.

Not every countable complete distributive lattice is sober

AbstractThe study of the sobriety of Scott spaces has got a relatively long history in domain theory. Lawson and Hoffmann independently proved that the Scott space of every continuous directed complete poset (usually called domain) is sober. Johnstone constructed the first directed complete poset whose Scott space is non-sober. Soon after, Isbell gave a complete lattice with a non-sober Scott space. Based on Isbell’s example, Xu, Xi, and Zhao showed that there is even a complete Heyting algebra whose Scott space is non-sober. Achim Jung then asked whether every countable complete lattice has a sober Scott space. The main aim of this paper is to answer Jung’s problem by constructing a countable complete lattice whose Scott space is non-sober. This lattice is then modified to obtain a countable distributive complete lattice with a non-sober Scott space. In addition, we prove that the topology of the product space $\Sigma P\times \Sigma Q$ coincides with the Scott topology of the product poset $P\times Q$ if the set Id(P) and Id(Q) of all incremental ideals of posets P and Q are both countable. Based on this, it is deduced that a directed complete poset P has a sober Scott space, if Id(P) is countable and $\Sigma P$ is coherent and well filtered. In particular, every complete lattice L with Id(L) countable has a sober Scott space.

Neutrosophic N−Ideals on Sheffer Stroke BCK-Algebras

In this study, a neutrosophic N −subalgebra and neutrosophic N−ideal of a Sheffer stroke BCK-algebras are defined. It is shown that the level-set of a neutrosophic N−subalgebra (ideal) of a Sheffer stroke BCK-algebra is a subalgebra (ideal) of this algebra and vice versa. Then we present that the family of all neutrosophic N−subalgebras of a Sheffer stroke BCK-algebra forms a complete distributive modular lattice and that every neutrosophic N−ideal of a Sheffer stroke BCK-algebra is the neutrosophic N −subalgebra but the inverse does not usually hold. Also, relationships between neutrosophic N−ideals of Sheffer stroke BCK-algebras and homomorphisms are analyzed. Finally, we determine special subsets of a Sheffer stroke BCK-algebra by means of N−functions on this algebraic structure and examine the cases in which these subsets are its ideals.

LG-FUZZY PARTITION OF UNITY

In this paper, we define LGc-fuzzy Euclidean topological space with countable basis, which L denotes a complete distributive lattice and we show that each LGc-fuzzy open covering of this space can be refined to an LGc-fuzzy open covering that is locally finite. We introduce C∞ LG-fuzzy manifold (X, Tc), with countable basis of LG-fuzzy open sets which X is an L-fuzzy subset of a crisp set M and T : LMX → L, is an L-gradation of openness on X. We prove that for any LG-fuzzy topological manifold (X,T), there exists an LG-fuzzy exhaustion. We prove LG-Urysohn lemma and also existence of LG-partitions of unity on every LG-fuzzy topological manifold.

Equivalence, Partial Order and Lattice of Neighborhood Sequences on the Triangular Grid

In (digital) grids, neighbor relation is a crucial concept; digital distances are based on paths through neighbor points. Digital distances are significant, e.g., in digital image processing for giving an approximation of the Euclidean distance and allowing incremental algorithms on images. Neighborhood sequences (i.e., infinite sequences of the possible types of neighbors) are defining digital distances with a lower rotational dependency than the distances based only on a sole neighborhood. They allow one to change the used neighborhood condition in every step along a path. They are defined in various grids, and they can be periodic. Generalized neighborhood sequences do not need to be periodic. In this paper, the triangular grid is studied. An equivalence and two partial order relations on the set of generalized and periodic neighborhood sequences are shown on this grid. The first partial order, the “faster” relation, is based on distances defined by neighborhood sequences, and it does not provide a lattice but gives a relatively complex relation for neighborhood sequences with a short period. The other partial order, the relation “componentwise dominate”, defines a complete distributive lattice on the set of generalized neighborhood sequences. Finally, a relation of the above-mentioned relations is established. Important differences regarding the cases of the square and triangular grids are also highlighted.

Elitable GE-filters of bordered GE-algebras

In this paper, the notions of maximal GE-filter and prime GE-filter of a GE-algebra are introduced and the relation between them is given. Some characterizations of prime GE-filters of a transitive GE-algebra are given in terms of the GE-filter generated by a subset of a transitive GE-algebra. We generalized Stone’s theorem to transitive GE-algebras. The notion of elitable GE-filter of a bordered GE-algebra is introduced and investigated its properties. We observed that the class of all elitable GE-filters of a transitive bordered GE-algebra is a complete distributive lattice. Equivalent conditions for a GE-filter of a transitive bordered GE-algebra to be elitable GE-filter are given. We provided conditions for a subset of a transitive bordered GE-algebra to be elitable GE-filter.

Bipolar equations on complete distributive symmetric residuated lattices: The case of a join-irreducible right-hand side

Bipolar max-⁎ equations, with ⁎ a triangular norm, have recently become a popular research topic embedded in the broad field of fuzzy relational equations. In this paper, we lift the work from the restrictive setting of the real unit interval — obfuscating the underlying lattice-theoretical essence — to the general setting of complete distributive symmetric residuated lattices, allowing to build upon the vast body of knowledge on unipolar sup-⁎ equations on complete distributive residuated lattices. We determine the full solution set, with particular emphasis on the extremal solutions, of a bipolar sup-⁎ equation in case the right-hand side is a join-irreducible element. The results are illustrated by means of ample examples.

Some general aspects of exactness and strong exactness of meets

Exact meets in a distributive lattice are the meets ⋀iai such that for all b, (⋀iai)∨b=⋀i(ai∨b); strongly exact meets in a frame are preserved by all frame homomorphisms. Finite meets are, trivially, (strongly) exact; this naturally leads to the concepts of exact resp. strongly exact filters closed under all exact resp. strongly exact meets. In [2,12] it was shown that the subsets of all exact resp. strongly exact filters are sublocales of the frame of up-sets on a frame, hence frames themselves, and, somewhat surprisingly, that they are isomorphic to the useful frame Sc(L) of sublocales join-generated by closed sublocales resp. the dual of the coframe meet-generated by open sublocales.In this paper we show that these are special instances of much more general facts. The latter concerns the free extension of join-semilattices to coframes; each coframe homomorphism lifting a general join-homomorphism φ:S→C (where S is a join-semilattice and C a coframe) and the associated (adjoint) colocalic maps create a frame of generalized strongly exact filters (φ-precise filters) and a closure operator on C (and – a minor point – any closure operator on C is thus obtained). The former case is slightly more involved: here we have an extension of the concept of exactness (ψ-exactness) connected with the lifts of ψ:S→C with complemented values in more general distributive complete lattices C creating, again, frames of ψ-exact filters; as an application we learn that if such a C is join-generated (resp. meet-generated) by its complemented elements then it is a frame (resp. coframe) explaining, e.g., the coframe character of the lattice of sublocales, and the (seemingly paradoxical) embedding of the frame Sc(L) into it.

P-Fuzzy Ideals and P-Fuzzy Filters in P-Algebras

In this paper, we introduce the concept of p-fuzzy ideals and p-fuzzy filters in a p-algebra. We provide a set of equivalent conditions for a fuzzy ideal to be a p-fuzzy ideal and a p-algebra to be a Boolean algebra. It is proved that the class of p-fuzzy ideals forms a complete distributive lattice. Moreover, we show that there is an isomorphism between the class of p-fuzzy ideals and p-fuzzy filter.

On the characterizations of complete distributive lattices by up-sets1

This paper first describes a characterization of a lattice L which can be represented as the collection of all up-sets of a poset. It then obtains a representation of a complete distributive lattice L0 which can be embedded into the lattice L such that all infima, suprema, the top and bottom elements are preserved under the embedding by defining a monotonic operator on a poset. This paper finally studies the algebraic characterization of a finite distributive.

$e$-fuzzy filters of stone almost distributive lattices

In this paper the concept of $ e $-fuzzy filters is introduced in a Stone Almost Distributive Lattice. Several properties are derived on $ e $-fuzzy filters with the help of maximal fuzzy filters. It is proved that the set of all $ e $-fuzzy filters forms a complete distributive lattice.

$C^infty$ $L$-fuzzy manifolds with $L$-gradation of openness and $C^infty$ $LG$-fuzzy mappings of them

In this paper, we generalize all of the fuzzy structures which we have discussed in cite{MM} to $L$-fuzzy set theory, where $L= $ denotes a complete distributive lattice with at least two elements. We define the concept of an $LG$-fuzzy topological space $(X, mathfrak{T} )$ which $X$ is itself an $L$-fuzzy subset of a crisp set M and $mathfrak{T}$ is an $L$-gradation of openness of $L$-fuzzy subsets of $M$ which are less than or equal to $ X $. Then we define $C^infty$ $L$-fuzzy manifolds with $L$-gradation of openness and $C^infty$ $LG$-fuzzy mappings of them such as $LG$-fuzzy immersions and $LG$-fuzzy imbeddings. We fuzzify the concept of the product manifolds with $L$-gradation of openness and define $LG$-fuzzy quotient manifolds when we have an equivalence relation on $M$ and investigate the conditions of the existence of the quotient manifolds. We also introduce $LG$-fuzzy immersed, imbedded and regular submanifolds.

Internal neighbourhood structures

The main aim of this paper is to provide a description of neighbourhood operators in finitely complete categories with finite coproducts and a proper factorisation system such that the semilattice of admissible subobjects make a distributive complete lattice. The equivalence between neighbourhoods, Kuratowski interior operators and pseudo-frame sets is proved. Furthermore the categories of internal neighbourhoods is shown to be topological. Regular epimorphisms of categories of neighbourhoods are described and conditions ensuring hereditary regular epimorphisms are probed. It is shown the category of internal neighbourhoods of topological spaces is the category of bitopological spaces, while in the category of locales every locale comes equipped with a natural internal topology.

Eigenvalue of Intuitionistic Fuzzy Matrices Over Distributive Lattice

In this article, the concepts of intuitionistic fuzzy complete and complete distributive lattice are introduced and the relative pseudocomplement relation of intuitionistic fuzzy sets is defined. The concepts of intuitionistic fuzzy eigenvalue and eigenvector of an intuitionistic fuzzy matrixes are presented and proved that the set of intuitionistic fuzzy eigenvectors of a given intuitionistic fuzzy eigenvalue form an intuitionistic fuzzy subspace. Also, the authors obtain an intuitionistic fuzzy maximum matrix of a given intuitionistic fuzzy eigenvalue and eigenvector and give some properties of an intuitionistic fuzzy maximum matrix. Finally, the invariant of an intuitionistic fuzzy matrix over a distributive lattice is given with some properties.

Comment on Pythagorean and Complex Fuzzy Set Operations

Dick et al. introduced a relation $\leq ^*$ on $\Pi -i$ numbers and proved that $(\Pi -i, \leq ^*)$ is a bounded distributive complete lattice. In the present paper, we point out that the relation $\leq ^*$ is not a partial order and that $(\Pi -i, \leq ^*)$ is not a lattice. In addition, we study some partial orders on $\Pi -i$ numbers.

On generalized topological molecular lattices

In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and define a closed element by the pseudocomplement of an open element. We have two structures on a completely distributive complete lattice, topology and generalized co-topology which are not dual to each other. We study the basic concepts, in particular separation axioms and some relations among them.

On Subset Families That Form a Continuous Lattice

It is well known that continuous lattices and algebraic lattices can be respectively represented by the family of all fixed points of the projection operator and the closure operator preserving sups of directed sets on the power set of a set X. Similar to the algebraic ⋂-structure as the concrete representation of algebraic lattices, can we have a the concrete representation of continuous lattices by families of sets? We give a positive answer to this in this paper. Also, as a special type of continuous lattice, a concrete representation of completely distributive complete lattices by families of sets is obtained.

Sequent Systems for Negative Modalities

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may be used for handling reasoning under uncertainty caused by inconsistency or undeterminedness. Using such straightforward semantics, we study the classes of frames characterized by seriality, reflexivity, functionality, symmetry, transitivity, and some combinations thereof, and discuss what they reveal about sub-classical properties of negation. To the logics thereby characterized we apply a general mechanism that allows one to endow them with analytic ordinary sequent systems, most of which are even cut-free. We also investigate the exact circumstances that allow for classical negation to be explicitly defined inside our logics.

PAWS: A Tool for the Analysis of Weighted Systems

PAWS is a tool to analyse the behaviour of weighted automata and conditional transition systems. At its core PAWS is based on a generic implementation of algorithms for checking language equivalence in weighted automata and bisimulation in conditional transition systems. This architecture allows for the use of arbitrary user-defined semirings. New semirings can be generated during run-time and the user can rely on numerous automatisation techniques to create new semiring structures for PAWS' algorithms. Basic semirings such as distributive complete lattices and fields of fractions can be defined by specifying few parameters, more exotic semirings can be generated from other semirings or defined from scratch using a built-in semiring generator. In the most general case, users can define new semirings by programming (in C#) the base operations of the semiring and a procedure to solve linear equations and use their newly generated semiring in the analysis tools that PAWS offers.