163,909 research outputs found
Extending Type Theory with Forcing
International audienceThis paper presents an intuitionistic forcing translation for the Calculus of Constructions (CoC), a translation that corresponds to an internalization of the presheaf construction in CoC. Depending on the chosen set of forcing conditions, the resulting type system can be extended with extra logical principles. The translation is proven correct-in the sense that it preserves type checking-and has been implemented in Coq. As a case study, we show how the forcing translation on integers (which corresponds to the internalization of the topos of trees) allows us to define general inductive types in Coq, without the strict positivity condition. Using such general inductive types, we can construct a shallow embedding of the pure \lambda-calculus in Coq, without defining an axiom on the existence of an universal domain. We also build another forcing layer where we prove the negation of the continuum hypothesis
Forcing consequences of PFA together with the continuum large
We develop a new method for building forcing iterations with symmetric
systems of structures as side conditions. Using our method we prove that the
forcing axiom for the class of all the small finitely proper posets is
compatible with a large continuum.Comment: 35 page
Separating club-guessing principles in the presence of fat forcing axioms
We separate various weak forms of Club Guessing at in the presence of large, Martin's Axiom, and related forcing axioms. We also answer a question of Abraham and Cummings concerning the consistency of the failure of a certain polychromatic Ramsey statement together with the continuum large. All these models are generic extensions via finite support iterations with symmetric systems of structures as side conditions, possibly enhanced with -sequences of predicates, and in which the iterands are taken from a relatively small class of forcing notions. We also prove that the natural forcing for adding a large symmetric system of structures (the first member in all our iterations) adds -many reals but preserves CH
Absoluteness via Resurrection
The resurrection axioms are forcing axioms introduced recently by Hamkins and
Johnstone, developing on ideas of Chalons and Velickovi\'c. We introduce a
stronger form of resurrection axioms (the \emph{iterated} resurrection axioms
for a class of forcings and a given
ordinal ), and show that implies generic
absoluteness for the first-order theory of with respect to
forcings in preserving the axiom, where is a
cardinal which depends on ( if is any
among the classes of countably closed, proper, semiproper, stationary set
preserving forcings).
We also prove that the consistency strength of these axioms is below that of
a Mahlo cardinal for most forcing classes, and below that of a stationary limit
of supercompact cardinals for the class of stationary set preserving posets.
Moreover we outline that simultaneous generic absoluteness for
with respect to and for with respect to
with is in principle
possible, and we present several natural models of the Morse Kelley set theory
where this phenomenon occurs (even for all simultaneously). Finally,
we compare the iterated resurrection axioms (and the generic absoluteness
results we can draw from them) with a variety of other forcing axioms, and also
with the generic absoluteness results by Woodin and the second author.Comment: 34 page
A Generalization of Martin's Axiom
We define the chain condition. The corresponding forcing axiom
is a generalization of Martin's Axiom and implies certain uniform failures of
club--guessing on that don't seem to have been considered in the
literature before.Comment: 36 page
Strolling through Paradise
With each of the usual tree forcings I (e.g., I = Sacks forcing S, Laver
forcing L, Miller forcing M, Mathias forcing R, etc.) we associate a
sigma--ideal i^0 on the reals as follows: A \in i^0 iff for all T \in I there
is S \leq T (i.e. S is stronger than T or, equivalently, S is a subtree of T)
such that A \cap [S] = \emptyset, where [S] denotes the set of branches through
S. So, s^0 is the ideal of Marczewski null sets, r^0 is the ideal of Ramsey
null sets (nowhere Ramsey sets) etc.
We show (in ZFC) that whenever i^0, j^0 are two such ideals, then i^0 \sem
j^0 \neq \emptyset. E.g., for I=S and J=R this gives a Marczewski null set
which is not Ramsey, extending earlier partial results by Aniszczyk,
Frankiewicz, Plewik, Brown and Corazza and answering a question of the latter.
In case I=M and J=L this gives a Miller null set which is not Laver null; this
answers a question addressed by Spinas.
We also investigate the question which pairs of the ideals considered are
orthogonal and which are not.
Furthermore we include Mycielski's ideal P_2 in our discussion
Consecutive singular cardinals and the continuum function
We show that from a supercompact cardinal \kappa, there is a forcing
extension V[G] that has a symmetric inner model N in which ZF + not AC holds,
\kappa\ and \kappa^+ are both singular, and the continuum function at \kappa\
can be precisely controlled, in the sense that the final model contains a
sequence of distinct subsets of \kappa\ of length equal to any predetermined
ordinal. We also show that the above situation can be collapsed to obtain a
model of ZF + not AC_\omega\ in which either (1) aleph_1 and aleph_2 are both
singular and the continuum function at aleph_1 can be precisely controlled, or
(2) aleph_\omega\ and aleph_{\omega+1} are both singular and the continuum
function at aleph_\omega\ can be precisely controlled. Additionally, we discuss
a result in which we separate the lengths of sequences of distinct subsets of
consecutive singular cardinals \kappa\ and \kappa^+ in a model of ZF. Some open
questions concerning the continuum function in models of ZF with consecutive
singular cardinals are posed.Comment: to appear in the Notre Dame Journal of Formal Logic, issue 54:3, June
201
- …