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 Bénabou and Loiseau. We also comment on some variants of this pigeonhole principle.
منابع مشابه
Circuit principles and weak pigeonhole variants 1
This paper considers the relational versions of the surjective, partial surjective, and multifunction weak pigeonhole principles for PV , Σ1, Π b 1, and B(Σ b 1)-formulas as well as relativizations of these formulas to higher levels of the bounded arithmetic hierarchy. We show that the partial surjective weak pigeonhole principle for Π1 formulas implies that for each k there is a string of leng...
متن کاملSome specific concepts and tools of Discrete Mathematics
Discrete Mathematics deals with finite or countable sets, and thus, in particular, with natural numbers. This mathematical field bring into play several overlapping domains, e.g. number theory (arithmetic and combinatorics), graph theory, and combinatorial geometry. As a consequence of the peculiarities of discreteness versus continuum, interesting specific reasonings can be developed (Batanero...
متن کاملSome Recent Results in Ramsey Theory
We review and comment on a number of results in Ramsey theory obtained recently by the author in collaboration with V. Kanellopoulos, N. Karagiannis and K. Tyros. Among them are density versions of the classical pigeonhole principles of Halpern–Läuchli and Carlson–Simpson. We shall comment on recent progress concerning one fundamental problem in Ramsey theory. It originates from an insightful c...
متن کاملRamsey’s Theorem for pairs in k colors in the hierarchy of classical principles
The purpose of this work is to study, from the viewpoint of first order arithmetic (we have no set variables, the only sets are the arithmetical sets), Ramsey’s Theorem for pairs for a recursive assignment of k-many colors in order to find some principle of classical logic equivalent to it in HA. We proved that it is equivalent in HA to Σ3-LLPO, that is the Limited Lesser Principle of Omniscien...
متن کاملCircuit Principles and Weak Pigeonhole Variants
This paper considers the relational versions of the surjective and multifunction weak pigeonhole principles for PV , Σ1 and Θ b 2-formulas. We show that the relational surjective pigeonhole principle for Θ2 formulas in S 1 2 implies a circuit block-recognition principle which in turn implies the surjective weak pigeonhole principle for Σ1 formulas. We introduce a class of predicates correspondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 60 شماره
صفحات -
تاریخ انتشار 1995