English
Related papers

Related papers: Residuation algebras with functional duals

200 papers

Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat

The arising of central extensions is discussed in two contexts. At first classical counterparts of quantum anomalies (deserving being named as "classical anomalies") are associated with a peculiar subclass of the non-equivariant maps.…

High Energy Physics - Theory · Physics 2009-11-10 Francesco Toppan

The notion of a duality between two derived functors as well as an extension theorem for derived functors to larger categories in which they need not be defined is introduced. These ideas are then applied to extend and study the coext…

Rings and Algebras · Mathematics 2014-02-19 Anastasis Kratsios

It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…

Logic in Computer Science · Computer Science 2020-10-27 Anuj Dawar , Abhisekh Sankaran

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

The residual finite-dimensionality of a $\mathrm{C}^*$-algebra is known to be encoded in a topological property of its space of representations, stating that finite-dimensional representations should be dense therein. We extend this…

Operator Algebras · Mathematics 2023-02-21 Raphaël Clouâtre , Adam Dor-On

Arboreal categories provide an axiomatic framework in which abstract notions of bisimilarity and back-and-forth games can be defined. They act on extensional categories, typically consisting of relational structures, via arboreal…

Logic in Computer Science · Computer Science 2025-02-05 Luca Reggio , Colin Riba

The theory of algebraic extensions of Banach algebras is well established, and there are many constructions which yield interesting extensions. In particular, Cole's method for extending uniform algebras by adding square roots of functions…

Functional Analysis · Mathematics 2019-12-19 S. Morley

We introduce a notion of residual derivative for elements of a preordered set, a construction that generalizes both the Frattini subgroup in algebra and the Cantor-Bendixson derivative in T1 topological spaces. For dual algebraic coframes…

Dynamical Systems · Mathematics 2026-05-15 Silvère Gangloff , Alonso Nuñez

We consider an extension of the unary negation fragment of first-order logic in which arbitrarily many binary symbols may be required to be interpreted as equivalence relations. We show that this extension has the finite model property.…

Logic in Computer Science · Computer Science 2018-09-14 Daniel Danielski , Emanuel Kieronski

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…

Logic · Mathematics 2015-08-10 Miguel Couceiro , Stephan Foldes

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

Category Theory · Mathematics 2012-01-18 Charles Grellois

One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…

Logic in Computer Science · Computer Science 2018-11-01 Manuel Bodirsky

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

Logic in Computer Science · Computer Science 2026-03-17 Jan Laštovička

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

We consider residue structures $R/G$ where $(G,+)$ is an additive subgroup of a ring $(R,+,\cdot)$, not necessarily an ideal. Special instances include Krasner's construction of quotient hyperfields, and Pumpluen's construction of…

Rings and Algebras · Mathematics 2024-03-19 Louis H. Rowen

We discuss an algebraic approach to propositional logic with side effects. To this end, we use Hoare's conditional [1985], which is a ternary connective comparable to if-then-else. Starting from McCarthy's notion of sequential evaluation…

Logic in Computer Science · Computer Science 2010-12-23 Jan A. Bergstra , Alban Ponse

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás