English
Related papers

Related papers: Algebraic Reasoning over Relational Structures

200 papers

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

Logic in Computer Science · Computer Science 2026-03-31 Mirai Ikebuchi

We show that semi-infinite cohomology of a finite dimensional graded algebra (satisfying some additional requirements) are a particular case of a general categorical construction. The motivating example is provided by small quantum groups…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov

We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…

Logic · Mathematics 2017-01-11 Vilem Vychodil

After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…

Algebraic Topology · Mathematics 2016-12-16 Sinan Yalin

We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place…

Logic · Mathematics 2019-04-17 Petr Cintula , José Gil Férez , Tommaso Moraschini , Francesco Paoli

Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…

Machine Learning · Statistics 2010-12-01 Gunnar Carlsson , Facundo Memoli

We give a new syntax independent definition of the notion of a generalized algebraic theory as an initial object in a category of categories with families (cwfs) with extra structure. To this end we define inductively how to build a valid…

Category Theory · Mathematics 2021-03-17 Marc Bezem , Thierry Coquand , Peter Dybjer , Martín Escardó

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu

In this note, we study various relational and algebraic aspects of the bounded quasi-implication algebras introduced by Hardegree. By generalizing the constructions given by MacLaren and Goldblatt within the setting of ortholattices, we…

Logic · Mathematics 2025-07-24 Joseph McDonald

Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a…

Logic in Computer Science · Computer Science 2019-03-19 Ekaterina Komendantskaya , Yue Li

In the present paper we examine the relationship between several type $A$ cluster theories and structures. We define a 2D geometric model of a cluster theory, which generalizes cluster algebras from surfaces, and encode several existing…

Representation Theory · Mathematics 2022-01-03 Job Daisie Rock

It is commonly believed that algebraic notions of type theory support only universes \`a la Tarski, and that universes \`a la Russell must be removed by elaboration. We clarify the state of affairs, recalling the details of Cartmell's…

Logic in Computer Science · Computer Science 2019-02-26 Jonathan Sterling

In this research, a general theoretical framework for clustering is proposed over specific partial algebraic systems by the present author. Her theory helps in isolating minimal assumptions necessary for different concepts of clustering…

Artificial Intelligence · Computer Science 2021-06-10 A. Mani

A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…

Logic · Mathematics 2014-08-26 Wojciech Dzik , Michal M. Stronkowski

The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…

Logic · Mathematics 2009-11-13 Sérgio Marcelino , Pedro Resende

The numerical invariants (global) cohomological length, (global) cohomological width, and (global) cohomological range of complexes (algebras) are introduced. Cohomological range leads to the concepts of derived bounded algebras and…

Representation Theory · Mathematics 2017-05-17 Chao Zhang , Yang Han

We continue the study of cluster algebras initiated in math.RT/0104151 and math.RA/0208229. We develop a new approach based on the notion of an upper cluster algebra, defined as an intersection of certain Laurent polynomial rings.…

Representation Theory · Mathematics 2007-05-23 Arkady Berenstein , Sergey Fomin , Andrei Zelevinsky

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