Pages that link to "Item:Q1338340"

The following pages link to Finite derivation type implies the homological finiteness condition \(FP_ 3\) (Q1338340):

Displaying 28 items.

• Analysis approach to finite monoids (Q395219) (← links)
• Homotopy bases and finite derivation type for subgroups of monoids. (Q403106) (← links)
• Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
• The next step of the word problem over monoids. (Q648197) (← links)
• For groups the property of having finite derivation type is equivalent to the homological finiteness condition \(FP_ 3\) (Q674765) (← links)
• Bottom-up rewriting for words and terms (Q741256) (← links)
• Finite derivation type for semi-direct products of monoids (Q1127330) (← links)
• Finite complete rewriting systems and finite derivation type for small extensions of monoids (Q1270963) (← links)
• Homotopy reduction systems for monoid presentations (Q1295568) (← links)
• A finiteness condition for rewriting systems (Q1331943) (← links)
• Constructing finitely presented monoids which have no finite complete presentation (Q1357103) (← links)
• Finite homotopy bases of one-relator monoids (Q1579154) (← links)
• A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) (Q1892306) (← links)
• The word problem for one-relation monoids: a survey (Q1982573) (← links)
• A Lyndon's identity theorem for one-relator monoids (Q2135760) (← links)
• Finite derivation type for Rees matrix semigroups (Q2368998) (← links)
• Algebra and geometry of rewriting (Q2463397) (← links)
• Efficiency for self semi-direct products of the free Abelian monoid on two generators. (Q2566476) (← links)
• Homological Finite Derivation Type (Q3043618) (← links)
• THE p-COCKCROFT PROPERTY OF THE SEMI-DIRECT PRODUCTS OF MONOIDS (Q3043625) (← links)
• A NEW EXAMPLE FOR MINIMALITY OF MONOIDS (Q3067243) (← links)
• Polygraphs of finite derivation type (Q3130298) (← links)
• FINITENESS CONDITIONS FOR REWRITING SYSTEMS (Q4680589) (← links)
• THE PROPERTY FDT IS UNDECIDABLE FOR FINITELY PRESENTED MONOIDS THAT HAVE POLYNOMIAL-TIME DECIDABLE WORD PROBLEMS (Q4786249) (← links)
• SECOND ORDER DEHN FUNCTIONS OF GROUPS AND MONOIDS (Q4786257) (← links)
• ON HOMOTOPICAL AND HOMOLOGICAL FINITENESS CONDITIONS FOR FINITELY PRESENTED MONOIDS (Q4786287) (← links)
• SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID (Q4786319) (← links)
• FDT is undecidable for finitely presented monoids with solvable word problems (Q5055951) (← links)