The undecidability of simultaneous rigid E-unification
From MaRDI portal
(Redirected from Publication:671659)
Recommendations
- scientific article; zbMATH DE number 1088208
- scientific article; zbMATH DE number 1189065
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- Monadic simultaneous rigid E-unification and related problems
- Rigid E-unification: NP-completeness and applications to equational matings
- Theorem proving with bounded rigid E-unification
- scientific article; zbMATH DE number 1110839
- RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
- scientific article; zbMATH DE number 517077
- The undecidability of the semi-unification problem
Cites work
- A completion-based method for mixed universal and rigid \(E\)-unification
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- First-order modal tableaux
- scientific article; zbMATH DE number 440473 (Why is no real title available?)
- scientific article; zbMATH DE number 4110158 (Why is no real title available?)
- scientific article; zbMATH DE number 3532939 (Why is no real title available?)
- scientific article; zbMATH DE number 1324435 (Why is no real title available?)
- scientific article; zbMATH DE number 1761415 (Why is no real title available?)
- scientific article; zbMATH DE number 3264071 (Why is no real title available?)
- scientific article; zbMATH DE number 3275581 (Why is no real title available?)
- scientific article; zbMATH DE number 3344563 (Why is no real title available?)
- Linear logic
- Mechanical Theorem-Proving by Model Elimination
- Positive First-Order Logic Is NP-Complete
- Proof-search in intuitionistic logic with equality, or back to simultaneous rigid \(E\)-unification
- Rigid E-unification: NP-completeness and applications to equational matings
- The undecidability of the second-order unification problem
- Theorem proving using equational matings and rigid E -unification
- Theorem Proving via General Matings
Cited in
(25)- The undecidability of the unification and matching problem for canonical theories
- Proof search in intuitionistic logic with equality, or back to simultaneous rigid E-unification
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable
- Logic with equality: Partisan corroboration and shifted pairing
- On the undecidability of second-order unification
- Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem
- Monadic simultaneous rigid E-unification
- Special cases and substitutes for rigid \(E\)-unification
- Free variables and theories: revisiting rigid E-unification
- scientific article; zbMATH DE number 1189065 (Why is no real title available?)
- scientific article; zbMATH DE number 1088208 (Why is no real title available?)
- scientific article; zbMATH DE number 1110839 (Why is no real title available?)
- Monadic simultaneous rigid E-unification and related problems
- On quasitautologies
- Cyclic connections
- Incremental theory reasoning methods for semantic tableaux
- Proof-search in intuitionistic logic with equality, or back to simultaneous rigid \(E\)-unification
- A practical integration of first-order reasoning and decision procedures
- What you always wanted to know about rigid \(E\)-unification
- RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
- scientific article; zbMATH DE number 6302892 (Why is no real title available?)
- Simultaneous rigid E-unification is undecidable
- Superposition-based equality handling for analytic tableaux
- Rigid E-unification: NP-completeness and applications to equational matings
This page was built for publication: The undecidability of simultaneous rigid E-unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671659)
