The following pages link to Forcing with tagged trees (Q4189261):
Displayed 24 items.
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle (Q450961) (← links)
- Model theory for \(L_{\infty \omega _ 1}\) (Q762061) (← links)
- Projective subsets of separable metric spaces (Q923080) (← links)
- Admissibility spectra through \(\omega _ 1\) (Q1097878) (← links)
- Inadmissible forcing (Q1102950) (← links)
- Playing with admissibility spectra (Q1111551) (← links)
- On disjoint Borel uniformizations (Q1805831) (← links)
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem (Q2841359) (← links)
- Necessary use of induction in a reversal (Q3011120) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- Some recent developments in higher recursion theory (Q3342550) (← links)
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM (Q3396197) (← links)
- TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS (Q3450810) (← links)
- Sacks forcing sometimes needs help to produce a minimal upper bound (Q3486559) (← links)
- On the Π<sub>1</sub> <sup>1</sup> -separation principle (Q3545211) (← links)
- On the Equimorphism Types of Linear Orderings (Q3594486) (← links)
- Cohen and Set Theory (Q3616434) (← links)
- Forcing and reducibilities. III. Forcing in fragments of set theory (Q3691652) (← links)
- Uncountable master codes and the jump hierarchy (Q3775547) (← links)
- A Note On Analytic Sets (Q3912788) (← links)
- Polish group actions: Dichotomies and generalized elementary embeddings (Q4383175) (← links)
- Π<sub>1</sub><sup>1</sup> relations and paths through (Q5311742) (← links)
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS (Q5485751) (← links)
- Topics in invariant descriptive set theory (Q5946084) (← links)