English
Related papers

Related papers: Alpay Algebra: A Universal Structural Foundation

200 papers

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First,…

Logic · Mathematics 2015-10-21 Alan J. Cain , Nik Ruškuc

Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can express "simple" decision problems, while others are designed…

Artificial Intelligence · Computer Science 2011-10-13 C. Pralet , T. Schiex , G. Verfaillie

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

The notion of $1$-affineness was originally formulated by Gaitsgory in the context of derived algebraic geometry. Motivated by applications to rigid and analytic geometry, we introduce two very general and abstract frameworks where it makes…

Algebraic Geometry · Mathematics 2025-09-08 Matteo Montagnani , Emanuele Pavia

In Part I of this paper, we introduced a class of certain algebras of finite dimension over a field. All these algebras are split, symmetric and local. Here we continue to investigate their Loewy structure. We show that in many cases their…

Representation Theory · Mathematics 2019-12-09 Thomas Breuer , László Héthelyi , Erzsébet Horváth , Burkhard Külshammer

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

Functional Analysis · Mathematics 2020-12-07 Andrzej Olbryś , Zsolt Páles

We prove that for a finite first order structure $\mathbf{A}$ and a set of first order formulas $\Phi$ in its language with certain closure properties, the finitary relations on $A$ that are definable via formulas in $\Phi$ are uniquely…

Logic · Mathematics 2023-06-01 Erhard Aichinger , Bernardo Rossi

Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function…

Artificial Intelligence · Computer Science 2025-09-24 Lukas Gerlach , David Carral , Markus Hecher

In AI research, so far, the attention paid to the characterization and representation of function and affordance has been sporadic and sparse, even though this aspect features prominently in an intelligent system's functioning. In the…

Artificial Intelligence · Computer Science 2022-08-18 Seng-Beng Ho

We generalize the exact predictive regularity of symmetry groups to give an algebraic theory of patterns, building from a core principle of future equivalence. For topological patterns in fully-discrete one-dimensional systems, future…

Statistical Mechanics · Physics 2023-04-18 Adam Rupe , James P. Crutchfield

We introduce a dialect of the Asynchronous pi-calculus, called AWpi, in which (1) an input name may be owned, at any time, by at most one process; (2) each name has either only the input or only the output capability. As a result, special…

Logic in Computer Science · Computer Science 2026-05-19 Ken Sakayori , Davide Sangiorgi , Simon Castellan , Pierre Clairambault

We develop Algebraic Phase Theory (APT), an axiomatic framework for extracting intrinsic algebraic structure from phase based analytic data. From minimal admissible phase input we prove a general phase extraction theorem that yields…

Rings and Algebras · Mathematics 2026-02-18 Joe Gildea

An envelope in a category is a construction that generalizes the operations of "exterior completion", like completion of a locally convex space, or Stone-\v{C}ech compactification of a topological space, or universal enveloping algebra of a…

Functional Analysis · Mathematics 2021-09-01 Sergei Akbarov

Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…

Logic in Computer Science · Computer Science 2026-05-14 Kevin Batz , Benjamin Lucien Kaminski , Lucas Kehrer , Gerwin Klein , Todd Schmid , Henning Urbat

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

A hermitian algebra is a unital associative ${\mathbb C}$-algebra endowed with an involution such that the spectra of self-adjoint elements are contained in ${\mathbb R}$. In the case of an algebra ${\mathcal A}$ endowed with a…

Functional Analysis · Mathematics 2009-03-12 Daniel Beltita , Karl-Hermann Neeb

The purpose of this paper is to answer a question raised by Gennady Lyubeznik and Karen Smith. This question involves the finite generation of the following non-commutative algebra. Let $S$ be any commutative algebra of prime characteristic…

Commutative Algebra · Mathematics 2009-12-14 Mordechai Katzman

We develop algebraic geometry for general Segal's Gamma-rings and show that this new theory unifies two approaches we had considered earlier on (for a geometry under Spec Z). The starting observation is that the category obtained by gluing…

Algebraic Geometry · Mathematics 2019-09-24 Alain Connes , Caterina Consani

We consider A-hypergeometric functions associated to normal sets in the plane. We give a classification of all point configurations for which there exists a parameter vector such that the associated hypergeometric function is algebraic. In…

Classical Analysis and ODEs · Mathematics 2013-03-28 Esther Bod

General mathematical reasoning is computationally undecidable, but humans routinely solve new problems. Moreover, discoveries developed over centuries are taught to subsequent generations quickly. What structure enables this, and how might…

Artificial Intelligence · Computer Science 2023-06-21 Gabriel Poesia , Noah D. Goodman
‹ Prev 1 3 4 5 6 7 10 Next ›