We suggest modeling concepts as types in a strongly-typed ontology that reflects our commonsense view of the world and the way we talk about it in ordinary language. In such a framework, certain types of ambiguities in natural language are explained by the notion of polymorphism. In this paper we suggest such a typed compositional semantics for nominal compounds of the form (Adj Noun) where adj...

the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...

We prove that a type-definable Lascar strong type has finite diameter. We answer also some other questions from [1] on Lascar strong types. We give some applications on subgroups of type-definable groups. In this paper T is a complete theory in language L and we work within a monster model C of T . For a0, a1 ∈ C let a0Θa1 iff 〈a0, a1〉 extends to an indiscernible sequence 〈an, n < ω〉. We define...

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it. Assuming such a structure we show that the semantics of various natural language phenomena may become nearly trivial.

We give effectiveness conditions on a strongly minimal theory T guaranteeing that all models have computable copies. In particular, we show that if T is strongly minimal and for n ě 1, T X Dn`2 is ∆n, uniformly in n, then every model has a computable copy. Relativizing, we answer a long-standing question in computable model theory, showing that if a strongly minimal theory has a computable mode...

In this paper a class of simple theories, called the low theories is developed, and the following is proved. Theorem Let T be a low theory, A a set and a; b elements realizing the same strong type over A. Then, a and b realize the same Lascar strong type over A. The reader is expected to be familiar with forking in simple theories, as developed in Kim's thesis Kim]. The Lascar strong type of a ...

SUMMARY Java does not contain enumerated types. This paper demonstrates how to produce classes that behave like enumerated types with secure, strong typing. Additional Pascal-like operations are easily incorporated into the enumerated types without repeating code. Full listings of the classes are given.

Many frameworks have been proposed for deriving speciic runtime properties, but there is still a lack of knowledge about how they all t together. To ll this gap, we discuss various kinds of type information and the relations between them, and sketch a method for obtaining the required information. This method is used as part of an system for automatic translation of Prolog programs into strongl...

We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it in ordinary language. Assuming the existence of such a structure, we show that the semantics of various natural language phenomena may become nearly trivial.