English
Related papers

Related papers: Algebraic semantics for hybrid logics

200 papers

We introduce a new class (in two versions) of rational double affine Hecke algebras (DaHa) associated to the spin symmetric group. We establish the basic properties of the algebras, such as PBW and Dunkl representation, and connections to…

Representation Theory · Mathematics 2010-04-06 Weiqiang Wang

We introduce "synchronous algebras", an algebraic structure tailored to recognize automatic relations (aka. synchronous relations, or regular relations). They are the equivalent of monoids for regular languages, however they conceptually…

Formal Languages and Automata Theory · Computer Science 2024-11-26 Rémi Morvan

In this article, we continue the study of tense symmetric Heyting algebras (or TSH-algebras). These algebras constitute a generalization of tense algebras. In particular, we describe a discrete duality for TSHalgebras bearing in mind the…

Logic · Mathematics 2012-03-27 Aldo V. Figallo , Gustavo Pelaitay , Claudia Sanza

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…

Logic in Computer Science · Computer Science 2017-01-11 Jiri Adamek , Stefan Milius , Jiri Velebil

In our paper Semi-symmetric Algebras: General Constructions, J. Algebra, 148 (1992), pp. 479-496, we present the construction of the semi-symmetric algebra of a module over a commutative ring with unit, which generalizes the tensor algebra,…

Rings and Algebras · Mathematics 2009-06-01 Valentin Vankov Iliev

We introduce labelled sequent calculi for the basic normal non-distributive modal logic L and 31 of its axiomatic extensions, where the labels are atomic formulas of a first order language which is interpreted on the canonical extensions of…

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…

Quantum Physics · Physics 2019-03-14 Pablo Arrighi , Gilles Dowek

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

We describe a categorification of the Double Affine Hecke Algebra (${\mathcal{H}\kern -.4em\mathcal{H}}$) associated with an affine Lie algebra $\widehat{\mathfrak{g}}$, including a categorification of the polynomial representation and…

Representation Theory · Mathematics 2024-10-01 Syu Kato , Anton Khoroshkin , Ievgen Makedonskyi

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Operator Algebras · Mathematics 2025-11-24 David P. Blecher

In this paper, we study the combinatorics of a subcomplex of the Bloch-Kriz cycle complex [4] used to construct the category of mixed Tate motives. The algebraic cycles we consider properly contain the subalgebra of cycles that correspond…

Algebraic Geometry · Mathematics 2018-03-16 Susama Agarwala , Owen Patashnick

We prove the conjectures of Hodge and Tate for any four-dimensional hyper-K\"ahler variety of generalized Kummer type. For an arbitrary variety $X$ of generalized Kummer type, we show that all Hodge classes in the subalgebra of the rational…

Algebraic Geometry · Mathematics 2024-11-13 Salvatore Floccari , Mauro Varesco

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

Over the last decades the development of ASP has brought about an expressive modeling language powered by highly performant systems. At the same time, it gets more and more difficult to provide semantic underpinnings capturing the resulting…

Artificial Intelligence · Computer Science 2021-08-09 Pedro Cabalar , Jorge Fandinno , Torsten Schaub , Philipp Wanko

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

We introduce a quantitative relational Hoare logic for quantum programs. Assertions of the logic range over a new infinitary extension of positive semidefinite operators. We prove that our logic is sound, and complete for bounded…

Logic in Computer Science · Computer Science 2025-01-28 Gilles Barthe , Minbo Gao , Theo Wang , Li Zhou

We introduce the notion of quadri-algebras. These are associative algebras for which the multiplication can be decomposed as the sum of four operations in a certain coherent manner. We present several examples of quadri-algebras: the…

Quantum Algebra · Mathematics 2007-05-23 Marcelo Aguiar , Jean-Louis Loday

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

Databases · Computer Science 2007-05-23 Vadim Tropashko