Definition (Forcing language). Fix M a countable transitive model of ZFC, ℙ∈M a forcing poset.

We call the language

Lforcing:=L∈∪{τ:ℙ-names}

the forcing language (over M).