Category Neutrality: a Type-logical Investigation Dissertation

نویسنده

  • Walt Detmar Meurers
چکیده

ed, and the resulting term is given as an argument to the original α term. In this way, a quantified NP acts as a simple variable until an S is derived, at which point the meaning of the S is incorporated into the quantificational meaning of the NP. For example, a quantified NP such as every cat would have the category NP⇑S, and meaning λQ.every′(cat′)(Q). The phrase could act semantically as a referential NP, having simply a variable x for its semantics—until an S was derived, say, Every cat meows, with semantics meow′(x). At this point, the original meaning λQ.every′(cat′)(Q) would be applied to λx.meow′(x), resulting in the meaning every′(cat′)(meow′).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functorial Semantics for Higher-order Logic Dissertation Abstract

This dissertation investigates what may be termed the model theory of higher-order logic using the methods of category theory. Of course, there is no such eld of logic as \higher-order model theory," and so our rst concern in chapter I will be to specify the basic objects under investigation, viz. higher-order logical theories and their models. This is a fairly straightforward generalization|in...

متن کامل

Net Neutral Quality of Service Differentiation in Flow-Aware Networks

Flow-Aware Networking (FAN) architecture is evaluated in this dissertation with regard to its service differentiation and quality of service (QoS) assurance capabilities. The network neutrality debate is presented first, and it is shown that the potential resolutions will have a strong impact on QoS architectures. It is also shown that FAN, as well as all the proposed mechanisms, is perfectly s...

متن کامل

Dependently Typed Programming with Domain-Specific Logics

This dissertation describes progress on programming with domain-specific specification logics in dependently typed programming languages. Domain-specific logics are a promising way to verify software, using a logic tailored to a style of programming or an application domain. Examples of domain-specific logics include separation logic, which has been used to verify imperative programs, and autho...

متن کامل

Ambiguity, Neutrality, and Coordination in Higher-Order Grammar

We show that the standard account of neutrality and coordination in type-logical grammar is untenable. However, when using as our framework a version of Lambek’s categorical grammar with a type theory based on Lambek and Scott’s higher order intuitionistic logic (the internal language of a topos) rather than the Lambek calculus, the account can largely be salvaged. Because of the difficulty of ...

متن کامل

Testing Long-Run Neutrality

K ey classical macroeconomic hypotheses specify that permanent changes in nominal variables have no effect on real economic variables in the long run. The simplest “long-run neutrality” proposition specifies that a permanent change in the money stock has no long-run consequences for the level of real output. Other classical hypotheses specify that a permanent change in the rate of inflation has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002