The following pages link to Keita Yokoyama (Q324247):
Displaying 39 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- Nonstandard second-order arithmetic and Riemann's mapping theorem (Q386626) (← links)
- Propagation of partial randomness (Q386647) (← links)
- Categorical characterizations of the natural numbers require primitive recursion (Q476119) (← links)
- A nonstandard counterpart of WWKL (Q645739) (← links)
- The Dirac delta function in two settings of reverse mathematics (Q661294) (← links)
- Complex analysis in subsystems of second order arithmetic (Q866888) (← links)
- The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic (Q884957) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Reverse mathematics and Peano categoricity (Q1935867) (← links)
- Ekeland's variational principle in weak and strong systems of arithmetic (Q2003985) (← links)
- In search of the first-order part of Ramsey's theorem for pairs (Q2117792) (← links)
- Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs (Q2193942) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- Formalizing non-standard arguments in second-order arithmetic (Q3066789) (← links)
- On principles between ∑1- and ∑2-induction, and monotone enumerations (Q3186059) (← links)
- (Q3391904) (← links)
- Non-standard analysis in ACA0 and Riemann mapping theorem (Q3437038) (← links)
- (Q3567857) (← links)
- The strength of SCT soundness (Q4612439) (← links)
- THE STRENGTH OF RAMSEY’S THEOREM FOR PAIRS AND ARBITRARILY MANY COLORS (Q4647115) (← links)
- On the strength of Ramsey's theorem without Σ<sub>1</sub>‐induction (Q4915224) (← links)
- THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE (Q5021932) (← links)
- Combinatorial principles equivalent to weak induction (Q5131651) (← links)
- A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (Q5145296) (← links)
- On the Ramseyan Factorization Theorem (Q5175905) (← links)
- (Q5213556) (← links)
- A Note on the Sequential Version of ${\rm \Pi^1_2}$ Statements (Q5326367) (← links)
- EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES (Q6072335) (← links)
- HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? (Q6103456) (← links)
- The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem (Q6119673) (← links)
- The reverse mathematics of theorems of Jordan and Lebesgue (Q6285139) (← links)
- Searching problems above arithmetical transfinite recursion (Q6510083) (← links)
- On the $\Pi^1_2$ consequences of $\Pi^1_1$-$\mathsf{CA}_0$ (Q6521293) (← links)
- Conservation of Ramsey's theorem for pairs and well-foundedness (Q6522330) (← links)
- $\Pi^0_4$ conservation of Ramsey's theorem for pairs (Q6532594) (← links)
- Searching problems above arithmetical transfinite recursion (Q6584960) (← links)
- Erdős-Moser and \(I \Sigma_2\) (Q6635147) (← links)
- On some subtheories of strong dependent choice (Q6755225) (← links)
