Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
172 views

LLPO as constructivity/computability for dense subsets

LLPO is the statement $\forall x \in \mathbb R. x \leq 0 \vee x \geq 0.$ The statement should be understood as a fragment of the Law of Excluded Middle, rather than a statement about the ordering of ...
wlad's user avatar
  • 4,943
1 vote
1 answer
164 views

Partial computability results on integrals over open intervals

It's well known in Type 2 Effectivity that integration over a compact interval is computable. So what about integration over an open interval? What rigorous computability results exist? My thoughts ...
wlad's user avatar
  • 4,943
20 votes
2 answers
2k views

Is it possible to constructively prove that every quaternion has a square root?

Is it possible to constructively prove that every $q \in \mathbb H$ has some $r$ such that $r^2 = q$? The difficulty here is that $q$ might be a negative scalar, in which case there might be "too many"...
wlad's user avatar
  • 4,943