An induction principle and pigeonhole principles for k-finite sets

Journal of Symbolic Logic 60 (4):1186-1193 (1995)
  Copy   BIBTEX

Abstract

We establish a course-of-values induction principle for K-finite sets in intuitionistic type theory. Using this principle, we prove a pigeonhole principle conjectured by Bénabou and Loiseau. We also comment on some variants of this pigeonhole principle

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
254 (#104,666)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

La logique Des topos.André Boileau & André Joyal - 1981 - Journal of Symbolic Logic 46 (1):6-16.

Add more references