scholarly journals An Account of Natural Language Coordination in Type Theory with Coercive Subtyping

Author(s):  
Stergios Chatzikyriakidis ◽  
Zhaohui Luo
Keyword(s):  
2007 ◽  
Vol 18 (2) ◽  
pp. 203-203
Author(s):  
C. Fox ◽  
M. Fernandez ◽  
S. Lappin

2015 ◽  
Vol 10 ◽  
Author(s):  
Robin Cooper ◽  
Simon Dobnik ◽  
Shalom Lappin ◽  
Staffan Larsson

Type theory has played an important role in specifying the formal connection between syntactic structure and semantic interpretation within the history of formal semantics. In recent years rich type theories developed for the semantics of programming languages have become influential in the semantics of natural language. The use of probabilistic reasoning to model human learning and cognition has become an increasingly important part of cognitive science. In this paper we offer a probabilistic formulation of a rich type theory, Type Theory with Records (TTR), and we illustrate how this framework can be used to approach the problem of semantic learning. Our probabilistic version of TTR is intended to provide an interface between the cognitive process of classifying situations according to the types that they instantiate, and the compositional semantics of natural language.


Author(s):  
David Corfield

Type theory regards individuals as belonging to a specific type. In computer science type-checking measures ensure that a program will compute properly. We see typing in everyday speech too, when a ‘Who?’ question expects a person. To define a type, it is necessary to specify when two elements are equal. Such concerns with sorts and identity are at stake in metaphysics. A dependent type occurs where one type is parametrized by elements of another. The two related constructions of dependent sum and dependent product appear in natural language and modern mathematics. In logic, these constructions amount to the quantifiers central to Russell’s logic. Dependent types are formulated in terms of contexts constructed in an order, showing how some concepts presuppose others. There are strong resonances with the ideas of Collingwood. With the notion of dependency, we can now analyse event types properly, demonstrating their difference from object types.


Author(s):  
David Corfield

This chapter explains how modal homotopy type theory combines ideas from two currents of thought: type theory and category theory. Despite what might appear to be rather different philosophical starting points, there has emerged an intrinsically structuralist language of great interest to computer scientists, mathematicians and physicists. This in itself should be enough to interest philosophers in the language, but further motivation is provided by addressing some of the kinds of objection raised to formalization in philosophy; in particular, those from ordinary language philosophy which emphasize the elasticity and context-dependence of natural language. We see that several of their concerns, such as that the definitional and descriptive uses of ‘is’ are conflated in logic, are addressed by the type theory. The prospect is then presented of an opportunity to use the new language to explore key issues in philosophy of mathematics, philosophy of language and metaphysics.


Author(s):  
Robin Cooper

AbstractWe present a view of perception as the classification of objects and events in terms of types in the sense of TTR, a Type Theory with Records. We argue that such types can be used to give a formal model of concepts and cognitive processing involving concepts. This yields a view that natural language semantics is based on our cognitive perceptual ability. The paper provides an overview of some key ideas in TTR including the important notion of record type. We suggest that record types can be used to model frames in a way that relates to the Düsseldorf notion of frame as well as those of Fillmore and Barsalou.


2000 ◽  
Vol 65 (1) ◽  
pp. 212-246 ◽  
Author(s):  
Francesco Orilia

§1. Introduction. Russell's type-theory can be seen as a theory of properties, relations, and propositions (PRPs) (in short, a property theory). It relies on rigid type distinctions at the grammatical level to circumvent the property theorist's major problem, namely Russell's paradox, or, more generally, the paradoxes of predication. Type theory has arguably been the standard property theory for years, often taken for granted, and used in many applications. In particular, Montague [27] has shown how to use a type-theoretical property-theory as a foundation for natural language semantics.In recent years, it has been persuasively argued that many linguistic and ontological data are best accounted for by using a type-free property theory. Several type-free property theories, typically with fine-grained identity conditions for PRPs, have therefore been proposed as potential candidates to play a foundational role in natural language semantics, or for related applications in formal ontology and the foundations of mathematics (Bealer [6], Cocchiarella [18], Turner [35], etc.).Attempts have then been made to combine some such property theory with a Montague-style approach in natural language semantics. Most notably, Chierchia and Turner [15] propose a Montague-style semantic analysis of a fragment of English, by basically relying on the type-free system of Turner [35]. For a similar purpose Chierchia [14] relies on one of the systems based on homogeneous stratification due to Cocchiarella. Cocchiarella's systems have also been used for applications in formal ontology, inspired by Montague's account of quantifier phrases as, roughly, properties of properties (see, e.g., Cocchiarella [17], [19], Landini [25], Orilia [29]).


Sign in / Sign up

Export Citation Format

Share Document