English
Related papers

Related papers: Consistency Strengths of Modified Maximality Princ…

200 papers

We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…

Logic · Mathematics 2019-02-20 Sean Cox , John Krueger

The forcing theorem is the most fundamental result about set forcing, stating that the forcing relation for any set forcing is definable and that the truth lemma holds, that is everything that holds in a generic extension is forced by a…

Logic · Mathematics 2017-10-31 Peter Holy , Regula Krapf , Philipp Lücke , Ana Njegomir , Philipp Schlicht

Variable impedance model predictive control (MPC) formulations often treat joint stiffness as an instantaneous decision variable. The resulting feasible set strictly contains the physically realizable set under first-order actuator…

Robotics · Computer Science 2026-05-12 Vishal Ramesh

A new electronic structure principle, viz. the minimum magnetizability principle (MMP) has been proposed and also has been verified through ab initio calculations, to extend the domain of applicability of the conceptual density functional…

Chemical Physics · Physics 2009-11-11 Akhilesh Tanwar , Debesh Ranjan Roy , Sourav Pal , Pratim Kumar Chattaraj

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

It is shown that if BMM (= Bounded Martin's Maximum) holds then each set is contained in an inner model with a strong cardinal. This answers a question that has been asked by various people. It follows that BMM has a much larger consistency…

Logic · Mathematics 2007-05-23 Ralf Schindler

Variational principles are important in the investigation of large classes of physical systems. They can be used both as analytical methods as well as starting points for the formulation of powerful computational techniques such as…

Soft Condensed Matter · Physics 2014-09-16 Francisco J. Solis , Vikram Jadhao , Monica Olvera de la Cruz

The bounded proper forcing axiom BPFA is the statement that for any family of aleph_1 many maximal antichains of a proper forcing notion, each of size aleph_1, there is a directed set meeting all these antichains. A regular cardinal kappa…

Logic · Mathematics 2016-09-06 Martin Goldstern , Saharon Shelah

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-01-08 Danupon Nanongkai , Michele Scquizzato

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

Logic · Mathematics 2015-06-15 Erin Carmody

Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…

Computational Complexity · Computer Science 2015-07-01 Manuel Bodirsky , Peter Jonsson , Timo von Oertzen

By forcing with $\mathbb{P}_{\rm max}$ over strong models of determinacy, we obtain models where different square principles at $\omega_2$ and $\omega_3$ fail. In particular, we obtain a model of $2^{\aleph_0}=2^{\aleph_1}=\aleph_2 +…

Using a variation of Woodin's $\mathbb{P}_{\mathrm{max}}$ forcing, we force over a model of the Axiom of Determinacy to produce a model of ZFC containing a very strongly increasing sequence of length $\omega_{2}$ consisting of functions…

Logic · Mathematics 2026-04-01 Paul B. Larson , Chris Lambie-Hanson

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

Logic · Mathematics 2015-03-03 Carolin Antos

A first-order formula is called primitive positive (pp) if it only admits the use of existential quantifiers and conjunction. Pp-formulas are a central concept in (fixed-template) constraint satisfaction since CSP($\Gamma$) can be viewed as…

Logic in Computer Science · Computer Science 2026-01-28 Jakub Bulín , Michael Kompatscher

We study reinforcement learning from human feedback under misspecification. Sometimes human feedback is systematically wrong on certain types of inputs, like a broken compass that points the wrong way in specific regions. We prove that when…

Artificial Intelligence · Computer Science 2025-09-16 Madhava Gaikwad

Constrained reinforcement learning is to maximize the expected reward subject to constraints on utilities/costs. However, the training environment may not be the same as the test one, due to, e.g., modeling error, adversarial attack,…

Machine Learning · Computer Science 2022-09-16 Yue Wang , Fei Miao , Shaofeng Zou

The principle of open class determinacy is preserved by pre-tame class forcing, and after such forcing, every new class well-order is isomorphic to a ground-model class well-order. Similarly, the principle of elementary transfinite…

Logic · Mathematics 2018-07-02 Joel David Hamkins , W. Hugh Woodin

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

Logic · Mathematics 2022-05-31 Sandra Müller , Philipp Schlicht

In chapter 9 of his book "The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal", Woodin shows how to force the Strong Chang Conjecture over models of determinacy using $\mathbb{P}_{\mathrm{max}}$. We show here how a…

Logic · Mathematics 2026-05-28 Corentin Lagadec