Abstract
By the term ‘nominalization’ I mean any process which transforms a predicate or predicate phrase into a noun or noun phrase, e.g. ‘feminine’ is transformed into ‘feminity’. I call these derivative nouns abstract singular terms. Our aim is to provide a model-theoretic interpretation for a formal language which admits the occurrence of such abstract singular terms.
Similar content being viewed by others
Bibliography
P. Aczel (1980) Frege structures and the notions of proposition, truth and set, in The Kleene Symposium (eds. Barwise, Keisler, Kunen) North-Holland, pp.31–49.
P. Aczel and S. Feferman (1980) Consistency of the unrestricted abstraction principle using an intensional equivalence operator, in H. B. Curry: Essays on Combinatory Logic, Lambda Calculus & Formalism, ed. J. P. Seldin & J. R. Hindley, Academic Press, London 1980, pp. 67–98.
R. T. Brady (1971) The consistency of the axioms of abstraction and extensionality in three-valued logic, Notre Dame Journal of Formal Logic 12, pp. 447–453.
M. W. Bunder (1980) The naturalness of illative combinatory logic as a basis for mathematics, in H. B. Curry: Essays on Combinatory Logic, Lambda Calculus & Formalism, ed. J. P. Seldin & J. R. Hindley, Academic Press, London 1980, pp. 55–64.
H. Barandregt (1977) The Type-Free Lambda Calculus, Handbook of Mathematical Logic 1977, North-Holland.
G. Chierehia (1982) Nominalization and Montague grammar, Linguistics and Philosophy 5, 3.
N. B. Cocchiarella (1974) Fregean semantics for a realist ontology, Notre Dame Journal of Formal Logic 15, pp. 552–568.
N. B. Cocchiarella (1978) On the logic of nominalised predicates, and its philosophical interpretations, Erkenntnis 13, pp. 339–369.
N. B. Cocchiarella (1979) The theory of homogeneous simple types as a second order logic, Notre Dame Journal of Formal Logic 20.
S. Feferman (1984) Toward useful type-free theories I., Journal of Symbolic Logic, Vol. 49, No. 1, pp. 75–111.
P. C. Gilmore (1974) The consistency of partial set theory without extensionality, Axiomatic Set Theory, Proc. Symposia Pure Maths. XIII, Part II, Amer. Math. Soc., pp. 147–153.
P. C. Gilmore (1980) Combining unrestricted abstraction with universal quantification, in H. B. Curry: Essays on Combinatory Logic, Lambda Calculus & Formalism ed. J. P. Seldin & J. R. Hindley, Academic Press, London 1980, pp. 99–123.
S. C. Kleene (1952) Introduction to Metamathematics, van Nostrand.
D. Scott (1972) Continuous lattices, in: Toposes, Algebraic Geometry and Logic, ed. P. W. Lawvere, LN Maths. Vol. 274, Springer-Verlag.
D. Scott (1975) Lambda calculus and recursion theory, in: Proceedings of Third Scandinavian Logic Symposium, ed. S. Kanger, North-Holland, Amsterdam.
R. Turner (1983) Montague semantics, nominalization & Scott's domains, Linguistics & Philosophy 6, pp. 259–288.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Turner, R. Three theories of nominalized predicates. Stud Logica 44, 165–186 (1985). https://doi.org/10.1007/BF00379765
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00379765