Forcing with tagged trees
From MaRDI portal
Cited in
(35)- Admissibility spectra through \(\omega _ 1\)
- Inadmissible forcing
- Playing with admissibility spectra
- On disjoint Borel uniformizations
- Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem
- Necessary use of \(\Sigma ^1_{1}\) induction in a reversal
- Reverse mathematics: the playground of logic
- Hyperarithmetical Sets
- Some recent developments in higher recursion theory
- A theorem about Σ¹₁ equivalence relations
- THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM
- Transfinite recursion in higher reverse mathematics
- Sacks forcing sometimes needs help to produce a minimal upper bound
- On the Π1 1 -separation principle
- On the Equimorphism Types of Linear Orderings
- Cohen and Set Theory
- Forcing and reducibilities. III. Forcing in fragments of set theory
- Uncountable master codes and the jump hierarchy
- A Note On Analytic Sets
- Polish group actions: Dichotomies and generalized elementary embeddings
- Comparing Peano arithmetic, Basic Law V, and Hume's Principle
- Fraïssé's conjecture in \(\Pi_1^1\)-comprehension
- Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
- Assigning an isomorphism type to a hyperdegree
- Incompleteness and jump hierarchies
- Continuous higher randomness
- Π11 relations and paths through
- INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS
- Topics in invariant descriptive set theory
- ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- Halin's infinite ray theorems: complexity and reverse mathematics
- Model theory for \(L_{\infty \omega _ 1}\)
- Projective subsets of separable metric spaces
This page was built for publication: Forcing with tagged trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189261)
