English
Related papers

Related papers: Finite model theory for pseudovarieties and univer…

200 papers

A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…

Logic · Mathematics 2026-01-14 James Carr

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

Logic · Mathematics 2023-07-25 Sergey V. Sudoplatov

In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. H\'ajek generalized this result to the first-order versions of \L ukasiewicz, G\"odel and…

Logic · Mathematics 2014-07-10 Matteo Bianchi

We study the spectrum of the cohomology rings of cocommutative Hopf superalgebras, restricted and non-restricted Lie superalgebras, and finite supergroup schemes. We also investigate support varieties in these settings and demonstrate that…

Representation Theory · Mathematics 2019-03-01 Christopher M. Drupieski , Jonathan R. Kujawa

We obtain a lower estimate for the Hilbert series of Jacobi algebras and their completions by providing analogue of the Golog-Shafarevich-Vinberg theorem for potential case. We especially treat non-homogeneous situation. This estimate…

Rings and Algebras · Mathematics 2022-01-13 Natalia Iyudu , Stanislav Shkarin

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Logic · Mathematics 2013-08-29 Tarek Sayed Ahmed

We start the general structure theory of not necessarily semisimple finite tensor categories, generalizing the results in the semisimple case (i.e. for fusion categories), obtained recently in our joint work with D.Nikshych. In particular,…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Viktor Ostrik

This work presents a sample constructions of two algebras both with the ideal of relations defined by a finite Gr\"obner basis. For the first algebra the question whether a given element is nilpotent is algorithmically unsolvable, for the…

Rings and Algebras · Mathematics 2017-12-05 Ilya Ivanov-Pogodaev , Sergey Malev

We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they are generated by a finite set of operations. We obtain…

Logic in Computer Science · Computer Science 2024-09-11 Bart Bogaerts , Balder ten Cate , Brett McLean , Jan Van den Bussche

Let $G$ be a reductive group over a non-archimedean local field $F$ of residue characteristic $p$. We prove that the Hecke algebras of $G(F)$ with coefficients in a ${\mathbb Z}_{\ell}$-algebra $R$ for $\ell$ not equal to $p$ are finitely…

Representation Theory · Mathematics 2022-04-25 Jean-Francois Dat , David Helm , Robert Kurinczuk , Gilbert Moss

Finite-dimensional Jacobian algebras are studied from the perspective of representation types. We establish that (like other representation types) the notions of $E$-finiteness and $E$-tameness are invariant under mutations of quivers with…

Representation Theory · Mathematics 2025-09-30 Mohamad Haerizadeh , Toshiya Yurikusa

We describe the E-infinity algebra structure on the complex of singular cochains of a topological space, in the context of sheaf theory. As a first application, for any algebraic variety we define a weight filtration compatible with its…

Algebraic Topology · Mathematics 2022-02-14 David Chataur , Joana Cirici

This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…

Logic in Computer Science · Computer Science 2022-04-06 Aliaume Lopez

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld

The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner , Jakub Rydval

Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…

Rings and Algebras · Mathematics 2014-04-17 Andreas Distler , Bettina Eick

We present new preservation theorems that semantically characterize the $\exists^k \forall^*$ and $\forall^k \exists^*$ prefix classes of first order logic, for each natural number $k$. Unlike preservation theorems in the literature that…

Logic in Computer Science · Computer Science 2013-06-18 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

In this paper we study expansions of infinite dimensional Hilbert spaces with a unitary representation of a discrete countable group. When the group is finite, we prove the theory of the corresponding expansion, regardless if it is…

Logic · Mathematics 2025-08-20 Alexander Berenstein , Juan Manuel Pérez

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard