Forcing with tagged trees

DOI10.1016/0003-4843(78)90026-8zbMATH Open0404.03020OpenAlexW2080426944MaRDI QIDQ4189261FDOQ4189261

Authors: John 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

ForcingModel TheoryTagGed Tree

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Model-theoretic forcing (03C25)

Cited In (34)

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

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)