Set Theory and Nominalization, Part II

1992 Journal of Logic and Computation  
In this paper we shall meet the application of Scott domains to nominalisation and explain its problem of predication. We claim that it is not possible to nd a solution to such a problem within semantic domains without logic. Frege structures are more conclusive than a solution to domain equations and can be used as models for nominalisation. Hence we develop a type theory based on Frege structures and use it as a theory of nominalisation.
doi:10.1093/logcom/2.6.687 fatcat:kpisjoietffs7e5cl2kchc7vqi