English
Related papers

Related papers: Finite model theory for pseudovarieties and univer…

200 papers

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Rings and Algebras · Mathematics 2014-09-23 Brian T. Chan

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

Group Theory · Mathematics 2014-03-24 Goulnara Arzhantseva , Jean-Francois Lafont , Ashot Minasyan

The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…

Logic · Mathematics 2019-09-05 Andrei Alexandru , Gabriel Ciobanu

We study problems concerning the Samuel compactification of the automorphism group of a countable first-order structure. A key motivating question is a problem of Furstenberg and a counter-conjecture by Pestov regarding the difference…

Dynamical Systems · Mathematics 2018-09-11 Dana Bartošová , Andy Zucker

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

Logic · Mathematics 2013-04-04 Mohammed Assem , Tarek Sayed Ahmed

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

Representation Theory · Mathematics 2026-02-17 Alireza Nasr-Isfahani

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

Church-Ellenberg-Farb used the language of FI-modules to prove that the cohomology of certain sequences of hyperplane arrangements with S_n-actions satisfies representation stability. Here we lift their results to the level of the…

Geometric Topology · Mathematics 2016-06-13 Nir Gadish

A finite W-algebra is an associative algebra constructed from a semisimple Lie algebra and its nilpotent element. In this survey we review recent developments in the representation theory of W-algebras. We emphasize various interactions…

Representation Theory · Mathematics 2010-03-31 Ivan Losev

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…

Rings and Algebras · Mathematics 2007-05-23 U. D. Bekbaev , I. S. Rakhimov

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Logic in Computer Science · Computer Science 2022-05-27 Eric Finster , David Reutter , Alex Rice , Jamie Vicary

Finite valued constraint satisfaction problems are a formalism for describing many natural optimization problems, where constraints on the values that variables can take come with rational weights and the aim is to find an assignment of…

Logic in Computer Science · Computer Science 2015-04-15 Anuj Dawar , Pengming Wang

We study algebraic and model-theoretic properties of existentially closed fields with an action of a fixed finite group. Such fields turn out to be pseudo-algebraically closed in a rather strong sense. We place this work in a more general…

Logic · Mathematics 2019-05-24 Daniel Max Hoffmann , Piotr Kowalski

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

Disjoint $n$-amalgamation is a condition on a complete first-order theory specifying that certain locally consistent families of types are also globally consistent. In this paper, we show that if a countably categorical theory $T$ admits an…

Logic · Mathematics 2019-09-18 Alex Kruckman

We investigate atomicity of free algebras and various forms of amalgamation for BL and MV algebras, and also Heyting algebras, though the latter algebras may not be linearly ordered, so strictly speaking their corresponding intuitionistic…

Logic · Mathematics 2013-04-05 Tarek Sayed Ahmed

For finitary regular monads T on locally finitely presentable categories we characterize the finitely presentable objects in the category of T-algebras in the style known from general algebra: they are precisely the algebras presentable by…

Category Theory · Mathematics 2019-09-06 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

Group Theory · Mathematics 2007-05-23 Benson Farb , Lee Mosher

We first give simplified and corrected accounts of some results in \cite{PiRCP} on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing \cite{Turing} to give a simplified proof that any definable…

Logic · Mathematics 2025-06-18 Gabriel Conant , Ehud Hrushovski , Anand Pillay