Pages that link to "Item:Q807609"
From MaRDI portal
The following pages link to Simple second-order languages for which unification is undecidable (Q807609):
Displaying 14 items.
- Simplifying the signature in second-order unification (Q843951) (← links)
- The Kreisel length-of-proof problem (Q1353977) (← links)
- Farmer's theorem revisited (Q1607046) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- On the undecidability of second-order unification (Q1854349) (← links)
- Referential logic of proofs (Q2500486) (← links)
- Tractable and intractable second-order matching problems (Q2643530) (← links)
- Non-E-Overlapping, Weakly Shallow, and Non-Collapsing TRSs are Confluent (Q3454085) (← links)
- Expressing Symmetry Breaking in DRAT Proofs (Q3454124) (← links)
- An algorithm for distributive unification (Q5055867) (← links)
- Decidable higher-order unification problems (Q5210802) (← links)
- RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION (Q5249028) (← links)
