English
Related papers

Related papers: Countably-categorical Boolean rings with distingui…

200 papers

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur

We introduce the notion of Burch ideals and Burch rings. They are easy to define, and can be viewed as generalization of many well-known concepts, for example integrally closed ideals of finite colength and Cohen--Macaulay rings of minimal…

Commutative Algebra · Mathematics 2019-06-14 Hailong Dao , Toshinori Kobayashi , Ryo Takahashi

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

Commutative Algebra · Mathematics 2023-08-08 Dancheng Lu , Hao Zhou

The purpose of this paper is to introduce new invariants of Cohen-Macaulay local rings. Our focus is the class of Cohen-Macaulay local rings that admit a canonical ideal. Attached to each such ring R with a canonical ideal C, there are…

Commutative Algebra · Mathematics 2017-01-23 Laura Ghezzi , Shiro Goto , Jooyoun Hong , Wolmer Vasconcelos

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2016-09-07 Wesley Calvert

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

Group Theory · Mathematics 2025-10-08 Mikhail V. Volkov

Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · Mathematics 2008-02-03 David Eisenbud , Bernd Sturmfels

We study initial algebras of determinantal rings, defined by minors of generic matrices, with respect to their classical generic point. This approach leads to very short proofs for the structural properties of determinantal rings. Moreover,…

Commutative Algebra · Mathematics 2021-05-18 Winfried Bruns , Tim Roemer , Attila Wiebe

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Logic · Mathematics 2017-04-17 Joel David Hamkins , Makoto Kikuchi

We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a…

Commutative Algebra · Mathematics 2022-09-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

We characterize which complete local (Noetherian) rings T containing the rationals are the completion of a countable excellent local ring S. We also discuss the possibilities for the map from the minimal prime ideals of T to the minimal…

Commutative Algebra · Mathematics 2022-08-10 B. Baily , S. Loepp

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Some descriptions of linked ideals in a commutative Notherian ring $R$ are provided in terms of the Associated prime ideals of $R$. Then, among other things, we make some characterization of Cohen-Macaulay, Gorenstein and regular local…

Commutative Algebra · Mathematics 2018-03-08 Maryam Jahangiri , Khadijeh Sayyari

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

Logic · Mathematics 2008-04-21 Abderezak Ould Houcine

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

Logic · Mathematics 2025-06-09 Nicolás Cuervo Ovalle , Isaac Goldbring

The term ``Boolean category'' should be used for describing an object that is to categories what a Boolean algebra is to posets. More specifically, a Boolean category should provide the abstract algebraic structure underlying the proofs in…

Logic in Computer Science · Computer Science 2011-11-09 Lutz Strassburger