English
Related papers

Related papers: No universal graphs at uncountable regular cardina…

200 papers

If kappa is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which Diamond_kappa(REG) fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin,…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Mirna Džamonja

Given a countable graph, we say a set $A$ of its vertices is \emph{universal} if it contains every countable graph as an induced subgraph, and $A$ is \emph{weakly universal} if it contains every finite graph as an induced subgraph. We show…

Combinatorics · Mathematics 2017-02-24 Will Brian

Assume ZF($j$) and there is a Reinhardt cardinal, as witnessed by the elementary embedding $j:V\to V$. We investigate the linear iterates $(N_{\alpha},j_{\alpha})$ of $(V,j)$, and their relationship to $(V,j)$, forcing and definability,…

Logic · Mathematics 2020-06-30 Farmer Schlutzenberg

For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and…

Combinatorics · Mathematics 2011-10-20 Bert L. Hartnell , Douglas F. Rall

We will prove that there exists a model of ZFC+``c= omega_2'' in which every M subseteq R of cardinality less than continuum c is meager, and such that for every X subseteq R of cardinality c there exists a continuous function f:R-> R with…

Logic · Mathematics 2016-09-07 Krzysztof Ciesielski , Saharon Shelah

In this paper we mainly consider the class LN of all locally nilpotent groups. We first show that there is no universal group in LN_lambda if lambda is a cardinal such that lambda = lambda^{aleph_0}; here we call a group G universal (in…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah , Simone Wallutis

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

A nuciferous graph is a simple graph with a non-singular $0$-$1$ adjacency matrix $A$ such that all the diagonal entries of $A^{-1}$ are zero and all the off-diagonal entries of $A^{-1}$ are non-zero. Sciriha et al. conjectured that except…

Combinatorics · Mathematics 2016-03-18 Ebrahim Ghorbani

We pursue the idea of generalizing Hindman's Theorem to uncountable cardinalities, by analogy with the way in which Ramsey's Theorem can be generalized to weakly compact cardinals. But unlike Ramsey's Theorem, the outcome of this paper is…

Combinatorics · Mathematics 2018-03-16 David J. Fernández-Bretón

Answering a question of Ketonen from the late 1970's, it is proved that a weakly compact cardinal carrying an indecomposable ultrafilter need not be measurable. The result is obtained by analyzing the limit of a decreasing sequence of…

Logic · Mathematics 2025-12-01 Assaf Rinot , Zhixing You , Jiachen Yuan

We show that Weak Vop\v{e}nka's Principle, which is the statement that the opposite category of ordinals cannot be fully embedded into the category of graphs, is equivalent to the large cardinal principle Ord is Woodin, which says that for…

Logic · Mathematics 2020-01-27 Trevor M. Wilson

Suppose lambda is a singular cardinal of uncountable cofinality kappa. For a model M of cardinality lambda, let No(M) denote the number of isomorphism types of models N of cardinality lambda which are L_{infty lambda}-equivalent to M. In…

Logic · Mathematics 2016-09-07 Saharon Shelah , Pauli Väisänen

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

Logic · Mathematics 2012-08-14 M. Malliaris , S. Shelah

Let $\lambda_{1},\ldots,\lambda_{n}$ be real numbers in $(0,1)$ and $p_{1},\ldots,p_{n}$ be points in $\mathbb{R}^{d}$. Consider the collection of maps $f_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} $ given by $$f_{j}(x)=\lambda_{j} x…

Dynamical Systems · Mathematics 2014-05-29 Simon Baker

We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced structure and apply the star complement technique. Our…

Combinatorics · Mathematics 2017-09-21 Jernej Azarija , Tilen Marc

Motivated by recent work of Boney, Dimopoulos, Gitman and Magidor, we characterize the existence of weak compactness cardinals for all abstract logics through combinatorial properties of the class of ordinals. This analysis is then used to…

Logic · Mathematics 2025-05-22 Philipp Lücke

We prove the consistency of the theory ZFC + there is a strongly compact cardinal from the existence of a cardinal preserving embedding from the universe into an inner model. The proof almost shows that under SCH, every cardinal preserving…

Logic · Mathematics 2021-03-02 Gabriel Goldberg

For a cardinal $\mathfrak{a}$, let $\mathrm{fin}(\mathfrak{a})$ be the cardinality of the set of all finite subsets of a set which is of cardinality $\mathfrak{a}$. It is proved without the aid of the axiom of choice that for all infinite…

Logic · Mathematics 2021-11-02 Guozhen Shen

For an uncountable regular cardinal \kappa we let \nabla_\kappa(A) be the statement that A \subset \kappa and for all regular \theta > \kappa, the set of all X \in [\theta]^<\kappa such that X \cap \kappa \in \kappa and otp(X \cap OR) is a…

Logic · Mathematics 2007-05-23 Ralf Schindler

Building on work of Holy, L\"ucke and Njegomir \cite{MR3913154} on small embedding characterizations of large cardinals, we use some classical results of Baumgartner (see \cite{MR0384553} and \cite{MR0540770}), to give characterizations of…

Logic · Mathematics 2021-02-22 Brent Cody