scientific article; zbMATH DE number 4085639

MaRDI QIDQ3815293zbMATH OpenFDO

Authors Pavel Pudlák

Publication date 1988

Full work available at URL https://eudml.org/doc/17666

zbMATH Keywords

matchingunification

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Proof theory and constructive mathematics (03F99)

Recommendations

• Matching - a special case of unification?
• Some results on equational unification
• scientific article; zbMATH DE number 3871321
• The undecidability of the unification and matching problem for canonical theories
• Single versus simultaneous equational unification and equational unification for variable-permuting theories

Cited in

(6)

• On a conjecture concerning strong unicity constants
• Typability and type checking in System F are equivalent and undecidable
• Extending the type checker of Standard ML by polymorphic recursion
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
• The Kreisel length-of-proof problem
• Fast algorithms for uniform semi-unification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3815293)