Related papers: Complete relations on fuzzy complete lattices
We characterize all residuated lattices that have height equal to $3$ and show that the variety they generate has continuum-many subvarieties. More generally, we study unilinear residuated lattices: their lattice is a union of disjoint…
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…
In fuzzy group theory many versions of the well-known Lagrange's theorem have been studied. The aim of this article is to investigate the converse of one of those results. This leads to an interesting characterization of finite cyclic…
We discuss the possibility of representing supersymmetry exactly in a lattice discretized system. In particular, we construct a perfect supersymmetric action for the Wess-Zumino model.
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…
The present paper is devoted to study some completeness properties of transitive binary relational set, i.e., a set together with a transitive binary relation (so called t-set).
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
Let $k$ be a perfect field of characteristic $p \geq 3$, and let $K$ be a finite totally ramified extension of $K_0 = W(k)[p^{-1}]$. Let $L_0$ be a complete discrete valuation field over $K_0$ whose residue field has a finite $p$-basis, and…
The definition of the complement of a fuzzy subset is algebraic in nature and when it is used in the context of fuzzy topological spaces it does not share any similarity with the usual property of topological spaces that the complement of…
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…
In this paper, generalised intuitionistic fuzzy soft sets and relations on generalised intuitionistic fuzzy soft sets are defined and a few of their properties are studied. An application of generalised intuitionistic fuzzy soft sets in…
There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models and fuzzy interpretations in description logics. Fuzzy bisimulations between…
An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…
In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
Simulations and bisimulations between two fuzzy automata over a complete residuated lattice were defined by \'Ciri\'c et al. (2012) as fuzzy relations between the sets of states of the automata. However, they act as a crisp relationship…
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for characterizing and constructing sponges on metric spaces and…
Residuated lattices play an important role in the study of fuzzy logic based of t-norm. In this paper, we introduced the notions of n-fold implicative filters, n-fold positive implicative filters, n-fold boolean filters, n-fold fantastic…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…