Javascript must be enabled to continue!
Polymodal Lattices and Polymodal Logic
View through CrossRef
AbstractA polymodal lattice is a distributive lattice carrying an n‐place operator preserving top elements and certain finite meets. After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature. We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and completeness theorems.Mathematics Subject Classification: 03G10, 06D99, 03B45.
Title: Polymodal Lattices and Polymodal Logic
Description:
AbstractA polymodal lattice is a distributive lattice carrying an n‐place operator preserving top elements and certain finite meets.
After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature.
We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and completeness theorems.
Mathematics Subject Classification: 03G10, 06D99, 03B45.
Related Results
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
<div>Cyclic lattices and ideal lattices were introduced by Micciancio in \cite{D2}, Lyubashevsky and Micciancio in \cite{L1} respectively, which play an efficient role in Ajt...
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter
Cyclic lattices and ideal lattices were introduced by Micciancio in
\cite{D2}, Lyubashevsky and Micciancio in
\cite{L1} respectively, which play an efficient role in
Ajtai’s constr...
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
Context. This paper addresses issues relevant to the EDA market – reducing the cost and time of testing and verification of digital projects by synthesizing the logic vector of a d...
Logic in the early 20th century
Logic in the early 20th century
The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic log...
Unbounded Star Convergence in Lattices
Unbounded Star Convergence in Lattices
Let L be a vector lattice, "(" x_α ") " be a L-valued net, and x∈L . If |x_α-x|∧u→┴o 0 for every u ∈〖 L〗_+ then it is said that the net "(" x_α ")" unbounded order converges ...
Free mu-lattices
Free mu-lattices
A mu-lattice is a lattice with the property that every unary <br />polynomial has both a least and a greatest fix-point. In this paper<br />we define the quasivariety o...
Multipole groups and fracton phenomena on arbitrary crystalline lattices
Multipole groups and fracton phenomena on arbitrary crystalline lattices
Multipole symmetries are of interest in multiple contexts, from the study of fracton phases, to nonergodic quantum dynamics, to the exploration of new hydrodynamic universality cla...
Modal Logics for Reasoning about Multiagent Systems
Modal Logics for Reasoning about Multiagent Systems
It becomes evident in recent years a surge of interest to applications of modal logics for specification and validation of complex systems. It holds in particular for combined logi...

