Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
From MaRDI portal
Publication:3353014
DOI10.1112/JLMS/S2-47.2.193zbMATH Open0729.03034OpenAlexW2165251681MaRDI QIDQ3353014FDOQ3353014
Authors: Wim Veldman, Marc Bezem 
Publication date: 1993
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/26544
Recommendations
compactness argumentintuitionistic logicRamsey's theorembar inductionintuitionistic analysisalmost full relationintuitionistic pigeonhole principle
Cited In (17)
- Higman's lemma and its computational content
- Another proof of the intuitionistic Ramsey theorem
- A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
- Ramsey theorem as an intuitionistic property of well founded relations
- Constructive decision via redundancy-free proof-search
- A Mechanized Proof of Higman’s Lemma by Open Induction
- Using Ramsey's theorem once
- An analysis of Ramsey's theorem
- Variations on Noetherianness
- An intuitionistic version of Ramsey's theorem and its use in program termination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Intuitionism: an inspiration?
- A constructive interpretation of Ramsey's theorem via the product of selection functions
- Ramsey theorem for pairs as a classical principle in intuitionistic arithmetic
- Refined program extraction from classical proofs
- Title not available (Why is that?)
This page was built for publication: Ramsey's Theorem and the Pigeonhole Principle in Intuitionistic Mathematics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3353014)
