Timeline for Examples of statements with a high quantifier complexity
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2017 at 4:09 | comment | added | Dmytro Taranovsky | The specification property is $Π^0_3$. Using compactness, there is an algorithm that given $X$, $f$, $ϵ$ and $T$, will run forever iff the property holds for $ϵ$ and $T$ (using $≤ϵ$ in place of $<ϵ$). (Regarding $∃y∈X$, for compact spaces, existence of an element satisfying a $Π^0_1$-property is $Π^0_1$.) Still, I find the specification property interesting. | |
| Sep 26, 2017 at 4:06 | history | answered | Vaughn Climenhaga | CC BY-SA 3.0 |