Forcing with tagged trees
From MaRDI portal
Publication:4189261
DOI10.1016/0003-4843(78)90026-8zbMath0404.03020OpenAlexW2080426944MaRDI QIDQ4189261
Publication date: 1978
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(78)90026-8
Related Items
Reverse Mathematics: The Playground of Logic ⋮ TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS ⋮ Admissibility spectra through \(\omega _ 1\) ⋮ Inadmissible forcing ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Π11 relations and paths through ⋮ Playing with admissibility spectra ⋮ Sacks forcing sometimes needs help to produce a minimal upper bound ⋮ A Note On Analytic Sets ⋮ THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Fraïssé’s conjecture in Π11-comprehension ⋮ Uncountable master codes and the jump hierarchy ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Incompleteness and jump hierarchies ⋮ Comparing Peano arithmetic, Basic Law V, and Hume's Principle ⋮ Projective subsets of separable metric spaces ⋮ On the Π1 1 -separation principle ⋮ Hyperarithmetical Sets ⋮ Necessary use of induction in a reversal ⋮ Polish group actions: Dichotomies and generalized elementary embeddings ⋮ Some recent developments in higher recursion theory ⋮ Topics in invariant descriptive set theory ⋮ On the Equimorphism Types of Linear Orderings ⋮ Cohen and Set Theory ⋮ On disjoint Borel uniformizations ⋮ A theorem about Σ¹₁ equivalence relations ⋮ THE STRENGTH OF JULLIEN'S INDECOMPOSABILITY THEOREM ⋮ Model theory for \(L_{\infty \omega _ 1}\) ⋮ INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS ⋮ Comparing theorems of hyperarithmetic analysis with the arithmetic Bolzano-Weierstrass theorem ⋮ Continuous higher randomness ⋮ Forcing and reducibilities. III. Forcing in fragments of set theory
