# Start a new discussion

## Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

## Site Tag Cloud

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Anonymous

2. If the reference is correct, it should be possible to prove the constructive intermediate value theorem without countable choice. Thus, Toby Bartels could rewrite his proof without countable choice, which seems to be his original desire.

Anonymous

3. If the reference is correct, it should be possible to prove the constructive intermediate value theorem without countable choice. Thus, Toby Bartels could rewrite his proof without countable choice, which seems to be his original desire.

Anonymous

• CommentRowNumber4.
• CommentAuthorRodMcGuire
• CommentTimeJun 29th 2021

umm that reference has been published outside the arXiv

Matthew Frank - Interpolating Between Choices for the Approximate Intermediate Value Theorem lmcs:2638 - Logical Methods in Computer Science, July 14, 2020, Volume 16, Issue 3 - https://doi.org/10.23638/LMCS-16(3:5)2020

Logical Methods in Computer Science, July 14, 2020, Volume 16, Issue 3 - doi:10.23638/LMCS-16(3:5)2020

• CommentRowNumber5.
• CommentAuthorRodMcGuire
• CommentTimeJun 29th 2021
• (edited Jun 29th 2021)

ugh url doesnt like parens, recoded them as %28 and %29.

I checked the DOI url in the nForum. Why is the nLab more picky?