Forcing with tagged trees

DOI10.1016/0003-4843(78)90026-8zbMath0404.03020MaRDI QIDQ4189261

J. R. Steel

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

zbMATH Keywords

Model Theory; Forcing; TagGed Tree

Mathematics Subject Classification ID

03E40: Other aspects of forcing and Boolean-valued models

03C25: Model-theoretic forcing

Related Items

Polish group actions: Dichotomies and generalized elementary embeddings, Fraïssé’s conjecture in Π11-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, Π₁¹ relations and paths through, INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS, Topics in invariant descriptive set theory, ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, 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, 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 Π₁ ¹ -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