On the strength of marriage theorems and uniformity

Makoto Fujiwara, Kojiro Higuchi, Takayuki Kihara

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches WKL0 or ACA0 if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in RCA even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in RCA0, and investigate the sequential and Weihrauch strength of marriage theorems under that condition.

Original languageEnglish
Pages (from-to)136-153
Number of pages18
JournalMathematical Logic Quarterly
Volume60
Issue number3
DOIs
Publication statusPublished - 2014
Externally publishedYes

Fingerprint

Uniformity
Finiteness
Theorem
Reverse Mathematics
Classify

ASJC Scopus subject areas

  • Logic

Cite this

On the strength of marriage theorems and uniformity. / Fujiwara, Makoto; Higuchi, Kojiro; Kihara, Takayuki.

In: Mathematical Logic Quarterly, Vol. 60, No. 3, 2014, p. 136-153.

Research output: Contribution to journalArticle

Fujiwara, Makoto ; Higuchi, Kojiro ; Kihara, Takayuki. / On the strength of marriage theorems and uniformity. In: Mathematical Logic Quarterly. 2014 ; Vol. 60, No. 3. pp. 136-153.
@article{6dccc1a33da44c3081c45ae902e4041c,
title = "On the strength of marriage theorems and uniformity",
abstract = "Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches WKL0 or ACA0 if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in RCA even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in RCA0, and investigate the sequential and Weihrauch strength of marriage theorems under that condition.",
author = "Makoto Fujiwara and Kojiro Higuchi and Takayuki Kihara",
year = "2014",
doi = "10.1002/malq.201300021",
language = "English",
volume = "60",
pages = "136--153",
journal = "Mathematical Logic Quarterly",
issn = "0942-5616",
publisher = "Wiley-VCH Verlag",
number = "3",

}

TY - JOUR

T1 - On the strength of marriage theorems and uniformity

AU - Fujiwara, Makoto

AU - Higuchi, Kojiro

AU - Kihara, Takayuki

PY - 2014

Y1 - 2014

N2 - Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches WKL0 or ACA0 if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in RCA even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in RCA0, and investigate the sequential and Weihrauch strength of marriage theorems under that condition.

AB - Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding Hall condition and computable local finiteness for boys and girls. The strength of the marriage theorem reaches WKL0 or ACA0 if computable expanding Hall condition or computable local finiteness for girls is weakened. In contrast, the provability of the marriage theorem is maintained in RCA even if local finiteness for boys is completely removed. Using these conditions, we classify the strength of variants of marriage theorems in the context of reverse mathematics. Furthermore, we introduce another condition that also makes the marriage theorem provable in RCA0, and investigate the sequential and Weihrauch strength of marriage theorems under that condition.

UR - http://www.scopus.com/inward/record.url?scp=84899904981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899904981&partnerID=8YFLogxK

U2 - 10.1002/malq.201300021

DO - 10.1002/malq.201300021

M3 - Article

AN - SCOPUS:84899904981

VL - 60

SP - 136

EP - 153

JO - Mathematical Logic Quarterly

JF - Mathematical Logic Quarterly

SN - 0942-5616

IS - 3

ER -