The following pages link to (Q3674088):
Displaying 27 items.
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Multi-valued logic and Gröbner bases with applications to modal logic (Q804567) (← links)
- Semi-unification (Q808713) (← links)
- Term rewriting and beyond -- theorem proving in Isabelle (Q909488) (← links)
- Equational completion in order-sorted algebras (Q912606) (← links)
- A superposition oriented theorem prover (Q1060857) (← links)
- Equational methods in first order predicate calculus (Q1065783) (← links)
- On solving the equality problem in theories defined by Horn clauses (Q1085152) (← links)
- Proof by consistency (Q1094888) (← links)
- Termination of rewriting (Q1098624) (← links)
- Rewrite method for theorem proving in first order theory with equality (Q1098649) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Unification in Boolean rings (Q1112626) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- Schematization of infinite sets of rewrite rules generated by divergent completion processes (Q1262755) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Boolean unification - the story so far (Q1824411) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- (Q3327710) (← links)
- Logic and functional programming by retractions (Q3817574) (← links)
- An overview of LP, the Larch Prover (Q5055717) (← links)
- Bi-rewriting, a term rewriting technique for monotonic order relations (Q5055782) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
