Timeline for Computability of fillability of unit cube in $\mathbb{R}^n$ by $k$ $\varepsilon$-balls
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2023 at 9:36 | comment | added | Joel David Hamkins | @KevinCasto Yes, this is a subtle point. Each particular instance statement $(p,q,n,s)\in R$ does not quantify over the dimension. Different statements have different dimensions $n$, yes, but given any input $(p,q,n,s)$, I can write down the sentence in the language of ordered fields, and ask the Tarski algorithm if it is true. | |
| Jan 10, 2023 at 5:47 | comment | added | Kevin Casto | Can you briefly describe how you get around the fact that you are quantifying over the dimension (which you mention in your linked answer as something you're "not allowed to do")? | |
| Jan 9, 2023 at 16:07 | vote | accept | Dominic van der Zypen | ||
| Jan 9, 2023 at 13:16 | history | answered | Joel David Hamkins | CC BY-SA 4.0 |