Pages that link to "Item:Q5055742"
From MaRDI portal
The following pages link to Conditional rewrite rule systems with built-in arithmetic and induction (Q5055742):
Displaying 4 items.
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE (Q3188328) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)
- A Rule-Based System for Computation and Deduction in Mathematica (Q6486033) (← links)
- On theorem-proving in Horn theories with built-in algebras (Q6560384) (← links)