Choiceless Ramsey theory of linear orders
type: Item
instance of: scholarly article
title: Choiceless Ramsey theory of linear orders
zbMATH Open document ID: 1436.03242
author: Philipp Lücke
author: Philipp Schlicht
author: Thilo Weinert
published in: Order
publication date: 2017-12-21T00:00:00Z
review text: The authors study Ramsey theory of linear orders without the axiom of choice. They mainly study the linear orders $\langle ^{\alpha}2,<_{\mathrm{lex}} \rangle$ for an infinite ordinal $\alpha$ and the lexicographical order $<_{\mathrm{lex}}$. If $\kappa$ is an infinite cardinal with $\kappa^{<\kappa} = \kappa$, then in ZFC we have $\langle ^{\kappa}2,<_{\mathrm{lex}} \rangle \not\rightarrow \langle ^{\kappa}2,<_{\mathrm{lex}}\rangle^1_2$. \par Here, the authors obtain the consistency of several partition relations that are incompatible with the axion of choice. So the derive partition relations for $\langle ^{\omega}2,<_{\mathrm{lex}}\rangle$ from the Baire property for all subsets of $^{\omega}2$. They show that the above assumption implies that $\langle ^{\omega}2,<_{\mathrm{lex}} \rangle \rightarrow \langle ^{\omega}2,<_{\mathrm{lex}} \rangle^2_n$ for all natural numbers $n$. \par Starting with a model $V$ of ZFC and $\kappa$ a regular cardinal, they show that there is a symmetric extension of $V$ by a $<\kappa$-closed $\kappa^+$-c.c. forcing in which $\langle ^{\kappa}2,<_{\mathrm{lex}}\rangle \rightarrow \langle ^{\kappa}2,<_{\mathrm{lex}}\rangle^2_n$. \par They have negative partition relations for triples and quadruples. They completely classify the partition relations $\langle ^{\omega}2,<_{\mathrm{lex}} \rangle \rightarrow (\bigvee_{\nu<\lambda} K_\nu, \bigvee_{\nu<\mu}M_\nu)^m$ for linear orders $K_\nu$, $M_\nu$ and $m\leq 4$ and $\langle ^{\omega}2,<_{\mathrm{lex}} \rangle \rightarrow (K,M)^n$ for linear orders $K$, $M$ and $n$ a natural number, which are consistent.
reviewed by: Martin Weese
Mathematics Subject Classification ID: 03E02
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 03E25
Mathematics Subject Classification ID: 03E35
Mathematics Subject Classification ID: 03E60
Mathematics Subject Classification ID: 05D10
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 6820905
zbMATH Keywords: Ramsey theory
zbMATH Keywords: partition relations
zbMATH Keywords: linear orders
zbMATH Keywords: axiom of choice
zbMATH Keywords: axiom of determinacy
MaRDI profile type: Publication
full work available at URL: s11083-016-9405-0
OpenAlex ID: W2538105650
cites work: PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES
cites work: Catalan Numbers
cites work: The Hurewicz dichotomy for generalized Baire spaces
cites work: Idiosynchromatic poetry
cites work: A Partition Theorem for Triples
cites work: \(\Sigma ^{1}_{1}\)-definability at uncountable regular cardinals
cites work: Q3001425
cites work: Iterated Forcing and Elementary Embeddings
cites work: Countable partition ordinals
cites work: An Outline of Inner Model Theory
cites work: Q4268628
cites work: Partitioning triples and partially ordered sets
cites work: Q3607634
cites work: Divisibility of countable metric spaces
cites work: Q3374860
cites work: The strong partition relation on ω1 revisited
cites work: Souslin partitions of products of finite sets
cites work: Q4805123
cites work: Proper forcing and \(L(\mathbb{R})\)
cites work: Small forcing creates neither strong nor Woodin cardinals
cites work: Some remarks on the partition calculus of ordinals
cites work: Q4236280
cites work: Q4882943
cites work: Q4881836
cites work: Catalan numbers, their generalization, and their uses
cites work: A New Proof of the Strong Partition Relation on ω 1
cites work: Projective determinacy
cites work: Can you take Solovay's inaccessible away?
cites work: Equivalence of partition properties and determinacy
cites work: A Partition Theorem For Perfect Sets
cites work: Q3607633
cites work: All uncountable cardinals can be singular
cites work: Partition relations for denumerable ordinals
cites work: Happy families
cites work: Determinateness and Partitions
cites work: A short proof of a partition theorem for the ordinal ωω
cites work: A Theorem in the Partition Calculus
cites work: Partition Relations for ηα -sets
cites work: Strong partition properties for infinite cardinals
cites work: Q5609367
cites work: A Note on the Historical Development of Logic Diagrams: Leibniz, Euler and Venn
cites work: Algebraic independence and measure
cites work: A Partition Theorem
cites work: A Note on the Partition Calculus of P. ErdÖs and R. Rado
cites work: On a classification of denumerable order types and an application to the partition calculus
cites work: Q3249046
cites work: A partition calculus in set theory
cites work: Q4753168
DOI: 10.1007/S11083-016-9405-0
description: scientific article; zbMATH DE number 6820905