English
Related papers

Related papers: Increasing the second uniform indiscernible by str…

200 papers

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

Logic · Mathematics 2026-04-14 Mirna Džamonja

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

We add to the theory of preservation of topological properties under forcing. In particular, we answer a question of Gilton and Holshouser in a strong sense, showing that if player II has a winning strategy in the strong countable fan…

Logic · Mathematics 2026-01-13 Chris Lambie-Hanson , Pedro Marun

The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…

Logic · Mathematics 2010-03-15 Paul Larson , Saharon Shelah

We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…

Logic · Mathematics 2011-02-14 David Aspero , Sy-David Friedman , Miguel Angel Mota , Marcin Sabok

We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…

Logic · Mathematics 2015-06-23 Diego Alejandro Mejía

In this paper, we prove the existence of classical solutions for second order stationary mean-field game systems. These arise in ergodic (mean-field) optimal control, convex degenerate problems in calculus of variations, and in the study of…

Analysis of PDEs · Mathematics 2015-03-24 Edgard A. Pimentel , Vardan Voskanyan

We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…

Logic · Mathematics 2013-01-04 Andrzej Roslanowski , Saharon Shelah

In this manuscript, we propose a structural condition on non-separable Hamiltonians, which we term displacement monotonicity condition, to study second order mean field games master equations. A rate of dissipation of a bilinear form is…

Analysis of PDEs · Mathematics 2022-04-04 Wilfrid Gangbo , Alpár R. Mészáros , Chenchen Mou , Jianfeng Zhang

The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question in the case of second-order &#955;$\mu$-calculus, which can be…

Logic in Computer Science · Computer Science 2007-05-30 Joachim De Lataillade

We introduce a property of posets which strengthens (\omega_1+1)-strategic closedness. This property is defined using a variation of the Banach-Mazur game on posets, where the first player chooses a countable set of conditions instead of a…

Logic · Mathematics 2026-03-06 Yasuo Yoshinobu

We propose a new, game-theoretic, approach to the idealized forcing, in terms of fusion games. This generalizes the classical approach to the Sacks and the Miller forcing. For definable ($\mathbf{\Pi}^1_1$ on $\mathbf{\Sigma}^1_1)…

Logic · Mathematics 2009-10-14 Marcin Sabok

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…

Logic · Mathematics 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

Subtraction games are a classical topic in Combinatorial Game Theory. A result of Golomb~(1966) shows that every subtraction game with a finite move set has an eventually periodic nim-sequence, but the known proof yields only an exponential…

Combinatorics · Mathematics 2026-03-18 Anjali Bhagat , Urban Larsson , Hikaru Manabe , Takahiro Yamashita

We present a direct construction of stationary set preserving forcings that make $\omega$-cofinal all the members of some arbitrary set $\mathcal{K}$ of regular cardinals $\kappa > \omega_1$. In addition, it is made possible to ensure that…

Logic · Mathematics 2025-10-29 Ben De Bondt , Boban Velickovic

This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…

Logic · Mathematics 2008-11-07 Bernhard Irrgang

Social dilemmas concern a natural conflict between cooperation and self interests among individuals in large populations. The emergence of cooperation and its maintenance is the key for the understanding of fundamental concepts about the…

Physics and Society · Physics 2016-10-26 Pablo A. Valverde , Roberto da Silva , Eduardo V. Stock

We characterize the pseudo-arc as well as P-adic pseudo-solenoids (for a set of primes P) as generic structures, arising from a natural game in which two players alternate in building an inverse sequence of surjections. The second player…

General Topology · Mathematics 2026-01-13 Adam Bartoš , Wiesław Kubiś

Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial…

Logic in Computer Science · Computer Science 2023-06-22 Frederik Meyer Bønneland , Peter Gjøl Jensen , Kim Guldstrand Larsen , Marco Muñiz , Jiří Srba
‹ Prev 1 2 3 10 Next ›