The starting point of this paper is the classical well-known theorem due to G. BIRKHOFF, P. HALL, and J. SCHMIDT which establishes a one-to-one correspondence between compact closure operators, inductive closure operators, inductive closure systems, and closure operators generated in universal algebras (and generated in deductive systems, respectively). In the paper presented we make first step...

In this article we present several logical schemes. The scheme SubrelstrEx concerns a non empty relational structure A, a set B, and a unary predicate P, and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P[x] provided the following conditions are met: • P[B], • B ∈ the carrier of A. T...

In this article we present several logical schemes. The scheme SubrelstrEx deals with a non empty relational structure A , a set B, and a unary predicate P , and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P [x] provided the following conditions are met: • P [B], and • B ∈ the carri...

It is very well known and permeating the whole of mathematics that a closure operator on a given set gives rise to a closure system, whose constituent sets form a complete lattice under inclusion, and vice-versa. Recent work of Wille on triadic concept analysis and subsequent work by the author on polyadic concept analysis led to the introduction of complete trilattices and complete n-lattices,...

Program analysis commonly makes use of Boolean functions to express information about run-time states. Many important classes of Boolean functions used this way, such as the monotone functions and the Boolean Horn functions, have simple semantic characterisations. They also have well-known syntactic characterisations in terms of Boolean formulae, say, in conjunctive normal form. Here we are con...

In 1965 L. A Zadeh [11] introduced fuzzy sets as a generalization of ordinary sets. After that C. L. Chang [2] introduced fuzzy topology and that led to the discussion of various aspects of L-topology by many authors. The Čech closure spaces introduced by Čech E. [1] is a generalization of the topological spaces. The theory of fuzzy closure spaces has been established by Mashhour and Ghanim [4]...

In this paper, we weaken the conditions for the existence of adjoint closure operators, going beyond the standard requirement of additivity/co-additivity. We consider the notion of join-uniform (lower) closure operators, introduced in computer science, in order to model perfect lossless compression in transformations acting on complete lattices. Starting from Janowitz’s characterization of resi...

Closure operators (and closure systems) play a significant role in both pure and applied mathematics. In the framework of fuzzy set theory, several particular examples of closure operators and systems have been considered (e.g. so-called fuzzy subalgebras, fuzzy congruences, fuzzy topology etc.). Recently, fuzzy closure operators and fuzzy closure systems themselves (i.e. operators which map fu...

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...