Pages that link to "Item:Q1892306"

The following pages link to A new finiteness condition for monoids presented by complete rewriting systems (after Craig C. Squier) (Q1892306):

Displaying 31 items.

• Homotopy bases and finite derivation type for subgroups of monoids. (Q403106) (← links)
• Higher-dimensional normalisation strategies for acyclicity (Q456807) (← links)
• Bottom-up rewriting for words and terms (Q741256) (← links)
• Polygraphic resolutions and homology of monoids (Q1008743) (← links)
• A convenient category of locally preordered spaces (Q1037410) (← 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)
• Homology of Gaussian groups. (Q1395346) (← links)
• Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← links)
• Towards an algebraic theory of Boolean circuits. (Q1410965) (← links)
• Finite homotopy bases of one-relator monoids (Q1579154) (← links)
• A formal system of reduction paths for parallel reduction (Q1989338) (← links)
• On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← 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)
• Homological Finite Derivation Type (Q3043618) (← 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)
• Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry (Q5063338) (← links)
• Rewriting in Gray categories with applications to coherence (Q5877242) (← links)
• Confluence of algebraic rewriting systems (Q5879266) (← links)
• Homology and closure properties of autostackable groups (Q5964517) (← links)