Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MetiTarski / rank | |||
Normal rank | |||
Revision as of 03:29, 28 February 2024
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
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
