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).