Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
From MaRDI portal
Publication:3088050
DOI10.1007/978-3-642-22993-0_30zbMath1343.03036OpenAlexW89739884MaRDI QIDQ3088050
Piotr Zgliczyński, Stefan Ratschan, Peter Franek
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_30
Real-analytic and semi-analytic sets (14P15) Decidability of theories and sets of sentences (03B25) Real-analytic functions (26E05) Computation over the reals, computable analysis (03D78)
Related Items (6)
Solving equations and optimization problems with uncertainty ⋮ Computing All Maps into a Sphere ⋮ Polynomial-time homology for simplicial Eilenberg-MacLane spaces ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Computing all maps into a sphere ⋮ Model checking single agent behaviours by fluid approximation
Uses Software
This page was built for publication: Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
