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.
Original language | English |
---|---|
Journal | Logical Methods in Computer Science |
Volume | 8 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2012 |
Other keywords
- (co)Induction
- Constructive mathematics
- Finiteness
- Type theory