Marc Bezem ; Keiko Nakata ; Tarmo Uustalu - On streams that are finitely red

lmcs:1048 - Logical Methods in Computer Science, October 10, 2012, Volume 8, Issue 4 - https://doi.org/10.2168/LMCS-8(4:4)2012
On streams that are finitely redArticle

Authors: Marc Bezem ; Keiko Nakata ; Tarmo Uustalu ORCID

    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.

    https://doi.org/10.2168/LMCS-8(4:4)2012
    Source: arXiv.org:1210.1200
    Volume: Volume 8, Issue 4
    Published on: October 10, 2012
    Imported on: May 24, 2011
    Keywords: Computer Science - Logic in Computer Science,F.4.1
    Licence: arXiv.org - Non-exclusive license to distribute

    8 Documents citing this article

    Share and export

    Consultation statistics

    This page has been seen 1624 times.
    This article's PDF has been downloaded 320 times.