中文
相关论文

相关论文: A large Pi-1-2 set absolute for set forcing

200 篇论文

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

逻辑 · 数学 2024-03-26 Gabriele Gullà

If ZFC is consistent, then each of the following are consistent with ZFC + 2^{{aleph_0}}= aleph_2 : 1.) X subseteq R is of strong measure zero iff |X| <= aleph_1 + there is a generalized Sierpinski set. 2.) The union of aleph_1 many strong…

逻辑 · 数学 2009-09-25 Martin Goldstern , Haim Judah , Saharon Shelah

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

逻辑 · 数学 2020-03-23 Matteo Viale

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

逻辑 · 数学 2022-02-25 Jeffrey Bergfalk , Vera Fischer , Corey Bacal Switzer

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

综合数学 · 数学 2007-05-23 Marina V. Semenova , Friedrich Wehrung

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

数论 · 数学 2009-10-27 Mohamed El Bachraoui

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

综合数学 · 数学 2009-04-15 Slavko Rede

If L is an order polynomially complete lattice, (that is: every monotone function from L^n to L is induced by a lattice-theoretic polynomial) then the cardinality of L is a strongly inaccessible cardinal. In particular, the existence of…

逻辑 · 数学 2016-09-07 Martin Goldstern , Saharon Shelah

We show that the supremum of the lengths of boldface Delta-1-2 prewellorderings of the reals can be Aleph-2, with Aleph-1 inac- cessible to reals, assuming only the consistency of an inaccessible.

逻辑 · 数学 2016-09-06 Sy D. Friedman , W. Hugh Woodin

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

数论 · 数学 2015-06-02 Patrick Cégielski , Serge Grigorieff , Irène Guessarian

In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…

逻辑 · 数学 2007-05-23 Saharon Shelah

We investigate and quantify the distinction between rectifiable and purely unrectifiable 1-sets in the plane. That is, given that purely unrectifiable 1-sets always have null intersections with Lipschitz images, we ask whether these sets…

经典分析与常微分方程 · 数学 2025-12-08 Blair Davey , Silvia Ghinassi , Bobby Wilson

Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…

逻辑 · 数学 2013-05-27 Dilip Raghavan , Stevo Todorcevic

It is known that the set of possible cofinalities $\mathrm{pcf}(A)$ has good properties if $A$ is a progressive interval of regular cardinals. In this paper, we give an interval of regular cardinals $A$ such that $\mathrm{pcf}(A)$ has no…

逻辑 · 数学 2022-01-10 Kenta Tsukuura

Let \psi(x) be a polynomial with rational coefficients. Suppose that \psi has the positive leading coefficient and zero constant term. Let A be a set of positive integers with the positive upper density. Then there exist x,y\in A and a…

数论 · 数学 2007-11-08 Hongze Li , Hao Pan

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

组合数学 · 数学 2018-02-02 Emily J. Olson , Bruce E. Sagan

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

逻辑 · 数学 2016-09-07 Ernest Schimmerling , John R. Steel

Assuming an inaccessible cardinal kappa, there is a generic extension in which MA + 2^{aleph_0} = kappa holds and the reals have a Delta^2_1 well-ordering.

逻辑 · 数学 2008-02-03 Uri Abraham , Saharon Shelah

Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…

综合数学 · 数学 2026-04-24 William Johnston

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

逻辑 · 数学 2016-09-07 Saharon Shelah