English
Related papers

Related papers: Coding into K by reasonable forcing

200 papers

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic 0. In this paper we classify all regular decompositions of $\mathfrak{g}$ and its irreducible root system $\Delta$. A regular…

Rings and Algebras · Mathematics 2024-05-01 Stepan Maximov

The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Logic · Mathematics 2020-03-23 Matteo Viale

Let $n$ and $k$ be integers. A set $A\subset\mathbb{Z}/n\mathbb{Z}$ is $k$-free if for all $x$ in $A$, $kx\notin A$. We determine the maximal cardinality of such a set when $k$ and $n$ are coprime. We also study several particular cases and…

Number Theory · Mathematics 2014-10-06 Victor Lambert

The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…

Logic · Mathematics 2023-09-27 Victoria Gitman , Richard Matthews

We prove that $\delta$-derivations of a simple finite-dimensional Lie algebra over a field of characteristic zero, with values in a finite-dimensional module, are either inner derivations, or, in the case of adjoint module, multiplications…

Rings and Algebras · Mathematics 2022-11-15 Arezoo Zohrabi , Pasha Zusmanovich

Assuming $M_1$, the canonical inner model with one Woodin cardinal exists, we construct a model in which the nonstationary ideal on $\omega_1$ is $\aleph_2$-saturated, $\Delta_1$-definable with $\omega_1$ as the only parameter and there is…

Logic · Mathematics 2025-07-03 Stefan Hoffelner

Suppose that there is a measurable cardinal. If \aleph_\omega is a strong limit cardinal, but the power of \aleph_\omega is bigger than \aleph_{\omega_1}, then there is an inner model with a Woodin cardinal. Modulo the need of the…

Logic · Mathematics 2007-05-23 Ralf Schindler

We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…

Logic · Mathematics 2009-09-25 Jörg Brendle

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

Logic · Mathematics 2015-03-17 Juan Carlos Martinez , Lajos Soukup

Let G be a group and let k be a cardinal. A subset A of G is called left (right) k-large if there exists a subset F of G such that |F| < { and G = FA (G = AF). We say that A is k-large if A is left and right k-large. It is known that every…

Group Theory · Mathematics 2014-08-26 Igor Protasov , Sergii Slobodianiuk

We study the influence of strong forcing axioms on the complexity of the non-stationary ideal on $\omega_2$ and its restrictions to certain cofinalities. Our main result shows that the strengthening $MM^{++}$ of Martin's Maximum does not…

Logic · Mathematics 2022-06-06 Sean Cox , Philipp Lücke

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

Logic · Mathematics 2013-05-23 Tarek Sayed Ahmed

We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…

Logic in Computer Science · Computer Science 2018-11-28 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.

Logic · Mathematics 2018-01-16 Saharon Shelah

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

We study the following question: Given are two $k$-colorings $\alpha$ and $\beta$ of a graph $G$ on $n$ vertices, and integer $\ell$. The question is whether $\alpha$ can be modified into $\beta$, by recoloring vertices one at a time, while…

Computational Complexity · Computer Science 2014-04-17 Paul Bonsma , Amer E. Mouawad

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Logic · Mathematics 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

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 study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Logic · Mathematics 2024-01-29 Wesley Calvert , Douglas Cenzer , David Gonzalez , Valentina Harizanov

We prove a criterion for $k-$formality of arrangements, using a complex constructed from vector spaces introduced in \cite{bt}. As an application, we give a simple description of $k-$formality of graphic arrangements: Let $G$ be a connected…

Combinatorics · Mathematics 2007-05-23 Stefan Ovidiu Tohaneanu