Timeline for Existential-universal quadratic arithmetic
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 17, 2012 at 18:46 | answer | added | Emil Jeřábek | timeline score: 3 | |
| Oct 17, 2012 at 13:35 | answer | added | Joel David Hamkins | timeline score: 1 | |
| Oct 17, 2012 at 4:45 | comment | added | user5810 | (Equality of real numbers, given an algorithms computing a Cauchy sequence of rationals $\hspace{.7 in}$ and a modulus of Cauchy convergence for that sequence, is also not decidable.) $\hspace{.7 in}$ | |
| Oct 17, 2012 at 2:40 | comment | added | Joel David Hamkins | In particular, could you specify exactly what the input for the decision problem is? I guess you mean that some of the $c_i$ are specified "real constants", but that others are integer variables $p_i$, and you want to know for a given $F$ and given constants, whether integer variables can be found to make the resulting disjunction true of all reals $x_i$. Is that right? In this case, since the input has real number data, you need to say exactly what you mean by a decision procedure. (After all, equality of real numbers, given as oracles, is not decidable.) | |
| Oct 17, 2012 at 1:42 | comment | added | Joel David Hamkins | In the opening of your question, you indicate that you are concerned with a decision procedure, but your later "Question" is not about a decision procedure (but instead appears to be an instance of the desired decision problem). Perhaps it would clarify your question to phrase the matter explicitly as asking whether there is a decision procedure for the decision problem you state. | |
| Oct 16, 2012 at 23:11 | history | asked | Swar Chaudhuri | CC BY-SA 3.0 |