Perfect trees and elementary embeddings
From MaRDI portal
Recommendations
- Embeddings and other mappings of rooted trees into complete trees
- Embedding trees in recursive circulants
- Perfect forests in graphs and their extensions
- scientific article; zbMATH DE number 7724227
- On embedding graphs in trees
- Tree- and forest-perfect graphs
- Lattice embeddings of trees
- Combinatorial theorems about embedding trees on the real line
- Perfect pairs of trees in graphs
- Self-embeddings of trees
Cites work
Cited in
(21)- A Laver-like indestructibility for hypermeasurable cardinals
- Embedding trees in recursive circulants
- A definable failure of the singular cardinal hypothesis
- Embeddings and other mappings of rooted trees into complete trees
- A lifting argument for the generalized Grigorieff forcing
- Iterated forcing and elementary embeddings
- Ideals and generic elementary embeddings
- The failure of GCH at a degree of supercompactness
- The structure of the Mitchell order. I
- Internal consistency for embedding complexity
- Easton's theorem in the presence of Woodin cardinals
- scientific article; zbMATH DE number 1786791 (Why is no real title available?)
- The Halpern-Läuchli theorem at a measurable cardinal
- Normal measures on a tall cardinal
- Definable normal measures
- Normal measures on large cardinals
- Global singularization and the failure of SCH
- Measures that violate the generalized continuum hypothesis
- Small universal families for graphs omitting cliques without GCH
- Easton's theorem and large cardinals from the optimal hypothesis
- Easton's theorem and large cardinals
This page was built for publication: Perfect trees and elementary embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617368)