English
Related papers

Related papers: Some more axiomatisability for S-acts

200 papers

This is the second in a series of articles surveying the body of work on the model theory of S-acts over a monoid S. The first concentrated on the theory of regular S-acts. Here we review the material on model-theoretic properties of free,…

Logic · Mathematics 2018-05-09 Victoria Gould , Alexander Mikhalev , Evgeny Palyutin , Alena Stepanova

Let C be a class of algebras of a given fixed type t. Associated with the type is a first order language L_t. One can then ask the question, when is the class C axiomatisable by sentences of L_t. In this paper we will be considering…

Rings and Algebras · Mathematics 2009-12-24 Victoria Gould , Lubna Shaheen

We prove that the Flat Cover Conjecture holds for the category of (right) acts over any right-reversible monoid $S$, provided that the flat $S$-acts are closed under stable Rees extensions. The argument shows that the class…

Category Theory · Mathematics 2025-11-24 Sean Cox

In this work, we investigate the commutative monoids over which the axiomatizable class of regular S-acts is primitive normal and antiadditive. We prove that the primitive normality of an axiomatizable class of regular S-acts over the…

Logic · Mathematics 2018-04-26 A. A. Stepanova , G. I. Baturin

This article examines the three-way relationship between right coherency of a monoid $S$, solutions of equations over $S$-acts, and injectivity properties of $S$-acts. A monoid $S$ is right coherent if every finitely generated subact of…

Group Theory · Mathematics 2023-01-30 Yang Dandan , Victoria Gould

A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. The corresponding notion for a ring $R$ states that every finitely generated submodule of every finitely…

Rings and Algebras · Mathematics 2015-01-05 Miklos Hartmann , Victoria Gould

A crucial lemma on module theory is Nakayama's lemma \cite{AF}. In this article, we shall investigate some forms of Nakayama's lemma in the category of right acts over a given monoid $S$ with identity 1. More precisely, among other things,…

Group Theory · Mathematics 2014-01-13 Kamal Ahmadi , Ali Madanshekaf

In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, the notion of $C$-sets was introduced in the literature by considering the tests from an abstract $C$-algebra. This paper…

Logic in Computer Science · Computer Science 2017-02-21 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

In this paper, we prove that all automorphisms of categories of free S-acts are semi-inner, which solves a variation of a well known B. Plotkin's problem in the case of monoids. We also give a description of automorphisms of categories of…

Rings and Algebras · Mathematics 2007-05-23 Yefim Katsov

In this paper we prove that for a monoid $S$, products of indecomposable right $S$-acts are indecomposable if and only if $S$ contains a right zero. Besides, we prove that subacts of indecomposable right $S$-acts are indecomposable if and…

Rings and Algebras · Mathematics 2019-01-24 Mojtaba Sedaghatjoo , Ahmad Khaksari

A monoid $S$ is said to be weakly right coherent if every finitely generated right ideal of $S$ is finitely presented as a right $S$-act. It is known that $S$ is weakly right coherent if and only if it satisfies the following conditions:…

Rings and Algebras · Mathematics 2025-03-03 Levent Michael Dasar , Victoria Gould , Craig Miller

In this paper, considering the geometric equivalence for algebras of a variety $_{S}A$ of S-acts over a monoid S, we obtain representation theorems describing all types of the equivalence classes of geometrically equivalent S-acts of…

Rings and Algebras · Mathematics 2011-06-29 Yefim Katsov

In this paper, we first introduce the notions of superfluous and coessential subacts. Then hollow and co-uniform S-acts are defined as the acts that all proper subacts are superfluous and coessential, respectively. Also it is indicated that…

Group Theory · Mathematics 2021-09-27 Roghaieh Khosravi , Mohammad Roueentan

The study of flatness properties of ordered monoids acting on posets was initiated by S.M. Fakhruddin in the 1980's. Although there exist many papers which investigate various properties of $S$-posets (posets equipped with a compatible…

Representation Theory · Mathematics 2015-03-18 Setareh Irannezhad , Ali Madanshekaf

The main purpose of the present work is an investigation of the notions Hopfian (co-Hopfian) acts whose their surjective (injective) endomorphisms are isomorphisms. While we investigate conditions that are relevant to these classes of acts,…

Group Theory · Mathematics 2022-10-12 Mohammad Roueentan , Roghaieh Khosravi

In 2001 Enoch's celebrated flat cover conjecture was finally proven and the proofs (two different proofs were presented in the same paper [4]) have since generated a great deal of interest among researchers. In particular the results have…

Group Theory · Mathematics 2012-06-15 Alex Bailey , James Renshaw

A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act is finitely presented. This is a finiteness condition, and we investigate whether or not it is preserved under some standard…

Group Theory · Mathematics 2020-09-15 Yang Dandan , Victoria Gould , Miklos Hartmann , Nik Ruskuc , Rida-E Zenab

Recently two different concepts of covers of acts over monoids have been studied. That based on coessential epimorphisms and that based on Enochs' definition of a flat cover of a module over a ring. Two recent papers have suggested that in…

Group Theory · Mathematics 2013-10-03 Alex Bailey , James Renshaw

In order to study the axiomatization of the if-then-else construct over possibly non-halting programs and tests, this paper introduces the notion of $C$-sets by considering the tests from an abstract $C$-algebra. When the $C$-algebra is an…

Logic in Computer Science · Computer Science 2016-09-02 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

Flat iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be a sum of atomic actions. It generalizes prefix iteration, in which the first argument is a…

Logic in Computer Science · Computer Science 2007-05-23 R. J. van Glabbeek
‹ Prev 1 2 3 10 Next ›