An Induction Principle and Pigeonhole Principles for K-Finite Sets

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 Benabou and Loiseau. We also comment on some variants of this pigeonhole principle. ?

[1]  André Joyal,et al.  La logique des topos , 1981, Journal of Symbolic Logic.

[2]  Gerhard Osius,et al.  Logical and set theoretical tools in elementary topoi , 1975 .

[3]  M. Fourman.  The Logic of Topoi , 1977 .

[4]  Michael Barr,et al.  Toposes without points , 1974 .

[5]  D. Scott,et al.  Sheaves and logic , 1979 .

[6]  M. Wodzicki.  Lecture Notes in Math , 1984 .

[7]  Peter Freyd,et al.  Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.

[8]  A. Kock,et al.  Some topos theoretic concepts of finiteness , 1975 .

[9]  Peter Freyd.  Aspects of topoi: Corrigenda and acknowledgements , 1972, Bulletin of the Australian Mathematical Society.