Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10817-015-9320-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978149312 / rank | |||
Normal rank | |||
Revision as of 19:00, 19 March 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
