2 papers
math.LO2017
Class forcing, the forcing theorem and Boolean completions
Peter Holy, Regula Krapf, Philipp Lücke +2
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 eve…
math.LO2017
Small Embedding Characterizations for Large Cardinals
Peter Holy, Philipp Lücke, Ana Njegomir
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their cri…