相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。SRT22 does not imply RT22 in ω-models
Benoit Monin et al.
ADVANCES IN MATHEMATICS (2021)
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
Ludovic Patey et al.
ADVANCES IN MATHEMATICS (2018)
ON THE UNIFORM COMPUTATIONAL CONTENT OF RAMSEY'S THEOREM
Vasco Brattka et al.
JOURNAL OF SYMBOLIC LOGIC (2017)
On the Uniform Computational Content of Computability Theory
Vasco Brattka et al.
THEORY OF COMPUTING SYSTEMS (2017)
The uniform content of partial and linear orders
Eric P. Astor et al.
ANNALS OF PURE AND APPLIED LOGIC (2017)
ON UNIFORM RELATIONSHIPS BETWEEN COMBINATORIAL PROBLEMS
Francois G. Dorais et al.
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY (2016)
On notions of computability-theoretic reduction between Π21 principles
Denis R. Hirschfeldt et al.
JOURNAL OF MATHEMATICAL LOGIC (2016)
STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
Damir D. Dzhafarov
JOURNAL OF SYMBOLIC LOGIC (2016)
THE METAMATHEMATICS OF STABLE RAMSEY'S THEOREM FOR PAIRS
C. T. Chong et al.
JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY (2014)
Cone avoiding closed sets
Lu Liu
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY (2014)
SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS
Manuel Lerman et al.
JOURNAL OF MATHEMATICAL LOGIC (2013)
The Bolzano-Weierstrass Theorem is the jump of Weak Konig's Lemma
Vasco Brattka et al.
ANNALS OF PURE AND APPLIED LOGIC (2012)
WEIHRAUCH DEGREES, OMNISCIENCE PRINCIPLES AND WEAK COMPUTABILITY
Vasco Brattka et al.
JOURNAL OF SYMBOLIC LOGIC (2011)
ON THE STRENGTH OF RAMSEY'S THEOREM FOR PAIRS (vol 66, pg 1, 2001)
Peter A. Cholak et al.
JOURNAL OF SYMBOLIC LOGIC (2009)
Combinatorial principles weaker than Ramsey's theorem for pairs
Denis R. Hirschfeldt et al.
JOURNAL OF SYMBOLIC LOGIC (2007)
Infinite chains and antichains in computable partial orderings
E Herrmann
JOURNAL OF SYMBOLIC LOGIC (2001)
On the strength of Ramsey's theorem for pairs
PA Cholak et al.
JOURNAL OF SYMBOLIC LOGIC (2001)