相关论文: Models of set theory in which separation theorem f…

We make use of a finite support product of the Jensen minimal $\varPi^1_2$ singleton forcing to define a model in which $\varPi^1_2$ Uniformization fails for a set with countable cross-sections. We also define appropriate submodels of the…

We show that one can force over $L$ that $\Sigma^1_3$-separation holds, while $\Pi^1_3$-reduction fails, thus separating these two principles for the first time. The construction can be lifted to canonical inner models $M_n$ with $n$-many…

In this paper, we prove the following: If $n\ge3$, there is a generic extension of $L$ -- the constructible universe -- in which it is true that the Separation principle holds for both effective (lightface) classes $\varSigma^1_n$ and…

We present a method which forces the failure of $\Pi^1_3$ and $\Sigma^1_3$-separation, while $\mathsf{MA} (\mathcal{I}$) holds, for $\mathcal{I}$ the family of indestructible ccc forcings. This shows that, in contrast to the assumption…

We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $\Pi^1_2$ set of reals containing no ordinal-definable real.

Let $\mathsf{M}$ be the set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that every set is contained in a transitive set. Let…

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…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

It is well known that the graph of a total $\mathbf{\Sigma}^1_n$-function is $\mathbf{\Pi}^1_n$. We prove the consistency of the dual assertion at the third projective level: there is a model of $\ZFC$ in which the graph of every total…

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

Using a modification of the invariant Jensen forcing, we define a model of ZFC, in which, for a given $n\ge3$, there exists a lightface $\varPi^1_n$ set of reals, which is a ${\mathsf E}_0$ equivalence class, hence a countable set, and…

Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…

In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…

We develop the homotopy theory of semisimplicial sets constructively and without reference to point-set topology to obtain a constructive model for $\omega$-groupoids. Most of the development is folklore, but for a few results the author is…

We present a model of set theory, in which, for a given $n\ge2$, there exists a non-ROD-uniformizable planar lightface $\varPi^1_n$ set in $\mathbb R\times\mathbb R$, whose all vertical cross-sections are countable sets (and in fact Vitali…

Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…

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,…

The title theorem is proved by example: an algebra of binary relations, closed under intersection and composition, that is not isomorphic to any such algebra on a finite set.

This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…