The use of classical logic for some combinatorial proofs, as it is the case with Ramsey's theorem, can be localized in the Infinite Pigeonhole (IPH) principle, stating that any infinite sequence which is finitely colored has an infinite monochromatic subsequence. Since in general there is no computable functional producing such an infinite subsequence, we consider a Π 0 2-corollary, proving the classical existence of a finite monochromatic subsequence of any given length. In order to obtain a program from this proof, we apply two methods for extraction: the refined A-Translation, as proposed by Berger et al., and Gödel's Dialectica interpretation. In this paper, we compare the resulting programs with respect to their behavior and complexity and indicate how they reflect the computational content of IPH.
This paper discusses representing elements of the Unified Modelling Language with generalized nets elements. A methodology for modelling sequence diagrams with generalized nets is presented.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.