Forcing with tagged trees
From MaRDI portal
Publication:4189261
DOI10.1016/0003-4843(78)90026-8zbMath0404.03020MaRDI 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
Polish group actions: Dichotomies and generalized elementary embeddings, Π11 relations and paths through, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, Topics in invariant descriptive set theory, Comparing Peano arithmetic, Basic Law V, and Hume's Principle, Model theory for \(L_{\infty \omega _ 1}\), Projective subsets of separable metric spaces, 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 induction in a reversal, Reverse Mathematics: The Playground of Logic, Some recent developments in higher recursion theory, 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
