English
Related papers

Related papers: Less nonstationary ideals

200 papers

A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…

Logic · Mathematics 2019-03-01 Cédric Milliet

There exist NIP and non-NTP$_2$ theories satisfying all the following conditions: It is not o-minimal; All models are strongly locally o-minimal; It has a model which is an expansion of the linearly ordered abelian group over the reals…

Logic · Mathematics 2022-08-18 Masato Fujita

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

Computational Complexity · Computer Science 2008-02-03 Donald E. Knuth

In this article we develop a concentration compactness type principle in a variable exponent setup. As an application of this principle we discuss a problem involving fractional `{\it $(p(x),p^+)$-Laplacian}' and power nonlinearities with…

Analysis of PDEs · Mathematics 2021-03-24 Akasmika Panda , Debajyoti Choudhuri

Towards combining "compactness" and "hugeness" properties at $\omega_2$, we investigate the relevance of side-conditions forcing. We reduce the upper bound on the consistency strength of the weak Chang's Conjecture at $\omega_2$ using…

Logic · Mathematics 2022-10-24 Monroe Eskew

Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…

Logic · Mathematics 2021-04-20 Assaf Rinot

Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…

Optimization and Control · Mathematics 2025-04-11 Jacob Westerhout , Xin Guo , Hien Duy Nguyen

A Boolean predicate $A$ is defined to be promise-useful if $\operatorname{PCSP}(A,B)$ is tractable for some non-trivial $B$ and otherwise it is promise-useless. We initiate investigations of this notion and derive sufficient conditions for…

Computational Complexity · Computer Science 2025-11-27 Per Austrin , Johan Håstad , Björn Martinsson

In this short note, using results of Bourgain, Fremlin, and Talagrand \cite{BFT}, we show that for a countable structure $M$, a saturated elementary extension $M^*$ of $M$ and a formula $\phi(x,y)$ the following are equivalent: (i)…

Logic · Mathematics 2017-04-04 Karim Khanaki

We study definable J-sets for definable groups and compare them with weakly generic sets. We show that the property that J-sets coincide with weakly generic sets is invariant on enough saturated models, and hence a model-theoretical…

Logic · Mathematics 2025-04-29 Zhentao Zhang

In \cite{E_2018}, Ern\'e relaxed the concept of sobriety in order to extend the theory of sober spaces and locally hypercompact spaces to situations where directed joins were missing, and introduced three kinds of non-sober spaces: cut…

General Topology · Mathematics 2019-07-16 Xinpeng Wen , Xiaoquan Xu

We present Nonstandard Analysis by three axioms: the {\em Extension, Transfer and Saturation Principles} in the framework of the superstructure of a given infinite set. We also present several applications of this axiomatic approach to…

General Topology · Mathematics 2011-07-19 Sergio Salbany , Todor Todorov

Under $\text{CH}$ we construct a partition of Baire space into compact sets, which is indestructible by countably supported iteration and product of Sacks forcing of any length, answering a question of Newelski. Further, we present an…

Logic · Mathematics 2025-05-08 Vera Fischer , Lukas Schembecker

Let $(X,\rho,G)$ be a $G-$action topological system, where $G$ is a countable infinite discrete amenable group and $X$ a compact metric space. We prove a variational principle for topological entropy of saturated sets for systems which have…

Dynamical Systems · Mathematics 2023-03-27 Xiankun Ren , Xueting Tian , Yunhua zhou

The density, denoted by $\kappa(n,r)$, of permutations having no cycles of length less than $r+1$ in a symmetric group $\mathrm{S}_n$ is explored. New asymptotic formulas for $\kappa(n,r)$ are obtained using the saddle-point method when…

Combinatorics · Mathematics 2016-05-10 Robertas Petuchovas

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…

Logic · Mathematics 2013-08-29 Itay Kaplan , Saharon Shelah

A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…

Logic · Mathematics 2021-06-07 Athar Abdul-Quader , Roman Kossak

section 2: We answer a question of Mekler Eklof on the closure operations of the incompactness spectrum. We answer a question of Foreman and Magidor on reflection of stationary subsets of S_{< aleph_2}(lambda) = {a subseteq lambda : |a| <…

Logic · Mathematics 2008-02-03 Saharon Shelah

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner

We prove that for any holomorphic map, and any bounded orbit which does not accumulate to a singular set or to an attracting cycle, its lower Lyapunov exponent is non-negative. The same result holds for unbounded orbits, for maps with a…

Dynamical Systems · Mathematics 2020-08-25 Israel Or Weinstein
‹ Prev 1 8 9 10 Next ›