A microscopic approach to Souslin-tree constructions. I.
From MaRDI portal
Publication:2404650
Abstract: We propose a parameterized proxy principle from which -Souslin trees with various additional features can be constructed, regardless of the identity of . We then introduce the microscopic approach, which is a simple method for deriving trees from instances of the proxy principle. As a demonstration, we give a construction of a coherent -Souslin tree that applies also for inaccessible. We then carry out a systematic study of the consistency of instances of the proxy principle, distinguished by the vector of parameters serving as its input. Among other things, it will be shown that all known -based constructions of -Souslin trees may be redirected through this new proxy principle.
Recommendations
- A microscopic approach to Souslin-tree construction. II
- scientific article; zbMATH DE number 4106826
- On the rigidity of souslin trees and their generic branches
- scientific article; zbMATH DE number 3841841
- Higher Souslin trees and the GCH, revisited
- On a refinement of anti-Souslin tree property
- On the existence and construction of non-extreme (a,b)-trees.
- A descriptive construction of trees and Stallings' theorem
- Degrees of Souslin Trees
- scientific article; zbMATH DE number 492708
Cites work
- -complete Souslin trees on ^ +
- A global version of a theorem of Ben-David and Magidor
- A microscopic approach to Souslin-tree constructions. I.
- A Note on the Combinatorial Principles ◊(E)
- A question about Suslin trees and the weak square hierarchy
- An variation for one souslin tree
- Ascending paths and forcings that specialize higher Aronszajn trees
- Canonical models for _1-combinatorics
- Chain conditions of products, and weakly compact cardinals
- CHARACTERIZATION OF □κ IN CORE MODELS
- Chromatic numbers of graphs -- large gaps
- Covering properties and square principles
- Diamonds
- Embedding Trees in the Rationals
- Global square sequences in extender models
- Guessing clubs in the generalized club filter
- Higher Souslin trees and the GCH, revisited
- Higher Souslin trees and the generalized continuum hypothesis
- scientific article; zbMATH DE number 6011038 (Why is no real title available?)
- scientific article; zbMATH DE number 426347 (Why is no real title available?)
- scientific article; zbMATH DE number 3885892 (Why is no real title available?)
- scientific article; zbMATH DE number 3888510 (Why is no real title available?)
- scientific article; zbMATH DE number 3861143 (Why is no real title available?)
- scientific article; zbMATH DE number 4200229 (Why is no real title available?)
- scientific article; zbMATH DE number 3702632 (Why is no real title available?)
- scientific article; zbMATH DE number 3591984 (Why is no real title available?)
- scientific article; zbMATH DE number 1314876 (Why is no real title available?)
- scientific article; zbMATH DE number 1097274 (Why is no real title available?)
- scientific article; zbMATH DE number 195155 (Why is no real title available?)
- scientific article; zbMATH DE number 1834586 (Why is no real title available?)
- scientific article; zbMATH DE number 3336799 (Why is no real title available?)
- scientific article; zbMATH DE number 3023012 (Why is no real title available?)
- Iterated Cohen extensions and Souslin's problem
- Jensen's diamond principle and its relatives
- Jensen's ⃞ principles and the Novák number of partially ordered sets
- Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
- Martin’s maximum and weak square
- On Countably Compact, Perfectly Normal Spaces
- On guessing generalized clubs at the successors of regulars
- On the history of Souslin's problem
- Optimal matrices of partitions and an application to Souslin trees
- Partitioning pairs of countable ordinals
- Putting a diamond inside the square
- Reduced powers of ℵ_2-trees
- REDUCED POWERS OF SOUSLIN TREES
- Same graph, different universe
- Set Theory
- Set theory.
- Set theory. An introduction to independence proofs
- Set theory. An introduction to large cardinals
- Set theory. Exploring independence and truth
- Souslin trees and successors of singular cardinals
- Souslin trees which are hard to specialise
- Souslin's Conjecture
- Squares with diamonds and Souslin trees with special squares
- Squares, scales and stationary reflection
- Sticks and clubs
- Sur un problème de Sikorski
- The consistency of a club-guessing failure at the successor of a regular cardinal
- The fine structure of the constructible hierarchy
- The Ostaszewski square and homogeneous Souslin trees
- The Souslin problem
- The tree property at successors of singular cardinals
- The uniformization property for \(chi_ 2\).
- The ℵ 2 \1-Souslin Hypothesis
- Trees, subtrees and order types
- Weakly Compact Cardinals and Nonspecial Aronszajn Trees
Cited in
(24)- Fake reflection
- On the ideal \(J[\kappa]\)
- Was Ulam right? I: basic theory and subnormal ideals
- A guessing principle from a Souslin tree, with applications to topology
- A remark on Schimmerling's question
- More notions of forcing add a Souslin tree
- A microscopic approach to Souslin-tree constructions. I.
- Same graph, different universe
- A microscopic approach to Souslin-tree construction. II
- A large pairwise far family of Aronszajn trees
- REDUCED POWERS OF SOUSLIN TREES
- A Forcing Axiom Deciding the Generalized Souslin Hypothesis
- Pseudo-Prikry sequences
- Ramsey theory over partitions III: Strongly Luzin sets and partition relations
- Aronszajn trees, square principles, and stationary reflection
- Souslin trees at successors of regular cardinals
- On the complexity of classes of uncountable structures: trees on $\aleph _1$
- Square with built-in diamond-plus
- Full Souslin trees at small cardinals
- More minimal non-\(\sigma\)-scattered linear orders
- A club guessing toolbox. I
- Ladders and squares
- Construction schemes: transferring structures from to _1
- The power of trees
This page was built for publication: A microscopic approach to Souslin-tree constructions. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2404650)