Forcing in stable models of untyped λ-calculus
Rainer Kerth · Indagationes Mathematicae · 1999
In this paper we develop the forcing technique, introduced for graph models by Baeten and Boerboom [1], in the setting of stable models. To illustrate the technique, we choose an arbitrary closed term T and construct a stable model D# satisfying Ω = T.