中文
相关论文

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

200 篇论文

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

逻辑 · 数学 2009-09-25 Sy D. Friedman

Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…

综合数学 · 数学 2009-09-29 W. Mueckenheim

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

逻辑 · 数学 2016-09-06 Boban Velickovic , W. Hugh Woodin

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

逻辑 · 数学 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

It is proved that the consistency strength of having definable tree property for successors of all regular cardinals is the consistency strength of having proper class many small large cardinals which are defined very similar to…

逻辑 · 数学 2015-11-24 Ali Sadegh Daghighi , Massoud Pourmahdian

We define the property of Pi_2-compactness of a statement phi of set theory, meaning roughly that the hard core of the impact of phi on combinatorics of aleph_1 can be isolated in a canonical model for the statement phi. We show that the…

逻辑 · 数学 2009-09-25 Saharon Shelah , Jindřich Zapletal

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

逻辑 · 数学 2012-05-07 Ioannis Souldatos

We prove the consistency, assuming an ineffable cardinal, that any two normal countably closed $\omega_2$-Aronszajn trees are club isomorphic. This work generalizes to higher cardinals the property of Abraham-Shelah that any two normal…

逻辑 · 数学 2018-06-05 John Krueger

A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a…

逻辑 · 数学 2025-06-18 Kenneth Gill

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

组合数学 · 数学 2015-11-20 Sebastiano Ferraris , Alex Mendelson , Gerardo Ballesio , Tom Vercauteren

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…

逻辑 · 数学 2022-04-19 Menachem Kojman , Assaf Rinot , Juris Steprans

We introduce a natural two-cardinal version of Bagaria's sequence of derived topologies on ordinals. We prove that for our sequence of two-cardinal derived topologies, limit points of sets can be characterized in terms of a new iterated…

逻辑 · 数学 2024-02-14 Brent Cody , Chris Lambie-Hanson , Jing Zhang

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

逻辑 · 数学 2011-12-15 Laura Fontanella

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Viktor Kuncak , Martin Rinard

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

逻辑 · 数学 2023-06-05 Pablo Andújar Guerrero

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

计算机科学中的逻辑 · 计算机科学 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger

Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…

数论 · 数学 2020-10-13 Rinat Kashaev

Based upon the axiom of choice it is proved that the cardinality of the rational numbers is not less than the cardinality of the irrational numbers. This contradicts a main result of transfinite set theory and shows that the axiom of choice…

综合数学 · 数学 2009-09-29 W. Mueckenheim

It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…

逻辑 · 数学 2019-04-05 Dilip Raghavan , Saharon Shelah

We prove the following continuous analogue of Vaught's Two-Cardinal Theorem: if for some $\kappa>\lambda\geq \aleph_0$, a continuous theory $T$ has a model with density character $\kappa$ which has a definable subset of density character…

逻辑 · 数学 2021-10-13 Victoria Noquez