Skip to Main content Skip to Navigation
Book sections

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.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/inria-00503917
Contributor : Arnaud Spiwack Connect in order to contact the contributor
Submitted on : Monday, July 19, 2010 - 12:24:05 PM
Last modification on : Friday, February 4, 2022 - 3:15:47 AM
Long-term archiving on: : Thursday, December 1, 2016 - 3:29:38 PM

File

Coquand_Spiwack_-_2010_-_Const...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00503917, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

324

Files downloads

360