arXiv math/97022091997-02-26math.LO

Coloring ordinals by reals

Sakae Fuchino

英文摘要：

We introduce several new set-theoretic axioms formulated in terms of coloring of ordinals by reals. We show that these axioms generalize the axioms considered by I.Juhasz, L.Soukup and Z.Szentmiklossy, and give a class of p.o.s including Cohen p.o.-sets which force the axioms. In appearance these axioms are somewhat similar to OCA but it appears that they are inconsistent with OCA.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Coloring ordinals by reals

We study combinatorial principles we call Homogeneity Principle HP(κ) and Injectivity Principle IP(κ,λ) for regular κ>\aleph_1 and λ\leqκwhich are formulated in terms of coloring the ordinals <κby reals.

2007-04-14math.LO

Successors of singular cardinals and coloring theorems. I

We investigate the existence of strong colorings on successors of singular cardinals. This work continues Section 2 of [Sh:413] (math.LO/9809199), but now our emphasis is on finding colorings of pairs of ordinals, rather than colorings of finite sets of ordinals.

2002-01-02math.LO

Ramsey theory over partitions III: Strongly Luzin sets and partition relations

The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of reals of size $\aleph_1$. In the other direction, it is shown that the existence of both a strongly Luzin set and a coherent Souslin tree is compatible with the existence of a countable partition of pairs of countable ordinals such that no coloring is strong over it. This clarifies the interaction between a gallery of coloring assertions going back to Luzin and Sierpinski a hundred years ago.

2022-04-16math.LO

支配实数与序数理论

Dominating Reals and Ordinal Theories

University of Florida（佛罗里达大学）

研究Hechler力迫对序数理论的改变，属数学逻辑领域的理论探索。

2026-09-01math.LO

The Foundations of Mathematics in the Physical Reality

In this article we present an axiomatic definition of sets with individuals and a definition of natural numbers and ordinals. We use the axioms pairs, union, power, regularity and separation. We define the equality of sets and of individuals. There is no empty set. A single shoe is not a singleton set but an individual, a pair of shoes is a set. We call limit ordinals first numbers, that is a first number of the Peano axioms. An axiom of infinity is postulated and we prove the Peano axioms for ordinals with a first number up to a first $ω^ω$-number. Then we prove a first $ω^ω$-number notequal …

2022-05-30math.LO

Les nombres de Cuesta-Conway comme extension des ordinaux de Cantor: une courte introduction aux nombres surréels

On Cuesta-Conway numbers as an extension of Cantor's ordinals: A short introduction to surreal numbers. The class of Cuesta-Conway numbers, the surreal numbers, can be defined simply, starting from their normal forms (families of exponentials indexed by ordinals), as an extension of the reals and ordinals from which easily follow addition, multiplication, and total order relation. A construction of this class yields an increasing sequence of real-closed fields, preliminary, so to say. A complete proof is also given the well-known result that the class of surreal numbers is a totally ordered, c…

2022-04-05math.LO

更多相关论文收起更多论文

The mouse set conjecture for sets of reals

Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is ordinal definable from a real if and only if it belongs to a mouse over the reals. We prove that the Mouse Set Conjecture implies the Mouse Set Conjecture for sets of reals.

2021-10-12math.LO

OD elements of countable OD sets in the Solovay model

It is true in the Solovay model that every countable ordinal-definable set of sets of reals contains only ordinal-definable elements.

2016-03-15math.LO

利用序数图灵机处理任意量词复杂度的陈述的有效可约性

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines

Institut für Mathematik, Europa-Universität Flensburg（弗伦斯堡欧洲大学数学研究所）

本文扩展了利用序数图灵机处理任意量词复杂度的陈述的有效可约性概念，用于比较集合论基本原理及基数相关原理的可约性。

2026-05-08math.LO

Surreal fields stable under exponential, logarithmic, derivative and anti-derivative functions

The class of surreal numbers, denoted by $\textbf{No}$, initially proposed by Conway, is a universal ordered field in the sense that any ordered field can be embedded in it. They include in particular the real numbers and the ordinal numbers. They have strong relations with other fields such as field of transseries. Following Gonshor, surreal numbers can be seen as signs sequences of ordinal length, with some exponential and logarithmic functions that extend the usual functions over the reals. $\textbf{No}$ can actually be seen as an elegant (generalized) power series field with real coefficie…

2022-10-25math.LO

The Largest Countable Inductive Set is a Mouse Set

Let kappa be the least ordinal alpha such that L_{alpha}(R) is admissible. Let A be the set of reals x such that x is ordinal definable in L_α(R), for some alpha<kappa. It is well known that (assuming determinacy) A is the largest countable inductive set of reals. Let T be the following theory: ZFC - Replacement + "There exists $ω$ Woodin cardinals which are cofinal in the ordinals." T has consistency strength weaker than that of the theory ZFC + "There exists omega Woodin cardinals", but stronger than that of the theory ZFC + "There exists n Woodin Cardinals", for each n. Let M be the canonic…

1996-09-16math.LO

Infinite computations with random oracles

We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it already computable? We show that the answer is independent from ZFC for ordinal time machines (OTMs) with and without ordinal parameters and give a positive answer for most other machines. For instance, we consider, infinite time Turing machines (ITTMs), unresetting and resetting infinite time register machines (wITRMs, ITRMs), and α-Turing machines for countable …

2014-01-10math.LO