Pages that link to "Item:Q5210805"
From MaRDI portal
The following pages link to A completion-based method for mixed universal and rigid E-unification (Q5210805):
Displaying 10 items.
- The undecidability of simultaneous rigid E-unification (Q671659) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- A unified functional look at completion in MET, UNIF and AP (Q1840748) (← links)
- (Q3789061) (← links)
- (Q4217942) (← links)
- A framework for using knowledge in tableau proofs (Q4610337) (← links)
- Incremental theory reasoning methods for semantic tableaux (Q4645229) (← links)
- The tableau-based theorem prover 3 T A P Version 4.0 (Q4647529) (← links)
- What you always wanted to know about rigid E-unification (Q5235253) (← links)
- Simultaneous rigid E-unification is undecidable (Q6560168) (← links)