中文
相关论文

相关论文: The Cardinality of the second uniform indiscernibl…

200 篇论文

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

逻辑 · 数学 2018-08-16 Vladimir Kanovei

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

组合数学 · 数学 2011-02-01 Victor N. Ermolaev , Giulio Iacobelli

In a recent paper, Enayat and Le lyk [2024] show that second order arithmetic and countable set theory are not definitionally equivalent. It is well known that these theories are biinterpretable. Thus, we have a pair of natural theories…

逻辑 · 数学 2025-08-07 Jason Chen , Toby Meadows

We examine the existence of universal elements in classes of infinite abelian groups. The main method is using group invariants which are defined relative to club guessing sequences. We prove, for example: Theorem: For $n\ge 2$, there is a…

逻辑 · 数学 2016-09-06 Menachem Kojman , Saharon Shelah

While the natural model-theoretic ranks available in differentially closed fields (of characteristic zero), namely Lascar and Morley rank, are known not to be definable in families of differential varieties; in this note we show that the…

交换代数 · 数学 2018-06-07 James Freitag , Omar Leon Sanchez , Wei Li

A subset $\mathcal X$ of a C*-algebra $\mathcal A$ is called irredundant if no $A\in \mathcal X$ belongs to the C*-subalgebra of $\mathcal A$ generated by $\mathcal X\setminus \{A\}$. Separable C*-algebras cannot have uncountable…

算子代数 · 数学 2020-07-29 Clayton Suguio Hida , Piotr Koszmider

In this paper, we present a second partial solution for the problem of cardinality calculation of the set of fractals for its subcategory of the random virtual ones. Consistent with the deterministic case, we show that for the given…

概率论 · 数学 2022-06-07 Mohsen Soltanifar

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

环与代数 · 数学 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

We study ultrafilters on regular uncountable cardinals, with a primary focus on $\omega_1$, and particularly in relation to the Tukey order on directed sets. Results include the independence from ZFC of the assertion that every uniform…

逻辑 · 数学 2025-07-31 Tom Benhamou , Justin T. Moore , Luke Serafin

Normal ideals on regular uncountable cardinals are familiar objects. We investigate ideals that are pleasant--while a normal ideal is closed under arbitrary diagonal unions, a pleasant ideal is closed only under diagonal unions indexed by…

逻辑 · 数学 2009-09-25 Christopher Leary

It is shown that each pseudonorm defined on a subgroup $H$ of an abelian group $G$ can be extended to a pseudonorm on $G$ such that the densities of the obtained pseudometrizable topological groups coincide. We derive from this that any…

一般拓扑 · 数学 2008-10-20 T. Banakh , L. Zdomskyy

We deal with the complex issue of whether large cardinals are intrinsically justified principles of set theory (we call this the Intrinsicness Issue). In order to do this, we review, in a systematic fashion, (1.) the abstract principles…

逻辑 · 数学 2023-10-10 Joan Bagaria , Claudio Ternullo

In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…

一般拓扑 · 数学 2018-08-23 Liljana Babinkostova , Bruno A. Pansera , Marion Scheepers

Martin's remarkable proof of $\mathbf{\Pi}^1_2$-determinacy from an iterable rank-into-rank embedding highlighted the connection between large cardinals and determinacy. In this paper, we isolate a large cardinal object called a measurable…

逻辑 · 数学 2025-07-25 Hanul Jeon

For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…

计算机科学中的逻辑 · 计算机科学 2025-08-18 Louwe Kuijer , Tony Tan , Frank Wolter , Michael Zakharyaschev

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

逻辑 · 数学 2007-05-23 Mirna Džamonja , Saharon Shelah

For every uncountable cardinal $\kappa$ there are $2^\kappa$ nonisomorphic simple AF algebras of density character $\kappa$ and $2^\kappa$ nonisomorphic hyperfinite II$_1$ factors of density character $\kappa$. These estimates are maximal…

算子代数 · 数学 2013-01-28 Ilijas Farah , Takeshi Katsura

We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…

逻辑 · 数学 2016-02-26 Dilip Raghavan , Stevo Todorcevic

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

逻辑 · 数学 2019-01-18 P. D. Welch

An RNA secondary structure is designable if there is an RNA sequence which can attain its maximum number of base pairs only by adopting that structure. The combinatorial RNA design problem, introduced by Hale\v{s} et al. in 2016, is to…

组合数学 · 数学 2020-05-12 Jonathan Jedwab , Tara Petrie , Samuel Simon