scientific article; zbMATH DE number 1302628

MaRDI QIDQ4249176zbMATH OpenFDO

Authors Harald Ganzinger, Florent Jacquemard, Margus Veanes

Publication date 12 January 2000

zbMATH Keywords

undecidabilitysecond-order unificationEXPTIME-completeautomata-theoretic methodsrigid \(E\)-unificationdecidable subclassesrigid reachability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25)

Recommendations

• RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
• Publication:4938629
• Monadic simultaneous rigid E-unification
• Monadic simultaneous rigid \(E\)-unification and related problems
• Special cases and substitutes for rigid \(E\)-unification

Cited in

(6)

• Logic with equality: Partisan corroboration and shifted pairing
• Farmer's theorem revisited
• On the undecidability of second-order unification
• Tractable and intractable second-order matching problems
• scientific article; zbMATH DE number 1405649 (Why is no real title available?)
• Reachability and confluence are undecidable for flat term rewriting systems

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 Q4249176)