A decision algorithm for linear sentences on a PFM
type: Item
instance of: scholarly article
title: A decision algorithm for linear sentences on a PFM
zbMATH Open document ID: 0788.68077
DOI: 10.1016/0168-0072(93)90097-W
author: Lian Li
author: Huilin Li
author: Yixun Liu
published in: Annals of Pure and Applied Logic
publication date: 1993-09-22T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 416878
zbMATH Keywords: theorem proving for algebraic systems
zbMATH Keywords: finitely generated module over principal ideal domain
zbMATH Keywords: decidability
zbMATH Keywords: deciding problem for truth of sentences
zbMATH Keywords: symbolic computation problem for linear systems
zbMATH Keywords: algebraic decision method
MaRDI profile type: Publication
cites work: Decidable sentences of Church-Rosser congruences
cites work: Thue systems as rewriting systems
cites work: Q4052071
cites work: The computational complexity of logical theories
cites work: Q4771385
cites work: Q3882586
cites work: Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
cites work: Solving systems of linear equations over polynomials
cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
cites work: Q3216155
cites work: Q3753938
cites work: Komplexität von Entscheidungsproblemen. Ein Seminar
full work available at URL: 0168-0072(93)90097-w
OpenAlex ID: W2069336915
description: scientific article; zbMATH DE number 416878