Skip to main content
Article thumbnail
Location of Repository

Proof-Theoretic Strength of the Stable Marriage Theorem and Other Problems

By Jeffrey B. Remmel Douglas Cenzer


We study the proof theoretic strength of several infinite versions of finite combinatorial theorem with respect to the standard Reverse Mathematics hierarchy of systems of second order arithmetic. In particular, we study three infinite extensions of the stable marriage theorem of Gale and Shapley. Other theorems studied include some results on partially ordered sets due to Dilworth and to Dushnik and Miller

Year: 2003
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.