pith. sign in

arxiv: 1503.08092 · v1 · pith:BAKAEUVLnew · submitted 2015-03-27 · 🧮 math.LO

An introdution to forcing

classification 🧮 math.LO
keywords forcingwillavoidsetsabsolutenessactualassumeaxioms
0
0 comments X
read the original abstract

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic predicate logic, the axioms of ZF C set theory and constructible sets. We will also make use of tools like the coding of Borel sets and the Shoenfield absoluteness result.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.