English
Related papers

Related papers: Increasing the second uniform indiscernible by str…

200 papers

We extend the weak-strong uniqueness principle for mean-field game (MFG) systems to a broad class of second-order stationary and time-dependent problems. Under standard monotonicity, growth, and coercivity assumptions on the Hamiltonian,…

Analysis of PDEs · Mathematics 2026-04-02 Rita Ferreira , Diogo Gomes , Bashayer Majrashi

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

We regard Forcing Notions P adding real numbers and the algebras of P-measurable sets. As for Cohen- and Random-Forcing we can show that each analytic set is P-measurable using Solovay's Unfolding Trick for infinite games. To show this we…

Logic · Mathematics 2016-09-06 Benedikt Loewe

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

Optimization and Control · Mathematics 2026-02-17 Dean Kraizberg

We analyze a (possibly degenerate) second order mean field games system of partial differential equations. The distinguishing features of the model considered are (1) that it is not uniformly parabolic, including the first order case as a…

Optimization and Control · Mathematics 2014-07-28 Pierre Cardaliaguet , J. Graber , Alessio Porretta , Daniela Tonon

We investigate the Sprague-Grundy sequences for two normal-play impartial games based on arithmetic functions, first described by Iannucci and Larsson in \cite{sum}. In each game, the set of positions is N (natural numbers). In saliquant,…

Number Theory · Mathematics 2023-09-06 Paul Ellis , Jason Shi , Thotsaporn Aek Thanatipanonda , Andrew Tu

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

Logic · Mathematics 2024-08-28 Tonatiuh Matos-Wiederhold , Luciano Salvetti

If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…

Logic · Mathematics 2007-05-23 Michael C. Laskowski , Saharon Shelah

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

Logic · Mathematics 2013-09-03 Heike Mildenberger , Saharon Shelah

Additively separable hedonic games and fractional hedonic games have received considerable attention. They are coalition forming games of selfish agents based on their mutual preferences. Most of the work in the literature characterizes the…

Artificial Intelligence · Computer Science 2017-06-29 Michele Flammini , Gianpiero Monaco , Qiang Zhang

Winning sets of Schmidt's game enjoy a remarkable rigidity. Therefore, this game (and modifications of it) have been applied to many examples of complete metric spaces (X, d) to show that the set of "badly approximable points", with respect…

Dynamical Systems · Mathematics 2013-09-19 Steffen Weil

In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…

General Topology · Mathematics 2018-08-23 Liljana Babinkostova , Bruno A. Pansera , Marion Scheepers

We consider weighted sums of independent random variables regulated by an increment sequence. We provide operative conditions that ensure strong law of large numbers for such sums to hold in both the centered and non-centered case. The…

Probability · Mathematics 2021-03-11 Luca Avena , Conrado da Costa

The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…

Dynamical Systems · Mathematics 2024-04-25 Tuhin Sahai , Abeynaya Gnanasekaran

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

A central theme in set theory is to find universes with extreme, well-understood behaviour. The case we are interested in is assuming GCH and has a strong forcing axiom of higher order than usual. Instead of "for every suitable forcing…

Logic · Mathematics 2022-03-02 Noam Greenberg , Saharon Shelah

Hirschfeldt and Jockusch (2016) introduced a two-player game in which winning strategies for one or the other player precisely correspond to implications and non-implications between $\Pi^1_2$ principles over $\omega$-models of…

Logic · Mathematics 2021-12-02 Damir D. Dzhafarov , Denis R. Hirschfeldt , Sarah C. Reitzes

We note that some form of the condition "$p_1, p_2$ have a $\leq_{\mathbb{Q}}$-lub in $\mathbb{Q}$" is necessary in some forcing axiom for $\lambda$-complete $\mu^+$-c.c. forcing notions. We also show some versions are really stronger than…

Logic · Mathematics 2020-07-30 Saharon Shelah

We investigate forms of filter extension properties in the two-cardinal setting involving filters on $P_\kappa(\lambda)$. We generalize the filter games introduced by Holy and Schlicht in \cite{HolySchlicht:HierarchyRamseyLikeCardinals} to…

Logic · Mathematics 2026-02-20 Tom Benhamou , Victoria Gitman

We investigate the problem of when $\leq\lambda$--support iterations of $<\lambda$--complete notions of forcing preserve $\lambda^+$. We isolate a property -- {\em properness over diamonds} -- that implies $\lambda^+$ is preserved and show…

Logic · Mathematics 2007-05-23 Todd Eisworth