A decision algorithm for linear sentences on a PFM

DOI10.1016/0168-0072(93)90097-WzbMath0788.68077OpenAlexW2069336915MaRDI QIDQ685065

Yixun Liu, Huilin Li, Lian Li

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

zbMATH Keywords

decidabilityalgebraic decision methoddeciding problem for truth of sentencesfinitely generated module over principal ideal domainsymbolic computation problem for linear systemstheorem proving for algebraic systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Decidability of theories and sets of sentences (03B25)

Related Items

A Formal Proof of the Computation of Hermite Normal Form in a General Setting, A decision algorithm for linear sentences on a PFM

Cites Work

• Decidable sentences of Church-Rosser congruences
• A decision algorithm for linear sentences on a PFM
• Solving systems of linear equations over polynomials
• Thue systems as rewriting systems
• Komplexität von Entscheidungsproblemen. Ein Seminar
• The computational complexity of logical theories
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item