English
Related papers

Related papers: Less nonstationary ideals

200 papers

Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…

Logic · Mathematics 2016-09-06 Sy D. Friedman

Cai and Hemachandra used iterative constant-setting to prove that Few $\subseteq$ $\oplus$P (and thus that FewP $\subseteq$ $\oplus$P). In this paper, we note that there is a tension between the nondeterministic ambiguity of the class one…

Computational Complexity · Computer Science 2024-02-12 Lane A. Hemaspaandra , Mandar Juvekar , Arian Nadjimzadah , Patrick A. Phillips

We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…

Functional Analysis · Mathematics 2023-05-18 Paolo Leonetti , Tommaso Russo , Jacopo Somaglia

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004]…

Logic · Mathematics 2023-05-04 Thomas Baumhauer , Martin Goldstern , Saharon Shelah

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Logic · Mathematics 2012-02-14 Artem Chernikov , Pierre Simon

We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…

Number Theory · Mathematics 2009-01-19 David J. Grynkiewicz , Vsevolod F. lev

We study the approachability ideal I[\kappa^+] in the context of large cardinals properties of the regular cardinals below a singular \kappa. As a guiding example consider the approachability ideal I[\aleph_{\omega+1}] assuming that…

Logic · Mathematics 2008-04-07 Assaf Sharon , Matteo Viale

We give sufficient conditions for a predicate P in a complete theory T to be stably embedded: P with its induced 0-definable structure has "finite rank", P has NIP in T and P is 1-stably embedded. This generalizes recent work by Hasson and…

Logic · Mathematics 2010-01-05 Anand Pillay

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

Logic · Mathematics 2020-02-28 Sebastien Vasey

We define a reasonably well-behaved class of ultraimaginaries, i.e.\ classes modulo invariant equivalence relations, called {\em tame}, and establish some basic simplicity-theoretic facts. We also show feeble elimination of supersimple…

Logic · Mathematics 2014-03-24 Frank Olaf Wagner

Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…

Logic · Mathematics 2007-05-23 Saharon Shelah , Masahiro Shioya

In this article we consider a convex feasible set described by inequality constraints that are continuous and not necessarily Lipschitz or convex. We show that if the Slater constraint qualification and a non-degeneracy condition are…

Optimization and Control · Mathematics 2019-02-11 S R Pattanaik

A paratopological group $G$ is saturated if the inverse $U^{-1}$ of each non-empty set $U\subset G$ has non-empty interior. It is shown that a [first-countable] paratopological group $H$ is a closed subgroup of a saturated (totally bounded)…

Group Theory · Mathematics 2010-03-30 Taras Banakh , Alex Ravsky

For every infinite cardinal $\kappa$ with $\kappa^+=2^\kappa$ we construct a group $G$ of cardinality $|G|=\kappa^+$ such that (i) $G$ is $36$-Shelah, which means that $A^{36}=G$ for any subset $A\subseteq G$ of cardinality $|A|=|G|$; (ii)…

Group Theory · Mathematics 2022-12-06 Taras Banakh

We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then…

Logic · Mathematics 2011-09-16 Artem Chernikov , Pierre Simon

Let $R$ be a commutative ring with a non-zero identity, $S$ be a multiplicatively closed subset of $R$ and $M$ be a unital $R$-module. In this paper, we define a submodule $N$ of $M$ with $(N:_{R}M)\cap S=\emptyset$ to be weakly $S$-primary…

Commutative Algebra · Mathematics 2022-03-29 Ece Yetkin Celikel , Hani A. Khashan

Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…

Logic · Mathematics 2024-11-26 Tom Benhamou , Dima Sinapova

In this paper we first define the $\bar{N}(p,q)$ summable sequence spaces and obtain some basic results related to these spaces. The necessary and sufficient conditions for infinite matrices $A$ to map these spaces on $X~~,~~X=c_0, c \text{…

Functional Analysis · Mathematics 2018-05-16 Ishfaq Ahmad Malik , Tanweer Jalal

Assume $X$ is a variety over $\mathbb{C}$, $A \subseteq \mathbb{C}$ is a finitely generated $\mathbb{Z}$-algebra and $X_A$ a model of $X$ (i.e. $X_A \times_A \mathbb{C} \cong X$). Assuming the weak ordinarity conjecture we show that there…

Algebraic Geometry · Mathematics 2019-05-23 Axel Stäbler

We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine…

Logic in Computer Science · Computer Science 2020-07-13 Philippe Schnoebelen
‹ Prev 1 3 4 5 6 7 10 Next ›