English
Related papers

Related papers: Subcompact cardinals, type omission and ladder sys…

200 papers

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

Logic · Mathematics 2009-04-05 Paolo Lipparini

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Logic · Mathematics 2011-10-18 A. Kiselev

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Logic · Mathematics 2010-06-22 Shahram Mohsenipour

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

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…

Logic · Mathematics 2024-03-26 Gabriele Gullà

We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection…

Logic · Mathematics 2022-10-14 Brent Cody

We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…

Logic · Mathematics 2022-03-15 Saharon Shelah

In [Bon20], model theoretic characterizations of several established large cardinal notions were given. We continue this work, by establishing such characterizations for Woodin cardinals (and variants), various virtual large cardinals, and…

Logic · Mathematics 2022-02-02 Will Boney , Stamatis Dimopoulos , Victoria Gitman , Menachem Magidor

We to a large extent sort out when does a (first order complete theory) T have a superlimit model in a cardinal lambda . Also we deal with relation notions of being limit.

Logic · Mathematics 2017-08-18 Saharon Shelah

Assuming the existence of a proper class of supercompact cardinals, we force that for every regular cardinal $\kappa$, there are $\kappa^+$-Aronszajn trees and all such trees are special.

Logic · Mathematics 2019-07-10 Mohammad Golshani , Yair Hayut

We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…

Logic · Mathematics 2026-02-11 Tom Benhamou , Natasha Dobrinen

We recall results concerning one-dimensional classical and quantum systems with ladder operators. We obtain the most general one-dimensional classical systems respectively with a third and a fourth order ladder operators satisfying…

Mathematical Physics · Physics 2015-05-30 Ian Marquette

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

The work presents the first part of second edition of the previous edition of 2000 under the same title containing the proof (in ZF) of the nonexistence of inaccessible cardinals, now enriched and improved. This part contains the apparatus…

Logic · Mathematics 2011-10-13 A. Kiselev

We construct a model of ZFC with a singular cardinal $\kappa$ such that every subset of $\kappa$ in $L(V_{\kappa+1})$ has both the $\kappa$-Perfect Set Property and the $\mathcal{\vec{U}}$-Baire Property. This is a higher analogue of…

Logic · Mathematics 2024-08-13 Vincenzo Dimonte , Alejandro Poveda , Sebastiano Thei

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

Logic · Mathematics 2024-11-20 James Holland

Assuming that $GCH$ holds and $\kappa$ is $\kappa^{+3}$-supercompact, we construct a generic extension $W$ of $V$ in which $\kappa$ remains strongly inaccessible and $(\alpha^+)^{HOD} < \alpha^+$ for every infinite cardinal $\alpha <…

Logic · Mathematics 2016-01-15 James Cummings , Sy David Friedman , Mohammad Golshani

We show that if the weak compactness of a cardinal is made indestructible by means of any preparatory forcing of a certain general type, including any forcing naively resembling the Laver preparation, then the cardinal was originally…

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

We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…

Combinatorics · Mathematics 2021-04-05 Elisa Palezzato , Michele Torielli