Pages that link to "Item:Q1814133"

The following pages link to A unification-theoretic method for investigating the \(k\)-provability problem (Q1814133):

Displayed 7 items.

• Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) ‎ (← links)
• 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)
• 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)
• Higher-order unification revisited: Complete sets of transformations (Q1823936) ‎ (← links)