Pages that link to "Item:Q1109019"

The following pages link to A unification algorithm for second-order monadic terms (Q1109019):

Displaying 20 items.

• Simple second-order languages for which unification is undecidable (Q807609) (← links)
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
• Simplifying the signature in second-order unification (Q843951) (← links)
• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
• Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
• The undecidability of \(k\)-provability (Q1176199) (← links)
• Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
• The Kreisel length-of-proof problem (Q1353977) (← 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)
• Decidability of bounded second order unification (Q1887168) (← links)
• Decidability of bounded higher-order unification (Q2456577) (← links)
• Tractable and intractable second-order matching problems (Q2643530) (← links)
• Regular Patterns in Second-Order Unification (Q3454122) (← links)
• (Q5028439) (← links)
• Some independence results for equational unification (Q5055843) (← links)
• Completion of rewrite systems with membership constraints (Q5204334) (← links)
• Decidable higher-order unification problems (Q5210802) (← links)