English
Related papers

Related papers: Coding into K by reasonable forcing

200 papers

We give a method to transform into programs, classical proofs using a well ordering of the reals. The technics uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.

Logic in Computer Science · Computer Science 2010-06-01 Jean-Louis Krivine

If cf(kappa) = kappa, kappa^+< cf(lambda) = \lambda, then there is a stationary subset S of {delta<lambda:cf(delta)=kappa} in I[lambda]. Moreover, we can find <C_delta :delta in S>, C_delta a club of lambda, otp(C_delta)=kappa, guessing…

Logic · Mathematics 2008-06-03 Saharon Shelah

Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result…

Information Theory · Computer Science 2019-06-05 Elad Domanovitz , Uri Erez

We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over $L$, every analytic hypergraph on a Polish space admits a $\mathbf{\Delta}^1_2$ maximal independent set. As a main…

Logic · Mathematics 2022-04-26 Jonathan Schilhan

We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…

Logic · Mathematics 2025-11-10 Stefan Hoffelner

We give a modification of Mitchell's technique for adding objects of size $\omega_2$ with conditions with finite working parts in which the collections of models used as side conditions are very highly structured, arguably making them more…

Logic · Mathematics 2014-11-25 Charles Morgan

Let $\Gamma$ be the fundamental group of a manifold modeled on three dimensional Sol geometry. We prove that $\Gamma$ has a finite index subgroup $G$ which has a rational growth series with respect to a natural generating set. We do this by…

Group Theory · Mathematics 2020-06-08 Andrew Putman

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Logic · Mathematics 2023-06-13 Tamás Csernák , Lajos Soukup

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

We make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

Logic · Mathematics 2021-10-27 Jouko Väänänen , Philip Welch

Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…

Logic · Mathematics 2023-01-06 Mohammad Golshani , Saharon Shelah

We show how to generate and validate logical proofs of unsatisfiability from delta-complete decision procedures that rely on error-prone numerical algorithms. Solving this problem is important for ensuring correctness of the decision…

Logic in Computer Science · Computer Science 2014-09-24 Sicun Gao , Soonho Kong , Edmund Clarke

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…

Logic · Mathematics 2016-09-06 Haim Judah , Andrzej Rosłanowski , Saharon Shelah

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

Logic · Mathematics 2024-12-30 Rahman Mohammadpour , Boban Velickovic

The implicit signature k consists of the multiplication and the ({\omega}-1)-power. We describe a procedure to transform each {\kappa}-term over a finite alphabet A into a certain canonical form and show that different canonical forms have…

Rings and Algebras · Mathematics 2014-03-19 José Carlos Costa

We construct a model in which the continuum has size $\kappa$ for a regular cardinal $\kappa$ and in which the $\Sigma^1_n$-uniformization property holds simultaneously for every $n \ge 2$. Additionally this model has a $\Delta^1_3$-…

Logic · Mathematics 2025-06-17 Stefan Hoffelner

Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not \alpha\beta-projective (for some alpha, beta subsets of D) and is not collapsible. It follows that A is switchable. We prove that, for…

Logic in Computer Science · Computer Science 2015-10-22 Barnaby Martin , Dmitriy Zhuk

In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…

Logic · Mathematics 2019-07-23 John Krueger

We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.

Logic · Mathematics 2007-05-23 Saharon Shelah