Decidable fragments of simultaneous rigid reachability

DOI10.1007/3-540-48523-6_22MaRDI QIDQ4938629zbMATH OpenFDO

Authors Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes

Publication date 23 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48523-6_22

zbMATH Keywords

decidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Recommendations

• RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
• Rigid reachability
• Monadic simultaneous rigid E-unification
• Monadic simultaneous rigid E-unification and related problems
• Decidability and complexity of simultaneous rigid E-unification with one variable and related results

Cited in

(5)

• Logic with equality: Partisan corroboration and shifted pairing
• On the undecidability of second-order unification
• Decidability properties for fragments of CHR
• Deciding reachability problems in Turing-complete fragments of Mobile Ambients
• Rigid reachability

This page was built for publication: Decidable fragments of simultaneous rigid reachability

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