The paper presents a semantics for quantified modal logic which has a weaker axiomatization than the usual Kripke semantics. In particular, the Barcan Formula and its converse are not valid with the proposed semantics. Subclasses of models which validate BF and other interesting formulas are presented. A completeness theorem is proved, and the relation between this result and completeness with respect to Kripke models is investigated.

A modified version of Normann's hierarchy of domains with totality [9] is presented and is shown to be suitable for interpretation of Martin-Löf's intuitionistic type theory. This gives an interpretation within classical set theory, which is natural in the sense that $\Sigma$ -types are interpreted as sets of pairs and $\Pi$ -types as sets of choice functions. The hierarchy admits a natural definition of the total objects in the domains, and following an idea of Berger [3] this makes possible an (...) interpretation where a type is defined to be true if its interpretation contains a total object. In particular, the empty type contains no total objects and will therefore be false (in any non-empty context). In addition, there is a natural equivalence relation on the total objects, so we derive a hierarchy of topological spaces (quotient spaces wrt. the Scott topology), and give a second interpretation using this hierarchy. (shrink)