Pages that link to "Item:Q1887168"
From MaRDI portal
The following pages link to Decidability of bounded second order unification (Q1887168):
Displaying 11 items.
- Simplifying the signature in second-order unification (Q843951) (← links)
- On rewrite constraints and context unification (Q1607044) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- On the complexity of bounded second-order unification and stratified context unification (Q2889573) (← links)
- On the building of affine retractions (Q3520151) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- (Q4411845) (← links)
- Linear second-order unification (Q5055871) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- Improved witnessing and local improvement principles for second-order bounded arithmetic (Q5410329) (← links)
- Mechanizing Mathematical Reasoning (Q5717438) (← links)