Pages that link to "Item:Q2013319"
From MaRDI portal
The following pages link to Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319):
Displaying 10 items.
- On computability and triviality of well groups (Q306506) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458) (← links)
- Solving equations and optimization problems with uncertainty (Q1616393) (← links)
- First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers (Q1659540) (← links)
- (Q4986517) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- Effective topological degree computation based on interval arithmetic (Q5179223) (← links)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test (Q6160909) (← links)
