Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269)

From MaRDI portal
Revision as of 13:24, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems
scientific article

    Statements

    Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    nonlinear arithmetic
    0 references
    decision procedure
    0 references
    prototype verification system (PVS)
    0 references
    polynomial inequalities
    0 references
    Sturm's theorem
    0 references
    Tarski's theorem
    0 references
    automated theorem proving
    0 references
    interactive theorem proving
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers