English
Related papers

Related papers: The Distributive Full Lambek Calculus with Modal O…

200 papers

We extend Priestley Duality to suitable categories of fuzzy topological spaces and ordered algebraic structures that generalize bounded distributive lattices. The duality we prove extends not only classical Priestley Duality between…

Category Theory · Mathematics 2026-04-17 Marby Zuley Bolaños Ortiz , Ciro Russo

We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…

Logic · Mathematics 2018-04-24 Wesley Fussner , Alessandra Palmigiano

In this note, we investigate the algebraic and topological representation theory of cylindric ortholattices and cylindric Boolean algebras. The first contribution demonstrates that cylindric ortholattices are closed under canonical…

Logic · Mathematics 2025-07-24 Joseph McDonald

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

Logic · Mathematics 2016-04-05 Willem Conradie , Alessandra Palmigiano

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

The linguistic applications of the Lambek calculus suggest its semantics over algebras of formal languages. A straightforward approach to construct such semantics indeed yields a brilliant completeness theorem (Pentus 1995). However,…

Logic in Computer Science · Computer Science 2025-10-30 Stepan L. Kuznetsov

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

The main source of inspiration for the present paper is the work of R. Rosebrugh and R.J. Wood on constructive complete distributive lattices where the authors employ elegantly the concepts of adjunction and module in their study of ordered…

Category Theory · Mathematics 2010-09-21 Dirk Hofmann

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…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

Let $p$ be a prime number, $V$ a discrete valuation ring of unequal caracteristics $(0,p)$, $G$ a smooth affine algebraic group over $Spec \,V$. Using partial divided powers techniques of Berthelot, we construct arithmetic distribution…

Representation Theory · Mathematics 2017-06-28 Christine Huyghe , Tobias Schmidt

We define when a ternary term $m$ of an algebraic language $\mathcal{L}$ is called a \textit{distributive nearlattice term} (DN-term) of a sentential logic $\mathcal{S}$. Distributive nearlattices are ternary algebras generalising Tarski…

Logic · Mathematics 2018-02-13 Luciano J. González

The interpretation of propositional dynamic logic (PDL) through Kripke models requires the relations constituting the interpreting Kripke model to closely observe the syntax of the modal operators. This poses a significant challenge for an…

Logic in Computer Science · Computer Science 2011-09-19 Ernst-Erich Doberkat

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…

Logic in Computer Science · Computer Science 2007-05-23 Pavel Naumov

We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

We characterise the Priestley spaces corresponding to affine complete bounded distributive lattices. Moreover we prove that the class of affine complete bounded distributive lattices is closed under products and free products. We show that…

Logic · Mathematics 2007-05-31 Dominic van der Zypen

In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued G\"odel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the set of valid formulae of the class of…

Logic in Computer Science · Computer Science 2016-11-15 Félix Bou , Francesc Esteva , Lluís Godo , Ricardo Oscar Rodriguez

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

The displacement calculus $\mathbf{D}$ is a conservative extension of the Lambek calculus $\mathbf{L1}$ (with empty antecedents allowed in sequents). $\mathbf{L1}$ can be said to be the logic of concatenation, while $\mathbf{D}$ can be said…

Logic in Computer Science · Computer Science 2017-06-13 Oriol Valentín

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston
‹ Prev 1 8 9 10 Next ›