Partition theorems for expanded trees

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Shelah, Saharon
Format: Preprint
Published: 2021
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908744932130816
author Shelah, Saharon
author_facet Shelah, Saharon
contents We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{κ\ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding to preserve the height of the tree but the equality of levels is preserved. We get consistency results without large cardinals. The intention is to apply it to model theoretic problems.
format Preprint
id arxiv_https___arxiv_org_abs_2108_13955
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Partition theorems for expanded trees
Shelah, Saharon
Logic
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{κ\ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding to preserve the height of the tree but the equality of levels is preserved. We get consistency results without large cardinals. The intention is to apply it to model theoretic problems.
title Partition theorems for expanded trees
topic Logic
url https://arxiv.org/abs/2108.13955