Pages that link to "Item:Q1147232"
From MaRDI portal
The following pages link to New decision algorithms for finitely presented commutative semigroups (Q1147232):
Displaying 37 items.
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Orderings for term-rewriting systems (Q593789) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- Proofs by induction in equational theories with constructors (Q789177) (← links)
- Residual finiteness in permutation varieties of semigroups (Q801042) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Identities common to four Abelian group operations with zero (Q1074611) (← links)
- Reductions in tree replacement systems (Q1082092) (← links)
- Commutative monoids have complete presentations by free (non-commutative) monoids (Q1085284) (← links)
- Complete semi-Thue systems for abelian groups (Q1087012) (← links)
- Termination of rewriting (Q1098624) (← links)
- Complexity of matching problems (Q1099615) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Automatic inductive theorem proving using Prolog (Q1103415) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- New decision algorithms for finitely presented commutative semigroups (Q1147232) (← links)
- A complete proof of correctness of the Knuth-Bendix completion algorithm (Q1154801) (← links)
- A Noetherian and confluent rewrite system for idempotent semigroups (Q1168754) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Paramodulated connection graphs (Q1257912) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- Efficient solution of the word problem in slim varieties (Q1315326) (← links)
- Buchberger's algorithm: The term rewriter's point of view (Q1350495) (← links)
- Free products with amalgamation of monoids (Q1380048) (← links)
- Conditional congruence closure over uninterpreted and interpreted symbols (Q1730315) (← links)
- Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
- Cancellativity in finitely presented semigroups (Q1824041) (← links)
- On equational theories, unification, and (un)decidability (Q1825184) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- (Q3329652) (← links)
- Generalized Gröbner bases: Theory and applications. A condensation (Q5055723) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties (Q6135743) (← links)
