The embeddability of ring and semigroup amalgams is undecidable-Reference-Cited by-同舟云学术

The embeddability of ring and semigroup amalgams is undecidable

Published:2000-10 Issue:2 Volume:69 Page:272-286
ISSN:0263-6115
Container-title:Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
language:en
Short-container-title:J Aust Math Soc A

Author:

Jackson Marcel

Abstract

AbstractWe prove that there is no algorithm to determine when an amalgam of finite rings (or semigroups) can be embedded in the class of rings or in the class of finite rings (respectively, in the class of semigroups or in the class of finite semigroups). These results are in marked contrast with the corresponding problems for groups where every amalgam of finite groups can be embedded in a finite group.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics,Statistics and Probability

Reference13 articles.

1. Die Untergruppen der freien Gruppen

2. [12] Sapir M. V. , ‘Algorithmic problems for amalgams of finite semigroups’, to appear in J. Algebra.

3. Eventually H-Related Sets and Systems of Equations over Finite Semigroups and Rings

4. Embedding finite semigroup amalgams

5. A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Undecidability of Algebras of Binary Relations;Hajnal Andréka and István Németi on Unity of Science;2021

2. Minsky Machines and Algorithmic Problems;Fields of Logic and Computation II;2015

3. OPTIMAL REES MATRIX CONSTRUCTIONS FOR ANALYSIS OF DATA;Journal of the Australian Mathematical Society;2011-12-08

4. BICYCLIC SUBSEMIGROUPS IN AMALGAMS OF FINITE INVERSE SEMIGROUPS;International Journal of Algebra and Computation;2010-02

5. REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA;Journal of the Australian Mathematical Society;2009-12