English
Related papers

Related papers: Continuous Algebras with Hypotheses

200 papers

Commonsense question answering (CQA) aims to test if models can answer questions regarding commonsense knowledge that everyone knows. Prior works that incorporate external knowledge bases have shown promising results, but knowledge bases…

Computation and Language · Computer Science 2022-01-04 Zi-Yi Dou , Nanyun Peng

Generalising a recent work of Dequ\^ene et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is…

Representation Theory · Mathematics 2024-02-09 Annoy Sengupta , Amit Kuber

In relational verification, judicious alignment of computational steps facilitates proof of relations between programs using simple relational assertions. Relational Hoare logics (RHL) provide compositional rules that embody various…

Logic in Computer Science · Computer Science 2023-07-21 Anindya Banerjee , Ramana Nagasamudram , David A. Naumann

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore

$\omega$-regular languages are a natural extension of the regular languages to the setting of infinite words. Likewise, they are recognised by a host of automata models, one of the most important being Alternating Parity Automata (APAs), a…

Logic in Computer Science · Computer Science 2025-05-15 Anupam Das , Abhishek De

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…

Logic in Computer Science · Computer Science 2012-11-21 Giorgi Japaridze

The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…

Logic in Computer Science · Computer Science 2026-02-10 Vincent Moreau

We expand our previously founded basic theory of equiresidual algebraic geometry over an arbitrary commutative field, to a well-behaved theory of (equiresidual) algebraic varieties over a commutative field, thanks to the generalisation of…

Algebraic Geometry · Mathematics 2020-03-17 Jean Barbet-Berthet

In this report, we introduce observation algebras, constructed by considering the downclosed subsets of a coherence space ordered by reverse inclusion. These may be interpreted as specifications of sets of events via some predicates with…

Logic in Computer Science · Computer Science 2025-03-11 Paul Brunet

Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…

Rings and Algebras · Mathematics 2026-02-17 Benyamin Ghojogh , Golbahar Amanpour

Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…

Rings and Algebras · Mathematics 2007-05-23 Jeno Szigeti

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

Logic · Mathematics 2013-05-23 Tarek Sayed Ahmed

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…

Logic in Computer Science · Computer Science 2018-05-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder , Thorsten Wißmann

The conjugacy of split Cartan subalgebras in the finite dimensional simple case (Chevalley) and in the symmetrizable Kac-Moody case (Peterson-Kac) are fundamental results of the theory of Lie algebras. Among the Kac-Moody Lie algebras the…

Rings and Algebras · Mathematics 2014-07-22 V. Chernousov , Philippe Gille , Arturo Pianzola

We prove a long exact sequence in KK-theory for both full and reduced amalgamated free products in the presence of conditional expectations. In the course of the proof, we established the KK-equivalence between the full amalgamated free…

Operator Algebras · Mathematics 2016-12-28 Pierre Fima , Emmanuel Germain

We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we…

Algebraic Geometry · Mathematics 2026-05-01 Chunhui Wei

We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…

We consider some special type extensions of an arbitrary Lie algebra, which we call universal extensions. We show that these extensions are in one-to-one correspondence with finite dimensional associative commutative algebras. We also…

Rings and Algebras · Mathematics 2007-05-23 A B Yanovski

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…

Category Theory · Mathematics 2011-04-14 Stephen Lack , Jiri Rosicky