Choiceless Ramsey theory of linear orders

DOI10.1007/s11083-016-9405-0zbMath1436.03242OpenAlexW2538105650MaRDI QIDQ1686191

Philipp Lücke, Philipp Schlicht, Thilo Weinert

Publication date: 21 December 2017

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-016-9405-0

zbMATH Keywords

Ramsey theorylinear ordersaxiom of choicepartition relationsaxiom of determinacy

Mathematics Subject Classification ID

Consistency and independence results (03E35) Ramsey theory (05D10) Total orders (06A05) Other combinatorial set theory (03E05) Partition relations (03E02) Axiom of choice and related propositions (03E25) Determinacy principles (03E60)

Related Items

Finiteness classes arising from Ramsey-theoretic statements in set theory without choice

Cites Work

• The Hurewicz dichotomy for generalized Baire spaces
• Countable partition ordinals
• Can you take Solovay's inaccessible away?
• Partition relations for denumerable ordinals
• All uncountable cardinals can be singular
• Catalan numbers, their generalization, and their uses
• Souslin partitions of products of finite sets
• Idiosynchromatic poetry
• Divisibility of countable metric spaces
• Proper forcing and L(ℝ)
• -definability at uncountable regular cardinals
• Iterated Forcing and Elementary Embeddings
• An Outline of Inner Model Theory
• A Theorem in the Partition Calculus
• A partition calculus in set theory
• A New Proof of the Strong Partition Relation on ω 1
• Equivalence of partition properties and determinacy
• Projective determinacy
• On a classification of denumerable order types and an application to the partition calculus
• A Partition Theorem For Perfect Sets
• Determinateness and Partitions
• Happy families
• Some remarks on the partition calculus of ordinals
• The strong partition relation on ω₁ revisited
• Small forcing creates neither strong nor Woodin cardinals
• PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES
• A Partition Theorem for Triples
• Catalan Numbers
• A short proof of a partition theorem for the ordinal ωω
• Partitioning triples and partially ordered sets
• A Partition Theorem
• A Note on the Partition Calculus of P. ErdÖs and R. Rado
• A Note on the Historical Development of Logic Diagrams: Leibniz, Euler and Venn
• Algebraic independence and measure
• Partition Relations for η_α -sets
• Strong partition properties for infinite cardinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item