English
Related papers

Related papers: A note on commutative Kleene algebra

200 papers

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

In their 2022 lecture notes on condensed sets, Clausen and Scholze mentioned in a remark that the important subclass of quasiseparated condensed sets is equivalent to the category of so-called compactological spaces defined by Waelbroeck in…

Functional Analysis · Mathematics 2025-12-17 Franziska Böhnlein , Benjamin Bruske , Sven-Ake Wegner

We show that the infinite symmetric product of a connected graded-commutative algebra over the rationals is naturally isomorphic to the free graded-commutative algebra on the positive degree subspace of the original algebra. In particular,…

Rings and Algebras · Mathematics 2021-11-09 Jiahao Hu , Aleksandar Milivojević

We show a few basic results about moduli spaces of semistable modules over Lie algebroids. The first result shows that such moduli spaces exist for relative projective morphisms of noetherian schemes, removing some earlier constraints. The…

Algebraic Geometry · Mathematics 2022-11-15 Adrian Langer

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $R=\mathbb{K}[x_1,x_2,...x_n]$ the polynomial ring in $n$ variables over $\mathbb K.$ We study bases of the free $R$-module $W_n(\mathbb{K})$ of all…

Rings and Algebras · Mathematics 2011-05-25 Ievgen Makedonskyi

A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…

Computational Complexity · Computer Science 2015-06-02 Peter Jonsson , Johan Thapper

Starting from the results of Charles Fefferman and Janos Koll\'ar in \texit{Continuous Solutions of Linear Equations} [1], we adopt a new approach based on Fefferman's techniques of Glaeser refinement to show a more general result than the…

Algebraic Geometry · Mathematics 2023-04-20 Marcello Malagutti

We shall prove a convergence result relative to sequences of Minkowski symmetrals of general compact sets. In particular, we investigate the case when this process is induced by sequences of subspaces whose elements belong to a finite…

Metric Geometry · Mathematics 2021-12-07 Jacopo Ulivelli

The main purpose of this paper is a wide generalization of one of the results abstract algebraic geometry begins with, namely of the fact that the prime spectrum $\mathrm{Spec}(R)$ of a unital commutative ring $R$ is always a spectral…

Category Theory · Mathematics 2021-12-02 Alberto Facchini , Carmelo Antonio Finocchiaro , George Janelidze

Following our approach to metric Lie algebras developed in math.DG/0312243 we propose a way of understanding pseudo-Riemannian symmetric spaces which are not semi-simple. We introduce cohomology sets (called quadratic cohomology) associated…

Differential Geometry · Mathematics 2007-05-23 Ines Kath , Martin Olbrich

We consider the expansion of the real field by the group of rational points of an elliptic curve over the rational numbers. We prove a completeness result, followed by a quantifier elimination result. Moreover we show that open sets…

Logic · Mathematics 2010-12-01 Ayhan Gunaydin , Philipp Hieronymi

Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…

Logic in Computer Science · Computer Science 2024-02-14 Lawrence S. Moss

We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams…

Formal Languages and Automata Theory · Computer Science 2014-07-14 Damien Pous

Descriptive set theory was originally developed on Polish spaces. It was later extended to $\omega$-continuous domains [Selivanov 2004] and recently to quasi-Polish spaces [de Brecht 2013]. All these spaces are countably-based. Extending…

Logic · Mathematics 2017-12-12 Mathieu Hoyrup

An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete. One of the main difficulties of the problem is the lack of…

Logic in Computer Science · Computer Science 2022-03-09 Todd Schmid , Jurriaan Rot , Alexandra Silva

During the last decades algebraization of space turned out to be a promising tool at the interface between Mathematics and Theoretical Physics. Starting with works by Gel'fand-Kolmogoroff and Gel'fand-Naimark, this branch developed as from…

Rings and Algebras · Mathematics 2009-03-23 Janusz Grabowski , Alexei Kotov , Norbert Poncin

In the case of monotone independence, the transparent understanding of the mechanism to validate the central limit theorem (CLT) has been lacking, in sharp contrast to commutative, free and Boolean cases. We have succeeded in clarifying it…

Probability · Mathematics 2009-12-21 Hayato Saigo

In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space…

Logic in Computer Science · Computer Science 2007-05-23 Nicola Olivetti , Gian Luca Pozzato , Camilla Schwind

The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…

Information Theory · Computer Science 2024-01-25 Asier Estevan , Juan-José Minãna , Oscar Valero

Wieler has shown that every irreducible Smale space with totally disconnected stable sets is a solenoid (i.e., obtained via a stationary inverse limit construction). Using her construction, we show that the associated stable C*-algebra is…

Operator Algebras · Mathematics 2019-01-30 Robin J. Deeley , Allan Yashinski