The following pages link to (Q3838759):
Displaying 14 items.
- Simplifying the signature in second-order unification (Q843951) (← links)
- The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
- Farmer's theorem revisited (Q1607046) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Decidability of bounded second order unification (Q1887168) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Tractable and intractable second-order matching problems (Q2643530) (← links)
- Regular Patterns in Second-Order Unification (Q3454122) (← links)
- The undecidability of the D<sub>A</sub>-unification problem (Q3478395) (← links)
- Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
- (Q4411845) (← links)
- Unification in pseudo-linear sort theories is decidable (Q4647533) (← links)
- Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)