On streams that are finitely red

Marc Bezem*, Keiko Nakata, Tarmo Uustalu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


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.

Original languageEnglish
JournalLogical Methods in Computer Science
Issue number4
Publication statusPublished - 2012

Other keywords

  • (co)Induction
  • Constructive mathematics
  • Finiteness
  • Type theory


Dive into the research topics of 'On streams that are finitely red'. Together they form a unique fingerprint.

Cite this