English
Related papers

Related papers: Universal theories categorical in power and kappa-…

200 papers

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…

Logic · Mathematics 2026-03-13 Farmer Schlutzenberg

We prove that every many-sorted $\omega$-categorical theory is completely interpretable in a one-sorted $\omega$-categorical theory. As an application, we give a short proof of the existence of non $G$--compact $\omega$-categorical…

Logic · Mathematics 2011-03-21 Enrique Casanovas , Rodrigo Peláez , Martin Ziegler

Let kappa be an uncountable regular cardinal. Assuming 2^kappa=kappa^+, we show that the clone lattice on a set of size kappa is not dually atomic.

Rings and Algebras · Mathematics 2007-06-11 Martin Goldstern , Saharon Shelah

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

We prove a weakened version of the reflection of Reinhardt cardinals by super Reinhardt cardinals: Let $M=(V^M,P)$ be a countable model of second order set theory $\mathsf{ZF}_2$ (with universe $V^M$ and classes $P$) which models "$\kappa$…

Logic · Mathematics 2020-05-25 Farmer Schlutzenberg

We investigate the class of models of a general dependent theory. We continue math.LO/0702292 in particular investigating so called "decomposition of types"; thesis is that what holds for stable theory and for Th(Q,<) hold for dependent…

Logic · Mathematics 2012-02-28 Saharon Shelah

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…

Logic · Mathematics 2007-05-23 Arthur W. Apter , James Cummings , Joel David Hamkins

The category of models of any theory $T$ in any first-order language $L$ has the surprising property that any small category that is elementarily equivalent with it, already embeds in it. The proof uses an abstract argument via ultrapowers,…

Logic · Mathematics 2025-12-23 Hans Schoutens

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…

Logic · Mathematics 2019-01-18 P. D. Welch

In which a review of the concept of countability is done in mathematics, subjecting review some of the theorems so far accepted, showing their inconsistency and also taking concrete elements on the countability of all the powers of the set…

General Mathematics · Mathematics 2016-01-07 Denis Martínez Tápanes

We prove that the Generalized Continuum Hypothesis holds above a supercompact cardinal assuming the Ultrapower Axiom, an abstract comparison principle motivated by inner model theory at the level of supercompact cardinals.

Logic · Mathematics 2018-10-12 Gabriel Goldberg

Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally,…

Logic · Mathematics 2017-08-08 Saharon Shelah

A universal Turing machine is a powerful concept - a single device can compute any function that is computable. A universal spin model, similarly, is a class of physical systems whose low energy behavior simulates that of any spin system.…

Computational Complexity · Computer Science 2024-06-25 Tomáš Gonda , Gemma De les Coves

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…

Computational Complexity · Computer Science 2024-09-04 Tomáš Gonda , Tobias Reinhart , Sebastian Stengele , Gemma De les Coves

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Logic · Mathematics 2024-03-19 David Asperó , Sean Cox , Asaf Karagila , Christoph Weiss

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We can generalize the definition of {\it splitting number } $s(\kappa )$ for $\kappa$ uncountable regular: $s(\kappa )=min\{ |\Cal S|:\Cal S\subset \Cal P(\kappa ) \forall a\in \kappa ^\kappa \exists b\in \Cal S |a\cap b|=|a\setminus…

Logic · Mathematics 2008-02-03 Jindřich Zapletal

Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…

Logic · Mathematics 2021-04-13 Gabriel Fernandes , Ralf Schindler

We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…

Logic · Mathematics 2017-02-22 Will Boney