English
Related papers

Related papers: Outward compactness

200 papers

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…

Logic · Mathematics 2012-02-28 Andrew D. Brooke-Taylor , Sy-David Friedman

While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…

Logic · Mathematics 2020-02-19 Gabriel Goldberg

We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…

Logic · Mathematics 2025-01-24 Joni Puljujärvi , Davide Emilio Quadrellaro

We introduce a covering notion depending on two cardinals, which we call $\mathcal O $-$ [ \mu, \lambda ]$-compactness, and which encompasses both pseudocompactness and many other generalizations of pseudocompactness. For Tychonoff spaces,…

General Topology · Mathematics 2012-11-27 Paolo Lipparini

Magnitude is a numerical invariant of finite metric spaces, recently introduced by T. Leinster, which is analogous in precise senses to the cardinality of finite sets or the Euler characteristic of topological spaces. It has been extended…

Metric Geometry · Mathematics 2013-08-27 Mark W. Meckes

We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…

Logic · Mathematics 2013-05-28 Brent Cody , Moti Gitik , Joel David Hamkins , Jason Schanker

Assuming an instance of the Brodsky-Rinot proxy principle holding at a regular uncountable cardinal $\kappa$, we construct $2^\kappa$-many pairwise non-embeddable minimal non-$\sigma$-scattered linear orders of size $\kappa$. In particular,…

Logic · Mathematics 2023-12-29 Roy Shalev

We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak{s}_\theta,\mathfrak{p}_\theta,\mathfrak{g}_\theta,\mathfrak{r}_\theta,\mathfrak{t}_\theta$ at uncountable regular…

Logic · Mathematics 2021-02-02 Omer Ben-Neria , Shimon Garti

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

We study closure properties of measurable ultrapowers with respect to Hamkin's notion of "freshness" and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one…

Logic · Mathematics 2023-06-22 Philipp Lücke , Sandra Müller

It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…

Logic · Mathematics 2023-12-21 Hanul Jeon , James Walsh

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…

Logic in Computer Science · Computer Science 2017-01-11 Martin Grohe , Nicole Schweikardt

A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…

Logic · Mathematics 2015-10-19 Chris Lambie-Hanson

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

This is the second combinatorial proof of the compactness theorem for singular from 1977. In fact it gives a somewhat stronger theorem.

Logic · Mathematics 2019-01-29 Saharon Shelah

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

Given an uncountable regular cardinal $\kappa$, a partial order is $\kappa$-stationarily layered if the collection of regular suborders of $\mathbb{P}$ of cardinality less than $\kappa$ is stationary in $\mathcal{P}_\kappa(\mathbb{P})$. We…

Logic · Mathematics 2016-11-11 Sean Cox , Philipp Lücke

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

In this paper we extend the well-known concentration -- compactness principle of P.L. Lions to the variable exponent case. We also give some applications to the existence problem for the $p(x)-$Laplacian with critical growth.

Analysis of PDEs · Mathematics 2009-06-12 J. Fernandez Bonder , A. Silva