English
Related papers

Related papers: Outward compactness

200 papers

Lindstr\"om's Theorem characterizes first order logic as the maximal logic satisfying the Compactness Theorem and the Downward L\"owenheim-Skolem Theorem. If we do not assume that logics are closed under negation, there is an obvious…

Logic · Mathematics 2023-04-17 Saharon Shelah , Jouko Väänänen

While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…

Dynamical Systems · Mathematics 2010-04-05 Ethan Akin , Joseph Auslander

We prove some refinements of concentration compactness principle for Sobolev space $W^{1,n}$ on a smooth compact Riemannian manifold of dimension $n$. As an application, we extend Aubin's theorem for functions on $\mathbb{S}^{n}$ with zero…

Classical Analysis and ODEs · Mathematics 2020-09-08 Fengbo Hang

We study the possible number of normal measures on a measurable cardinal in settings where inner model techniques are unavailable. Instead, we exploit consequences of the Ultrapower Axiom to obtain our theorems. We show that the classical…

Logic · Mathematics 2026-03-13 Arthur W. Apter , Eyal Kaplan , Alejandro Poveda

We show that some of the most prominent large cardinal notions can be characterized through the validity of certain combinatorial principles at $\omega_2$ in forcing extensions by the pure side condition forcing introduced by Neeman. The…

Logic · Mathematics 2018-11-01 Peter Holy , Philipp Lücke , Ana Njegomir

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

Logic · Mathematics 2026-03-27 Yair Hayut , Alejandro Poveda

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

Logic · Mathematics 2024-04-29 Tom Benhamou , Jing Zhang

The landmark Levy-Solovay Theorem limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that…

Logic · Mathematics 2007-05-23 Joel David Hamkins

Despite being an established notion in the large cardinal hierarchy, results about Woodin cardinals are sparse in the literature. Here we gather known results about the preservation of Woodin cardinals under certain forcing extensions, as…

Logic · Mathematics 2017-11-09 Stamatis Dimopoulos

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

We prove two general results about the preservation of extendible and $C^{(n)}$-extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vop\v{e}nka's…

Logic · Mathematics 2021-07-16 Bagaria Joan , Poveda Alejandro

Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…

Logic in Computer Science · Computer Science 2022-08-29 Amin Farjudian , Eugenio Moggi

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 the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…

Logic · Mathematics 2016-09-20 Nam Trang , Trevor Wilson

We obtain exhaustive results and treat in a unified way the question of boundedness, compactness, and weak compactness of composition operators from the Bloch space into any space from a large family of conformally invariant spaces that…

Functional Analysis · Mathematics 2016-11-07 Manuel D. Contreras , Santiago Diaz-Madrigal , Dragan Vukotic

This paper is a continuation of our work on the functional-analytic core of the classical Furstenberg-Zimmer theory. We introduce and study (in the framework of lattice-ordered spaces) the notions of total order-boundedness and uniform…

Dynamical Systems · Mathematics 2026-02-10 Markus Haase , Henrik Kreidler

An $\omega_1$-compact space is a space in which every closed discrete subspace is countable. We give various general conditions under which a locally compact, $\omega_1$-compact space is $\sigma$-countably compact, i.e., the union of…

General Topology · Mathematics 2022-06-07 Peter Nyikos , Lyubomyr Zdomskyy

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

Logic in Computer Science · Computer Science 2014-01-24 Abhisekh Sankaran , Bharat Adsul , Supratik Chakraborty