Variations on Noetherianness

Denis Firsov
Tarmo Uustalu
Niccolò Veltri

In constructive mathematics, several nonequivalent notions of finiteness exist. In this paper, we continue the study of Noetherian sets in the dependently typed setting of the Agda programming language. We want to say that a set is Noetherian, if, when we are shown elements from it one after another, we will sooner or later have seen some element twice. This idea can be made precise in a number of ways. We explore the properties and connections of some of the possible encodings. In particular, we show that certain implementations imply decidable equality while others do not, and we construct counterexamples in the latter case. Additionally, we explore the relation between Noetherianness and other notions of finiteness.

In Robert Atkey and Neelakantan Krishnaswami: Proceedings 6th Workshop on Mathematically Structured Functional Programming (MSFP 2016), Eindhoven, Netherlands, 8th April 2016, Electronic Proceedings in Theoretical Computer Science 207, pp. 76–88.
Published: 1st April 2016.

ArXived at: http://dx.doi.org/10.4204/EPTCS.207.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org