An Induction Principle and Pigeonhole Principles for K-Finite Sets

Simple item page
dc.creatorBlass, Andreas
dc.date1994-05-20
dc.date.accessioned2026-07-07T09:15:06Z
dc.date.available2026-07-07T09:15:06Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/9405204
dc.identifierhttp://arxiv.org/abs/math/9405204
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152907
dc.subjectLogic
dc.titleAn Induction Principle and Pigeonhole Principles for K-Finite Sets
dc.typetext

Files

Collections

arXiv