FINITENESS CONDITIONS FOR REWRITING SYSTEMS-Reference-Cited by-同舟云学术

FINITENESS CONDITIONS FOR REWRITING SYSTEMS

Published:2005-02 Issue:01 Volume:15 Page:175-205
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

MCGLASHAN STUART¹²,PASKU ELTON¹,PRIDE STEPHEN J.¹

Affiliation:

1. Department of Mathematics, University of Glasgow, Glasgow G12 8QW, United Kingdom

2. 4 Belmont Street, Glasgow, United Kingdom

Abstract

Monoids that can be presented by a finite complete rewriting system have both finite derivation type and finite homological type. This paper introduces a higher dimensional analogue of each of these invariants, and relates them to homological finiteness conditions.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196705002074

Reference23 articles.

1. Homological Finite Derivation Type

2. String-Rewriting Systems

3. A Monoid which is Right FP ∞ but not Left FP 1

4. Finite Derivation Type Implies The Homological Finiteness Condition FP3

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

1. Semigroups with finitely generated universal left congruence;Monatshefte für Mathematik;2019-02-19

2. Polygraphs of finite derivation type;Mathematical Structures in Computer Science;2016-09-09

3. Higher-dimensional normalisation strategies for acyclicity;Advances in Mathematics;2012-10

4. On some homotopical and homological properties of monoid presentations;Semigroup Forum;2008-01-03

5. On higher order homological finiteness of rewriting systems;Journal of Pure and Applied Algebra;2005-08