On streams that are finitely red
Logic in Computer Science
2015-07-01 v2
Abstract
Mixing induction and coinduction, we study alternative definitions of streams being finitely red. We organize our definitions into a hierarchy including also some well-known alternatives in intuitionistic analysis. The hierarchy collapses classically, but is intuitionistically of strictly decreasing strength. We characterize the differences in strength in a precise way by weak instances of the Law of Excluded Middle.
Keywords
Cite
@article{arxiv.1210.1200,
title = {On streams that are finitely red},
author = {Marc Bezem and Keiko Nakata and Tarmo Uustalu},
journal= {arXiv preprint arXiv:1210.1200},
year = {2015}
}