English
Related papers

Related papers: Kleene algebra with domain

200 papers

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

Commutative Algebra · Mathematics 2020-06-29 Lukasz Matysiak

We introduce infinitary action logic with exponentiation -- that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allows some of the structural rules…

Logic in Computer Science · Computer Science 2021-07-09 Stepan L. Kuznetsov , Stanislav O. Speranski

In this paper we present a detailed proof of an important result of algebraic logic: namely that the free commutative Kleene algebra is the space of semilinear sets. The first proof of this result was proposed by Redko in 1964, and…

Formal Languages and Automata Theory · Computer Science 2019-11-01 Paul Brunet

In the recent past, there has been a growing interest in Neural-Symbolic Integration frameworks, i.e., hybrid systems that integrate connectionist and symbolic approaches to obtain the best of both worlds. In this work we focus on a…

Machine Learning · Computer Science 2022-06-01 Alessandro Daniele , Luciano Serafini

Classically, Tannaka-Krein duality allows us to reconstruct a (co)algebra from its category of representation. In this paper we present an approach that allows us to generalise this theory to the setting of Banach spaces. This leads to…

Functional Analysis · Mathematics 2017-11-23 Kobi Kremnizer , Craig Smith

We generalize imaginary Howe duality for KLR algebras of affine ADE types, developed in our previous paper, from balanced to arbitrary convex preorders. Under the assumption that the characteristic of the ground field is greater than some…

Representation Theory · Mathematics 2016-07-21 Alexander Kleshchev , Robert Muth

We consider properties of extensions of Krull domains such as flatness that involve behavior of extensions and contractions of prime ideals. Let (R,m) be an excellent normal local domain with field of fractions K, let y be a nonzero element…

Commutative Algebra · Mathematics 2014-04-10 William Heinzer , Christel Rotthaus , Sylvia Wiegand

The aim of this paper is to extend the so called slice analysis to a general case in which the codomain is a real vector space of even dimension, i.e. is of the form $\mathbb{R}^{2n}$. We define a cone $\mathcal{W}_\mathcal{C}^d$ in…

Complex Variables · Mathematics 2024-01-05 Xinyuan Dou , Guangbin Ren , Irene Sabadini

We present an innovative approach to dimensional analysis, based on a general representation theorem for complete quantity functions admitting a covariant scalar representation; this theorem is in turn grounded in a purely algebraic theory…

Mathematical Physics · Physics 2020-12-15 Dan Jonsson

We develop the theory of linear algebra over a (Z_2)^n-commutative algebra (n in N), which includes the well-known super linear algebra as a special case (n=1). Examples of such graded-commutative algebras are the Clifford algebras, in…

Rings and Algebras · Mathematics 2016-06-28 Tiffany Covolo

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equation-al theories; we establish functional representation theorems; and we show…

Logic in Computer Science · Computer Science 2023-06-22 Klaus Keimel , Gordon D. Plotkin

In this paper, we show that the equational theory of relational Kleene algebra with the \emph{graph loop} operator (a.k.a.~\emph{fixset}) is \textsc{PSpace}-complete. Here, the graph loop is the unary operator that restricts a binary…

Logic in Computer Science · Computer Science 2026-05-01 Yoshiki Nakamura

We compute the K-theory for C*-algebras naturally associated with rings of integers in number fields. The main ingredient is a duality theorem for arbitrary global fields. It allows us to identify the crossed product arising from affine…

Operator Algebras · Mathematics 2009-06-29 Joachim Cuntz , Xin Li

We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…

Computation and Language · Computer Science 2025-07-08 Isabella Senturia , Elizabeth Xiao , Matilde Marcolli

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

This paper discusses the no-cloning theorem in a logico-algebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning…

Quantum Physics · Physics 2009-10-21 Takayuki Miyadera , Hideki Imai

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

We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the…

Combinatorics · Mathematics 2009-08-17 Gérard H. E. Duchamp , Christophe Tollu

We consider a two dimensional extension of the so-called linearizable mappings. In particular, we start from the Heideman-Hogan recurrence, which is known as one of the linearizable Somos-like recurrences, and introduce one of its two…

Mathematical Physics · Physics 2018-08-24 Ryo Kamiya , Masataka Kanki , Takafumi Mase , Tetsuji Tokihiro

Kleene Algebra (KA) is a useful tool for proving that two programs are equivalent. Because KA's equational theory is decidable, it integrates well with interactive theorem provers. This raises the question: which equations can we (not)…

Formal Languages and Automata Theory · Computer Science 2026-03-11 Tobias Kappé
‹ Prev 1 3 4 5 6 7 10 Next ›