English
Related papers

Related papers: Cover Systems for the Modalities of Linear Logic

200 papers

We prove a refinement of Ado's theorem for Lie algebras over an algebraically-closed field of characteristic zero. We first define what it means for a Lie algebra $L$ to be approximated with a nilpotent ideal, and we then use such an…

Rings and Algebras · Mathematics 2017-03-02 Wolfgang Alexander Moens

Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…

Logic · Mathematics 2026-03-17 Yuki Nishimura

Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic…

Logic in Computer Science · Computer Science 2023-06-22 Ki Yung Ahn , Ross Horne , Alwen Tiu

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

In this paper, for given an algebraic theory $T$ whose category $C$ of models is semi-abelian, we consider the topological models of $T$ called topological $T$-algebras and obtain some results related to the fundamental groups of…

Category Theory · Mathematics 2018-01-29 Osman Mucuk , Serap Demir

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.

Logic in Computer Science · Computer Science 2025-03-25 Philippe Balbiani , Cigdem Gencer

Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…

Logic · Mathematics 2019-08-06 T. Moraschini

We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the…

Logic · Mathematics 2014-08-27 Antti Kuusisto

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

Representation Theory · Mathematics 2007-05-23 Fernando Muro

Vertex $F$-algebras are a deformation of the concept of an ordinary vertex algebra in which the additive formal group law is replaced by an arbitrary formal group law $F$. The main theorem of this paper constructs a Lie algebra from a…

Quantum Algebra · Mathematics 2026-01-19 Markus Upmeier

Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…

Logic in Computer Science · Computer Science 2016-06-10 Lutz Schröder , Yde Venema

Given a graph E we define E-algebraic branching systems, show their existence and how they induce representations of the associated Leavitt path algebra. We also give sufficient conditions to guarantee faithfulness of the representations…

Rings and Algebras · Mathematics 2013-10-09 D. Gonçalves , D. Royer

In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…

Logic in Computer Science · Computer Science 2021-10-22 Davide Castelnovo , Marino Miculan

Let A be a collection of n linear hyperplanes in k^l, where k is an algebraically closed field. The Orlik-Terao algebra of A is the subalgebra R(A) of the rational functions generated by reciprocals of linear forms vanishing on hyperplanes…

Commutative Algebra · Mathematics 2014-12-01 Graham Denham , Mehdi Garrousian , Stefan Tohaneanu

In this paper, we relate the well-known Fock representations of the quantum toroidal algebra of sl(n) to the vertex, shuffle, and L-operator representations of the same algebra. These identifications generalize those for the quantum…

Representation Theory · Mathematics 2019-02-12 Alexander Tsymbaliuk

We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…

Logic · Mathematics 2024-05-09 Jose Moncayo , Pedro H. Zambrano

The central topic is this question: is a given $k$-\'etale algebra $\prod_lE_l/k$ the specialization of a given $k$-cover $f:X\rightarrow B$ at some point $t_0\in B(k)$? Our main tool is a {\it twisting lemma} that reduces the problem to…

Number Theory · Mathematics 2011-07-01 Pierre Dèbes , François Legrand

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz