On the strength of marriage theorems and uniformity

Makoto Fujiwara, Kojiro Higuchi, Takayuki Kihara

研究成果: Article査読

3 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)136-153
ページ数18
ジャーナルMathematical Logic Quarterly
60
3
DOI
出版ステータスPublished - 2014
外部発表はい

ASJC Scopus subject areas

  • 論理

フィンガープリント

「On the strength of marriage theorems and uniformity」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル