English
Related papers

Related papers: Dualities for Plonka sums

200 papers

The duality relation of one-variable multiple polylogarithms was proved by Hirose, Iwaki, Sato and Tasaka by means of iterated integrals. In this paper, we give a new proof using the method of connected sums, which was recently invented by…

Number Theory · Mathematics 2022-03-15 Shuji Yamamoto

Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…

Quantum Algebra · Mathematics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

Probabilistic logic programming is increasingly important in artificial intelligence and related fields as a formalism to reason about uncertainty. It generalises logic programming with the possibility of annotating clauses with…

Logic in Computer Science · Computer Science 2023-06-22 Tao Gu , Fabio Zanasi

A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…

Rings and Algebras · Mathematics 2015-03-10 Pierre Gillibert

In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

In this paper, we define vertex algebras and vertex coalgebras in the category of rational $G_\Gamma$-modules, where $G_\Gamma$ is the group scheme defined by the group algebra $\mathsf k \Gamma$ for an abelian group $\Gamma$. In this…

Representation Theory · Mathematics 2025-01-07 Antoine Caradot , Zongzhu Lin

The dimension algebra of graded groups is introduced. With the help of known geometric results of extension theory that algebra induces all known results of the cohomological dimension theory. Elements of the algebra are equivalence classes…

Algebraic Topology · Mathematics 2008-02-27 Jerzy Dydak

Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…

Logic in Computer Science · Computer Science 2011-06-28 J. A. Bergstra , A. Ponse

Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…

Logic in Computer Science · Computer Science 2015-07-01 Filippo Bonchi , Fabio Zanasi

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…

Representation Theory · Mathematics 2020-02-11 Jenny August

We propose a new definition of Koszulity for graded algebras where the degree zero part has finite global dimension, but is not necessarily semi-simple. The standard Koszul duality theorems hold in this setting. We give an application to…

Representation Theory · Mathematics 2010-07-21 Dag Madsen

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…

Logic in Computer Science · Computer Science 2024-05-08 Antonio Bucciarelli , Pierre-Louis Curien , Antonio Ledda , Francesco Paoli , Antonino Salibra

The notion of prop models the operations with multiple inputs and multiple outpus, acting on some algebraic structures like the bialgebras or the Lie bialgebras. In this paper, we generalize the Koszul duality theory of associative algebras…

Algebraic Topology · Mathematics 2011-03-31 Bruno Vallette

We prove that double dualization into the generic algebra for an algebraic theory has some Gelfand- or Stone- duality properties

Category Theory · Mathematics 2014-12-23 Anders Kock

In this paper a characterisation is given of solvable complemented Lie algebras. They decompose as a direct sum of abelian subalgebras and their ideals relate nicely to this decomposition. The class of such algebras is shown to be a…

Rings and Algebras · Mathematics 2011-04-20 David A. Towers

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella