Related papers: Modal operators for meet-complemented lattices
The first part of the paper is a survey of some of the results previously obtained by the authors concerning the $L^p$-dissipativity of scalar and matrix partial differential operators. In the second part we give new necessary and,…
The main purpose of this paper is to apply the theory of vector lattices and the related abstract modular convergence to the context of Mellin-type kernels and (non)linear vector lattice-valued operators, following the construction of an…
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…
In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…
Proper splittings of operators are commonly used to study the convergence of iterative processes. In order to approximate solutions of operator equations, in this article we deal with proper splittings of closed range bounded linear…
It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators,…
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
We analyze the properties of a class of improved lattice topological charge density operators, constructed by a smearing-like procedure. By optimizing the choice of the parameters introduced in their definition, we find operators having (i)…
We study join-meet ideals associated with modular non-distributive lattices. We give a lower bound for the regularity and show that they are not linearly related.
We study the complexity of closure operators, with applications to machine learning and decision theory. In machine learning, closure operators emerge naturally in data classification and clustering. In decision theory, they can model…
Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…
Perfect lattice actions are exiting with several respects: they provide new insight into conceptual questions of the lattice regularization, and quasi-perfect actions could enable a great leap forward in the non-perturbative solution of…
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one for the lax semantics. Both problems turn out to be…
We introduce the completeness problem for Modal Logic and examine its complexity. For a definition of completeness for formulas, given a formula of a modal logic, the completeness problem asks whether the formula is complete for that logic.…
An algebraic approach for factorizing nonlinear partial differential equations (PDEs) and systems of PDEs is provided. In the particular case of second order linear and nonlinear PDEs and systems of PDEs, necessary and sufficient conditions…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
It is shown that operations of equivalence cannot serve for building algebras which would induce orthomodular lattices as the operations of implication can. Several properties of equivalence operations have been investigated. Distributivity…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…