English
Related papers

Related papers: Are all natural numbers the same

200 papers

This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which…

Logic · Mathematics 2016-05-31 Jacob Davis

The forcing number of a perfect matching of a graph was introduced by Harary et al., which originated from Klein and Randi\'{c}'s ideal of innate degree of freedom of Kekul\'{e} structure in molecular graph. On the opposite side in some…

Combinatorics · Mathematics 2020-04-13 Kai Deng , Saihua Liu , Xiangqian Zhou

We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…

Logic · Mathematics 2014-07-16 Giorgio Venturi

We generically construct a model in which the ${\Pi^1_3}$-uniformization property is true, thus lowering the best known consistency strength from the existence of $M_1^{\#}$ to just $\mathsf{ZFC}$. The forcing construction can be adapted to…

Logic · Mathematics 2022-10-18 Stefan Hoffelner

Factor Analysis (FA) is a technique of fundamental importance that is widely used in classical and modern multivariate statistics, psychometrics and econometrics. In this paper, we revisit the classical rank-constrained FA problem, which…

Methodology · Statistics 2017-04-25 Dimitris Bertsimas , Martin S. Copenhaver , Rahul Mazumder

We show that given a reflecting cardinal, one can produce a model of $\mathsf{BPFA}$ where the $\Sigma^1_n$-uniformization property holds simultaneously for all $n \ge 2$.

Logic · Mathematics 2025-06-17 Stefan Hoffelner

We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…

Logic · Mathematics 2024-01-30 Chris Lambie-Hanson , Assaf Rinot , Jing Zhang

Motivated by the goal of constructing a model in which there are no $\kappa$-Aronszajn trees for any regular $\kappa>\aleph_1$, we produce a model with many singular cardinals where both the singular cardinals hypothesis and weak square…

Logic · Mathematics 2020-05-22 Omer Ben-Neria , Chris Lambie-Hanson , Spencer Unger

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

Logic · Mathematics 2008-02-03 Saharon Shelah

We give arguments for and prove the consistency of some internal forcing axioms.

Logic · Mathematics 2009-09-25 Garvin Melles

Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…

Number Theory · Mathematics 2023-01-19 Avraham Bourla

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

Logic · Mathematics 2017-09-26 Milos Kurilic

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

Logic · Mathematics 2021-09-16 Philipp Lücke , Ioannis Souldatos

A narrow system is a combinatorial object introduced by Magidor and Shelah in connection with work on the tree property at successors of singular cardinals. In analogy to the tree property, a cardinal $\kappa$ satisfies the \emph{narrow…

Logic · Mathematics 2017-04-13 Chris Lambie-Hanson

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…

Logic · Mathematics 2010-03-03 Saharon Shelah

We obtain a complete characterization of \emph{topologically exact patterns} on \emph{triods}. Based on their \emph{rotation number} $\rho$, these \emph{exact patterns} are grouped into three classes: \emph{slow} ($\rho < \frac{1}{3}$),…

Dynamical Systems · Mathematics 2025-12-02 Sourav Bhattacharya

We present a forcing for blowing up 2^lambda and making ``many positive polarized partition relations'' (in a sense made precise in (c) of our main theorem) hold in the interval [lambda, 2^lambda]. This generalizes results of [276], Section…

Logic · Mathematics 2007-05-23 Saharon Shelah , Lee Stanley

Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…

Artificial Intelligence · Computer Science 2026-04-15 Victor David , Jérôme Delobelle , Jean-Guy Mailly

We analyze some posets involved in forcing constructions for dense ideals, showing that the Anonymous Collapse and the Dual Shioya Collapse are equivalent for collapsing a large cardinal to $\omega_2$. We also give a somewhat simplified…

Logic · Mathematics 2025-03-04 Monroe Eskew

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Logic · Mathematics 2012-09-07 Brent Cody
‹ Prev 1 3 4 5 6 7 10 Next ›