English
Related papers

Related papers: Countably-categorical Boolean rings with distingui…

200 papers

The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…

Logic in Computer Science · Computer Science 2021-07-19 Qinxiang Cao , Xiwei Wu

We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment…

Logic · Mathematics 2013-10-15 Jamshid Derakhshan , Angus Macintyre

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

Logic · Mathematics 2016-11-04 Mohammad Assem

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Group Theory · Mathematics 2025-03-04 Alexander Buturlakin , Anton Klyachko , Denis Osin

The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…

Logic · Mathematics 2011-05-09 Piotr Borodulin-Nadzieja , Mirna Džamonja

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

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

We consider ideals in the ring $\mathbb{Z}_2[x_1,\ldots, x_n]$ that contain the polynomials $x_i^2 - x_i$ for $i = 1, \ldots, n$ and give various results related to the one-to-one correspondence between these ideals and the subsets of…

Commutative Algebra · Mathematics 2019-05-08 Samuel Lundqvist

In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…

Algebraic Geometry · Mathematics 2025-04-01 Chenjing Bu

In the logical framework introduced by Grohe and Tur\'an (TOCS 2004) for Boolean classification problems, the instances to classify are tuples from a logical structure, and Boolean classifiers are described by parametric models based on…

Logic in Computer Science · Computer Science 2024-11-07 Steffen van Bergerem , Nicole Schweikardt

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

Algebraic Topology · Mathematics 2022-05-11 Scott M. Bailey , Donald M. Larson

We describe the Poisson ideals and attached symplectic geometry of a cluster algebra with compatible Poisson structure. We apply these results to determine the spectrum of a quantum cluster algebra. As an application, we describe the…

Quantum Algebra · Mathematics 2012-11-01 Sebastian Zwicknagl

In this note we provide a characterization, in terms of additional algebraic structure, of those intervals (certain cocategory objects) in a symmetric monoidal closed category E that are representable in the sense of inducing on E the…

Category Theory · Mathematics 2012-05-25 Michael A. Warren

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

Let $A$ be a unitary ring and let $(\mathbf{I(A),\subseteq })$ be the lattice of ideals of the ring $A.$ In this article we will study the property of the lattice $(\mathbf{I(A),\subseteq})$ to be Noetherian or not, for various types of…

Commutative Algebra · Mathematics 2024-08-30 Diana Savin

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune-free…

Logic · Mathematics 2019-09-16 Johanna N. Y. Franklin , Reed Solomon

We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Alexey Ovchinnikov

It is well known that for a non pseudocompact space X, the family (X) of all intermediate subrings of C(X) which contain bounded real valued continuous functions contains at least 2c many distinct rings. We show that if in addition X is…

General Topology · Mathematics 2021-02-08 Bedanta Bose , Sudip Kumar Acharyya

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher

We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…

Logic in Computer Science · Computer Science 2017-01-11 Phuong Nguyen , Stephen Cook