Construction

We work in a standard higher-order language without non-standard syncategorematic operations nor restrictions on -abstraction, . For any nice term sequence , define the mapping recursively as follows.

  1. for each constant other than ;

  2. if is defined, otherwise

  3. for each variable ;

  4. whenever and ;

  5. ;

  6. whenever .

In the last two clauses the bound variable is relabeled to avoid capture. Note that does not “move” unguarded quantifier occurrences, i.e. ones not syntactically restricted by a predicate containing an existence predicate: when is a variable. Only guarded quantifiers have their domain specified in this model.

It is well known that carries an Applicative structure , where . Thus a domain over is essentially a nice term sequence. More exactly, for each nice term sequence there is a domain that assigns to whenever is defined and is undefined otherwise. In view of this correspondence, I notate and speak of domains over as if they were nice term sequences. Of course, nice term sequences that are mutual permutations of one another correspond to the same domain.

We define a typed family of equivalence relations on by setting Intuitively, then, means that and are provably applicatively indiscernible in (the classical system over , which translates into Bacon’s H), and remain so under arbitrary translations. It is straightforward to verify that is an applicative congruence of our term applicative structure . We then let be the quotient of through .

To obtain a substitution structure, we can lift the mappings to equivalence classes of terms. Write for the equivalence class of under . A domain over is then the result of lifting a domain over to equivalence classes under . This justifies notating domains in as , once more slightly abusing notation.

To each such domain we assign a substitution by setting It is not difficult to verify that and are identical whenever . The identity substitution is , for any , as fixes every term; closure under composition holds because . The identity domains are the with for every on which is defined.

It is then straightforward to check that is a QSS, where with function composition, and is function application.

Limitations

This construction cannot be continued to build a model for a language with domain specifiers, since it is not rich enough to interpret syncategorematic quantification.