DOI10.1142/9208zbMath1304.03001OpenAlexW4238689220MaRDI QIDQ3191150
Denis R. Hirschfeldt
Publication date: 24 September 2014
Published in: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/9208
An inside/outside Ramsey theorem and recursion theory ⋮
On the uniform computational content of the Baire category theorem ⋮
Reverse mathematics and parameter-free transfer ⋮
Reduction games, provability and compactness ⋮
Uniquely orderable interval graphs ⋮
Unnamed Item ⋮
Reverse mathematical bounds for the termination theorem ⋮
Inductive inference and reverse mathematics ⋮
The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮
On notions of computability-theoretic reduction between Π21 principles ⋮
On principles between ∑1- and ∑2-induction, and monotone enumerations ⋮
THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮
Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮
Iterative Forcing and Hyperimmunity in Reverse Mathematics ⋮
The uniform content of partial and linear orders ⋮
Dominating the Erdős-Moser theorem in reverse mathematics ⋮
Coloring trees in reverse mathematics ⋮
CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮
A topological view on algebraic computation models ⋮
OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮
Ramsey’s theorem for singletons and strong computable reducibility ⋮
Primitive recursive reverse mathematics ⋮
ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮
“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem ⋮
The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem ⋮
Variations of statement, variations of strength. The case of the Rival-Sands theorems ⋮
Direct construction of Scott ideals ⋮
On the complexity of learning programs ⋮
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮
Some Questions in Computable Mathematics ⋮
Well-Quasi Orders and Hierarchy Theory ⋮
Weaker cousins of Ramsey's theorem over a weak base theory ⋮
Degrees bounding principles and universal instances in reverse mathematics ⋮
The weakness of being cohesive, thin or free in reverse mathematics ⋮
THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS ⋮
New bounds on the strength of some restrictions of Hindman's theorem ⋮
On uniform relationships between combinatorial problems ⋮
The reverse mathematics of the Tietze extension theorem ⋮
COH, SRT 2 2 , and multiple functionals ⋮
The strength of compactness in computability theory and nonstandard analysis ⋮
SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮
Reviews ⋮
On the Weihrauch degree of the additive Ramsey theorem over the rationals ⋮
A Lipschitz determinacy principle equivalent to weak König lemma ⋮
Weihrauch Complexity in Computable Analysis
This page was built for publication: Slicing the Truth
