The following pages link to Slicing the Truth (Q3191150):
Displaying 47 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Inductive inference and reverse mathematics (Q324252) (← links)
- Degrees bounding principles and universal instances in reverse mathematics (Q490869) (← links)
- The weakness of being cohesive, thin or free in reverse mathematics (Q503277) (← links)
- On the uniform computational content of the Baire category theorem (Q1633900) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- New bounds on the strength of some restrictions of Hindman's theorem (Q2011655) (← links)
- On the Weihrauch degree of the additive Ramsey theorem over the rationals (Q2104276) (← links)
- A Lipschitz determinacy principle equivalent to weak König lemma (Q2111115) (← links)
- Uniquely orderable interval graphs (Q2144484) (← links)
- Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees (Q2155503) (← links)
- Weaker cousins of Ramsey's theorem over a weak base theory (Q2231700) (← links)
- Pigeons do not jump high (Q2313367) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- Dominating the Erdős-Moser theorem in reverse mathematics (Q2400499) (← links)
- Coloring trees in reverse mathematics (Q2401697) (← links)
- On uniform relationships between combinatorial problems (Q2796522) (← links)
- The reverse mathematics of the Tietze extension theorem (Q2827383) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Some Questions in Computable Mathematics (Q2973717) (← links)
- On notions of computability-theoretic reduction between Π21 principles (Q3186057) (← links)
- On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059) (← links)
- Iterative Forcing and Hyperimmunity in Reverse Mathematics (Q3195708) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Reviews (Q4554688) (← links)
- CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC (Q4579817) (← links)
- “Weak yet strong” restrictions of Hindman’s Finite Sums Theorem (Q4596010) (← links)
- THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS (Q4647115) (← links)
- COH, SRT 2 2 , and multiple functionals (Q4995606) (← links)
- Weihrauch Complexity in Computable Analysis (Q5024577) (← links)
- An inside/outside Ramsey theorem and recursion theory (Q5036108) (← links)
- Reduction games, provability and compactness (Q5055312) (← links)
- THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS (Q5067874) (← links)
- (Q5208872) (← links)
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS (Q5346692) (← links)
- Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem (Q5366979) (← links)
- SEARCHING FOR AN ANALOGUE OF ATR<sub>0</sub> IN THE WEIHRAUCH LATTICE (Q5855746) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS (Q6103458) (← links)
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
- Variations of statement, variations of strength. The case of the Rival-Sands theorems (Q6147850) (← links)
- Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective (Q6201447) (← links)
- The Ginsburg-Sands theorem and computability theory (Q6492253) (← links)
- Pathwise-randomness and models of second-order arithmetic (Q6559034) (← links)
