In recent years, semantical partiality has emerged as an important explanatory concept in philosophical logic as well as in the study of natural language semantics. Despite the many applications, however, a number of mathematically intriguing questions associated with this concept have received only very limited attention. ;The present dissertation aims to present a systematic study of certain types of partiality in the area of basic model theory. Two types of issues are given special attention: Introducing partially defined models, there are (...) many ways to generalize the classical truth definition for sentences of a simple first order language relative to standard, complete models. Different interpretations of the formal framework motivate conflicting truth definitions between language and partial models: A partial model can be taken to represent a part of the world, or a partial information set. The truth of a sentence can be supported directly by a part of the world, but can also follow indirectly from an information set. These notions are related, and the relation motivates a comparison between various weaker and stronger alternative truth definitions. Results are obtained about the extent to which these truth definitions differ, and a number of characterization results are deduced. ;Among other conditions that are not expressible in the framework of standard, complete model theory, a condition of monotonicity or persistence of truth relative to partial models is argued to follow under both the given interpretations of the formal framework. The final chapter investigates the relation between such conditions and expressibility properties in general. These discussions culminate with a combined Lindstrom and persistence characterization theorem. (shrink)

Lautemann et al. (1995) gave a descriptive characterisation of the class of context-free languages, showing that a language is context-free iff it is definable as the set of words satisfying some sentence of a particular logic (fragment) over words. The present notes discuss how to specialise this result to the class of linear languages. Somewhat surprisingly, what would seem the most straightforward specialisation actually fails, due to the fact that linear grammars fail to admit a Greibach normal form. We identify (...) an alternative specialisation, based on an alternative characterisation of context-free languages, also noted by Lautemann et al. (1995). (shrink)