English
Related papers

Related papers: Proper forcing remastered

200 papers

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

Our proof is based on a generalization of action-angle variables, a convergent Lie transformation, and Moser's invariant curve theorem. As an overall outline we give a quick proof of Morris' original theorem. Then the full theorem is…

Dynamical Systems · Mathematics 2016-08-18 K. R. Meyer , D. S. Schmidt

Let $\mathbb{Q}$ denote the poset which adds a Cohen real then shoots a club through the complement of $\big( [\omega_2]^\omega \big)^V$ with countable conditions. We prove that the version of Strong Chang's Conjecture from \cite{MR2965421}…

Logic · Mathematics 2018-02-19 Sean D. Cox

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

Logic · Mathematics 2011-10-18 Bernhard Irrgang

On a closed Riemannian manifold, we construct a family of intrinsic Gaussian noises indexed by a regularity parameter $\alpha\geq0$ to study the well-posedness of the parabolic Anderson model. We show that with rough initial conditions, the…

Probability · Mathematics 2025-12-17 Hongyi Chen , Cheng Ouyang

Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…

Logic · Mathematics 2020-04-27 Natasha Dobrinen

The technique of "classical realizability" is an extension of the method of "forcing"; it permits to extend the Curry-Howard correspondence between proofs and programs, to Zermelo-Fraenkel set theory and to build new models of ZF, called…

Logic in Computer Science · Computer Science 2018-03-20 Jean-Louis Krivine

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

Logic · Mathematics 2015-10-06 Robert Lubarsky

We study a class of focusing nonlinear Schroedinger-type equations derived recently by Dumas, Lannes and Szeftel within the mathematical description of high intensity laser beams [7]. These equations incorporate the possibility of a…

Analysis of PDEs · Mathematics 2019-01-21 Paolo Antonelli , Jack Arbunich , Christof Sparber

We lay down the foundations of a theory of parametrised functor calculus, generalising parts of the functor calculus of Goodwillie. We introduce the notion of excisable posets and develop a theory of excisive approximations in this context.…

Algebraic Topology · Mathematics 2024-10-30 Kaif Hilman , Sil Linskens

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Logic · Mathematics 2018-11-14 James Cummings , Mirna Džamonja , Itay Neeman

Circumcenters play an important role in the design and analysis of accelerating various iterative methods in optimization. In this work, we propose Bregman (pseudo-)circumcenters associated with finite sets. We show the existence and give…

Optimization and Control · Mathematics 2021-04-08 Hui Ouyang , Xianfu Wang

Using a theorem from pcf theory, we show that for any singular cardinal nu, the product of the Cohen forcing notions on kappa, kappa < nu adds a generic for the Cohen forcing notion on nu^+. This solves Problem 5.1 in Miller's list…

Logic · Mathematics 2008-02-03 Saharon Shelah

Using the basis of Hermite-Fourier functions (i.e. the quantum oscillator eigenstates) and the Sturm theorem, we derive the practical constraints for a function and its Fourier transform to be both positive. We propose a constructive method…

Mathematical Physics · Physics 2008-11-26 B. G. Giraud , R. Peschanski

We study variants of the mixed finite element method (mixed FEM) and the first-order system least-squares finite element (FOSLS) for the Poisson problem where we replace the load by a suitable regularization which permits to use $H^{-1}$…

Numerical Analysis · Mathematics 2023-02-03 Thomas Führer

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

Logic in Computer Science · Computer Science 2013-05-06 Christian Retoré

The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we…

Logic in Computer Science · Computer Science 2019-02-07 Mitsuhiro Okada , Yuta Takahashi

In this contribution we present how to obtain explicit state space models in port-Hamiltonian form when a mixed finite element method is applied to a linear mechanical system with non-uniform boundary conditions. The key is to express the…

Systems and Control · Electrical Eng. & Systems 2021-11-01 Tobias Thoma , Paul Kotyczka

In a recent paper, Saxena et al. [1] developed the solutions of three generalized fractional kinetic equations in terms of Mittag-Leffler functions. The object of the present paper is to further derive the solution of further generalized…

Mathematical Physics · Physics 2009-11-10 R. K. Saxena , A. M. Mathai , H. J. Haubold

We show if we use countable support iteration of forcing notions not adding reals that satisfy additional conditions, then the limit forcing does not add reals. As a result we prove that we can amalgamate two earlier methods and prove the…

Logic · Mathematics 2022-05-19 Mohammad Golshani , Saharon Shelah