相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。HOW STRONG IS RAMSEY'S THEOREM IF INFINITY CAN BE WEAK?
Leszek Aleksander Kolodziejczyk et al.
JOURNAL OF SYMBOLIC LOGIC (2023)
AN INSIDE/OUTSIDE RAMSEY THEOREM AND RECURSION THEORY
Marta Fiori-Carones et al.
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY (2022)
To reorient is easier than to orient: An on-line algorithm for reorientation of graphs
Marta Fiori-Carones et al.
COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE (2021)
Weaker cousins of Ramsey's theorem over a weak base theory
Marta Fiori-Carones et al.
ANNALS OF PURE AND APPLIED LOGIC (2021)
Punctual definability on structures
Iskander Kalimullin et al.
ANNALS OF PURE AND APPLIED LOGIC (2021)
PUNCTUAL CATEGORICITY SPECTRA OF COMPUTABLY CATEGORICAL STRUCTURES
N. A. Bazhenov et al.
ALGEBRA AND LOGIC (2021)
FOUNDATIONS OF ONLINE STRUCTURE THEORY
Nikolay Bazhenov et al.
BULLETIN OF SYMBOLIC LOGIC (2019)
The back-and-forth method and computability without delay
Alexander G. Melnikov et al.
ISRAEL JOURNAL OF MATHEMATICS (2019)
The computability, definability, and proof theory of Artinian rings
Chris J. Conidis
ADVANCES IN MATHEMATICS (2019)
Proper divisibility in computable rings
Noam Greenberg et al.
JOURNAL OF ALGEBRA (2017)
REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
Kostas Hatzikiriakou et al.
JOURNAL OF SYMBOLIC LOGIC (2017)
Algebraic structures computable without delay
Iskander Kalimullin et al.
THEORETICAL COMPUTER SCIENCE (2017)
Categorical characterizations of the natural numbers require primitive recursion
Leszek Aleksander Kolodziejczyk et al.
ANNALS OF PURE AND APPLIED LOGIC (2015)
WKL0 and induction principles in model theory
David R. Belanger
ANNALS OF PURE AND APPLIED LOGIC (2015)
On the existence of a connected component of a graph
Kirill Gura et al.
COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE (2015)
COMPUTABLE ABELIAN GROUPS
Alexander G. Melnikov
BULLETIN OF SYMBOLIC LOGIC (2014)
Infinite dimensional proper subspaces of computable vector spaces
Chris J. Conidis
JOURNAL OF ALGEBRA (2014)
REVERSE MATHEMATICS OF FIRST-ORDER THEORIES WITH FINITELY MANY MODELS
David R. Belanger
JOURNAL OF SYMBOLIC LOGIC (2014)
Baire Categoricity and Σ10-Induction
Stephen G. Simpson
NOTRE DAME JOURNAL OF FORMAL LOGIC (2014)
Reverse mathematics and Peano categoricity
Stephen G. Simpson et al.
ANNALS OF PURE AND APPLIED LOGIC (2013)
On the strength of Ramsey's theorem without σ1-induction
Keita Yokoyama
MATHEMATICAL LOGIC QUARTERLY (2013)
REVERSE MATHEMATICS AND A RAMSEY-TYPE KONIG'S LEMMA
Stephen Flood
JOURNAL OF SYMBOLIC LOGIC (2012)
WEIHRAUCH DEGREES, OMNISCIENCE PRINCIPLES AND WEAK COMPUTABILITY
Vasco Brattka et al.
JOURNAL OF SYMBOLIC LOGIC (2011)
THE ATOMIC MODEL THEOREM AND TYPE OMITTING
Denis R. Hirschfeldt et al.
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY (2009)
How Incomputable Is the Separable Hahn-Banach Theorem?
Guido Gherardi et al.
NOTRE DAME JOURNAL OF FORMAL LOGIC (2009)
Subspaces of computable vector spaces
Rodney G. Downey et al.
JOURNAL OF ALGEBRA (2007)
The jump of a Σn-cut
C. T. Chong et al.
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES (2007)
Spectra of structures and relations
Valentina S. Harizanov et al.
JOURNAL OF SYMBOLIC LOGIC (2007)
Effective Borel measurability and reducibility of functions
V Brattka
MATHEMATICAL LOGIC QUARTERLY (2005)
Sigma(n)-bounding and Delta(n)-induction
TA Slaman
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY (2004)
On the strength of Ramsey's theorem for pairs
PA Cholak et al.
JOURNAL OF SYMBOLIC LOGIC (2001)
Things that can and things that cannot be done in PRA
U Kohlenbach
ANNALS OF PURE AND APPLIED LOGIC (2000)