Simplification of quantifier-free formulae over ordered fields
From MaRDI portal
Recommendations
- Complexity of quantifier elimination in the theory of ordinary differentially closed fields
- A formal quantifier elimination for algebraically closed fields
- Publication:3481680
- scientific article; zbMATH DE number 3563068
- scientific article; zbMATH DE number 3895043
- Élimination des quantificateurs dans des paires de corps
- Elimination of quantifiers for ordered valuation rings
- scientific article; zbMATH DE number 3914300
- On simplification of formulas with unconstrained variables and quantifiers
- Elimination of algorithmic quantifiers for ordered differential algebra
Cited in
(29)- Parametric toricity of steady state varieties of reaction networks
- Algorithmic methods for investigating equilibria in epidemic modeling
- Better answers to real questions
- Adapting real quantifier elimination methods for conflict set computation
- Solution formulas for cubic equations without or with constraints
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- Fast simplifications for Tarski formulas based on monomial inequalities
- Efficient subformula orders for real quantifier elimination of non-prenex formulas
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- A logic based approach to finding real singularities of implicit ordinary differential equations
- Multiple object semilinear motion planning
- Simple CAD construction and its applications
- Efficiently and effectively recognizing toricity of steady state varieties
- Computing with Tarski formulas and semi-algebraic sets in a web browser
- Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Algorithmic global criteria for excluding oscillations
- Computing Hopf bifurcations in chemical reaction networks using reaction coordinates
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
- Linear problems in valued fields
- scientific article; zbMATH DE number 7264200 (Why is no real title available?)
- Weak quantifier elimination for the full linear theory of the integers
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package.
- From simplification to a partial theory solver for non-linear real polynomial constraints
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- On simplification of formulas with unconstrained variables and quantifiers
- A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets
This page was built for publication: Simplification of quantifier-free formulae over ordered fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368694)
