A decision algorithm for linear sentences on a PFM (Q685065): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decidable sentences of Church-Rosser congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue systems as rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of linear equations over polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision algorithm for linear sentences on a PFM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216155 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Komplexität von Entscheidungsproblemen. Ein Seminar / rank
 
Normal rank

Latest revision as of 10:28, 22 May 2024

scientific article
Language Label Description Also known as
English
A decision algorithm for linear sentences on a PFM
scientific article

    Statements

    A decision algorithm for linear sentences on a PFM (English)
    0 references
    0 references
    0 references
    0 references
    22 September 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    theorem proving for algebraic systems
    0 references
    finitely generated module over principal ideal domain
    0 references
    decidability
    0 references
    deciding problem for truth of sentences
    0 references
    symbolic computation problem for linear systems
    0 references
    algebraic decision method
    0 references