A decision algorithm for linear sentences on a PFM
DOI10.1016/0168-0072(93)90097-WzbMATH Open0788.68077OpenAlexW2069336915MaRDI QIDQ685065FDOQ685065
Authors: Lian Li, Huilin Li, Yixun Liu
Publication date: 22 September 1993
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(93)90097-w
Recommendations
decidabilityalgebraic decision methoddeciding problem for truth of sentencesfinitely generated module over principal ideal domainsymbolic computation problem for linear systemstheorem proving for algebraic systems
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Decidability of theories and sets of sentences (03B25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- The computational complexity of logical theories
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- Decidable sentences of Church-Rosser congruences
- Solving systems of linear equations over polynomials
- Thue systems as rewriting systems
- Komplexität von Entscheidungsproblemen. Ein Seminar
- Title not available (Why is that?)
- Title not available (Why is that?)
- A decision algorithm for linear sentences on a PFM
Cited In (3)
This page was built for publication: A decision algorithm for linear sentences on a PFM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685065)