English
Related papers

Related papers: Forcing consequences of PFA together with the cont…

200 papers

Motivated by the theory of self-duality which provides a variational formulation and resolution for non self-adjoint partial differential equations \cite{G1, G2}, we propose new templates for solving large non-symmetric linear systems. The…

Numerical Analysis · Mathematics 2008-01-28 Nassif Ghoussoub , Amir Moradifam

We consider the modality "$\varphi$ is true in every $\sigma$-centered forcing extension", denoted $\square\varphi$, and its dual "$\varphi$ is true in some $\sigma$-centered forcing extension", denoted $\lozenge\varphi$ (where $\varphi$ is…

Logic · Mathematics 2019-12-12 Ur Ya'ar

In this paper the concept of compatible weak factorization systems in general categories is introduced as a counterpart of compatible complete cotorsion pairs in abelian categories. We describe a method to construct model structures on…

Category Theory · Mathematics 2024-10-02 Zhenxing Di , Liping Li , Li Liang

In this paper we consider generalization of procedure of construction of potential systems for systems of partial differential equations with multidimensional spaces of conservation laws. More precisely, for construction of potential…

Mathematical Physics · Physics 2008-12-17 N. M. Ivanova

If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.

Logic in Computer Science · Computer Science 2023-05-18 Gilles Dowek , Benjamin Werner

Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…

Logic · Mathematics 2016-09-06 Garvin Melles

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

Logic · Mathematics 2019-03-27 David Fernández-Bretón , Elizabeth Lauri

The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the…

Logic · Mathematics 2009-09-25 Chaz Schlindwein

Cicho\'n's diagram describes the connections between combinatorial notions related to measure, category, and compactness of sets of irrational numbers. In the second part of the 2010's, Goldstern, Kellner and Shelah constructed a forcing…

Logic · Mathematics 2026-04-01 Diego A. Mejía

We introduce an iteration of forcing notions satisfying the countable chain condition with minimal damage to a strong coloring. Applying this method, we prove that Martin's axiom is strictly stronger than its restriction to forcing notions…

Logic · Mathematics 2024-06-21 Yinhe Peng

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Logic · Mathematics 2025-07-03 Saharon Shelah

With every $\sigma$-ideal $I$ on a Polish space we associate the $\sigma$-ideal $I^*$ generated by the closed sets in $I$. We study the forcing notions of Borel sets modulo the respective $\sigma$-ideals $I$ and $I^*$ and find connections…

Logic · Mathematics 2010-01-19 Marcin Sabok , Jindrich Zapletal

We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…

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

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

We present a detailed general framework to describe the forcing $\tilde{\mathbb{E}}$, defined by Kellner, Shelah and Tan\u{a}sie to prove the consistency with ZFC of an alternative order of Cicho\'n's maximum. Our presentation is close to…

Logic · Mathematics 2024-02-08 Diego A. Mejía

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Logic in Computer Science · Computer Science 2025-09-03 Go Hashimoto , Daniel Găină

Given an inner model $W \subset V$ and a regular cardinal $\kappa$, we consider two alternatives for adding a subset to $\kappa$ by forcing: the Cohen poset $Add(\kappa,1)$, and the Cohen poset of the inner model $Add(\kappa,1)^W$. The…

Logic · Mathematics 2019-08-27 Jonas Reitz

We analyze the time evolution of a one-dimensional quantum system with an attractive delta function potential whose strength is subjected to a time periodic (zero mean) parametric variation. We show that for generic forcing which includes…

Mathematical Physics · Physics 2007-05-23 O. Costin , R. D. Costin , A. Rokhlenko J. Lebowitz

We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.

Logic · Mathematics 2025-05-29 Miha E. Habič , Charles Weng , Cathy Zhang

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik
‹ Prev 1 8 9 10 Next ›