All Questions

Below, all structures are infinite and in a finite language. Given a structure $\mathcal{A}$ with domain $\omega$, we conflate $\mathcal{A}$ with some reasonable encoding of its atomic diagram for ...

We work in $\mathsf{ZFC+V=L}$. Define a plausible theory to be a theory $T\subseteq\mathcal{L}_{\omega_1,\omega}$ in an $\omega_1$-finite language which is $\omega_1$-c.e. and $\omega_1$-finitely ...

I've been reading Sacks' Countable admissible ordinals and hyperdegrees as I'm interested in Theorem 5.3 of the paper: Let $M$ be a countable standard model of $\mathsf{ZF}$ and $V=L$. Suppose $\...

Let $\mathbb{P}$ denote recursively pointed Sacks forcing. This is forcing with recursively pointed perfect trees ordered by inclusion. A tree $T \subseteq {}^{<\omega}2$ is recursively pointed if ...

Short version: does anyone know of any good sources on class-forcing over E-closed, non-admissible sets? Longer version: A problem I'm working on has reached an interesting conclusion - I've managed ...