Constructively Finite? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2010

Constructively Finite?

Abstract

This articles plays with several properties of Bishop sets which would be equivalent in ZFC to being finite. One of which is new. This is an occasion to analyse finely the different properties of finite sets and how they (constructively) relate to one another. We close this article by presenting a few well-known algorithms on finite structures, and describe which kind of finiteness they require.
Fichier principal
Vignette du fichier
Coquand_Spiwack_-_2010_-_Constructively_Finite.pdf (185.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00503917 , version 1 (19-07-2010)

Identifiers

  • HAL Id : inria-00503917 , version 1

Cite

Arnaud Spiwack, Thierry Coquand. Constructively Finite?. Lambán Pardo, Laureano and Romero Ibáñez, Ana and Rubio García, Julio. Contribuciones científicas en honor de Mirian Andrés Gómez, Universidad de La Rioja, pp.217-230, 2010, 978-84-96487-50-5. ⟨inria-00503917⟩
365 View
513 Download

Share

Gmail Facebook X LinkedIn More