Pages that link to "Item:Q1098649"
From MaRDI portal
The following pages link to Rewrite method for theorem proving in first order theory with equality (Q1098649):
Displaying 11 items.
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Fuzzy term-rewriting system (Q1182011) (← links)
- Discriminator varieties and symbolic computation (Q1190748) (← links)
- A categorical critical-pair completion algorithm (Q1300576) (← links)
- (Q3789100) (← links)
- (Q4012183) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- Complete equational unification based on an extension of the Knuth-Bendix completion procedure (Q6114511) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)