Three theories of nominalized predicates
This paper surveys some formal systems which can be used to model nominalization in natural language. (I.e., the process which turns predicates ('love', 'divine') into individual concepts for these ('to love', 'divinity').) The challenge is to do this while avoiding conflicts of cardinality between the sets of individuals and predicates - and at the same time, maintaining as strong Comprehension principles as possible. First, a Fregean logic with Quinean stratification is considered (due to Cocchiarella), then a three-valued Aczel-Feferman type-free logic, and finally - the author's favourite - a classical version of the latter in the Feferman-Gillmore format. It is shown that the latter has models by a domain construction similar to Scott's modelling of the type-free lambda calculus.
- scientific article; zbMATH DE number 3722625 (Why is no real title available?)
- scientific article; zbMATH DE number 3484054 (Why is no real title available?)
- scientific article; zbMATH DE number 3503199 (Why is no real title available?)
- Montague semantics, nominalization and Scott's domains
- Temporal discourse and semantical games
- The theory of homogeneous simple types as a second order logic
- Toward useful type-free theories. I
- Two -extensions of the theory of homogeneous simple types as a second-order logic
- Nominalization, predication and type containment
- scientific article; zbMATH DE number 569747 (Why is no real title available?)
- scientific article; zbMATH DE number 3993529 (Why is no real title available?)
- scientific article; zbMATH DE number 910447 (Why is no real title available?)
- Set Theory and Nominalization, Part I
This page was built for publication: Three theories of nominalized predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073011)