On streams that are finitely red

@article{Bezem2012OnST,
  title={On streams that are finitely red},
  author={Marc Bezem and Keiko Nakata and Tarmo Uustalu},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={8}
}
Mixing induction and coinduction, we study alternative definitions of streams being finitely red. We organize our definitions into a hierarchy including also some wellknown 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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…