scientific article; zbMATH DE number 1302628
From MaRDI portal
Publication:4249176
zbMATH Open0928.03002MaRDI QIDQ4249176FDOQ4249176
Authors: Harald Ganzinger, Florent Jacquemard, Margus Veanes
Publication date: 12 January 2000
Title of this publication is not available (Why is that?)
Recommendations
undecidabilitysecond-order unificationEXPTIME-completeautomata-theoretic methodsrigid \(E\)-unificationdecidable subclassesrigid reachability
Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25)
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
- Title not available (Why is that?)
- 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)