Online research in philosophy

'Mass terms', words like water, rice and traffic, have proved very difficult to accommodate in any theory of meaning since, unlike count nouns such as house or dog, they cannot be viewed as part of a logical set and differ in their grammatical properties. In this study, motivated by the need to design a computer program for understanding natural language utterances incorporating mass terms, Harry Bunt provides a thorough analysis of the problem and offers an original and detailed solution. An extension of classical set theory, Ensemble Theory, is defined, and this provides the conceptual basis of a framework for the analysis of natural language meaning which Dr Bunt calls Two-level model-theoretic semantics. The validity of the framework is convincingly demonstrated by the formal analysis of a fragment of English including sentences with quantified and modified mass terms. Separate chapters of the book are devoted to an axiomatic definition of Ensemble Theory and a detailed discussion of its status as a mathematical formalism.

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of structures in contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented.

We look at two fundamental logical processes, often intertwined in planning and problem solving: inference and update. Inference is an internal process with which we uncover what is implicit in the information we already have. Update, on the other hand, is produced by external communication, usually in the form of announcements and in general in the form of observations, giving us information that might not have been available (even implicitly) before. Both processes have received attention from the logic community, usually separately. In this work, we develop a logical language that allows us to describe them together. We present syntax, semantics and a complete axiom system; we discuss similarities and differences with other approaches and mention how the work can be extended.

The relationships between logic and natural language are multiverse. On the one hand, logic is a theory of argumentation, proving and giving reasons, and such activities are primarily carried out in natural language. This means that logic is, in a certain loose sense, about natural language. On the other hand, logic has found it useful to develop its own linguistic means which sometimes in a sense compete with those of natural language. This has led to the situation where the systems of logic can be taken as interesting "models" of various aspects of natural language. Â Â Â Â Â Â Â The alliance of logic and linguistics has flowered especially from the beginning of the seventies, when scholars like Montague, Lewis, Cresswell, Partee and others showed how semantics of natural language can be explicated with the help certain suitable logical calculi and the corresponding model theory. (Montague went so far as to claim that in view of this, there is no principal difference between natural and formal languages - but this is, as far as I can see, rather misguiding.) Since that time, the interdisciplinary movement of formal semantics (associating not only linguists and logicians, but also philosophers, computer scientists, cognitive psychologists and others) has yielded a rich repertoire of formal theories of natural language, some of them (like Hintikka's game-theoretical semantics or the dynamic logic of Groenendijk and Stokhof) being based directly on logic, others (like the situation semantics of Barwise and Perry or DRT of Kamp) exploiting different formal strategies. Â Â Â Â Â Â Â Moreover, although the enterprise of formal semantics (i.e. of modeling natural language semantics by means of certain formal structures) seems to be the principal point of contact between linguistics and logic, there are also other cooperative enterprises. One of the most fruitful ones seems to be the logical analysis of syntax, which has resulted from elaboration of what was originally called categorial grammar. (However, even this enterprise can be seen as importantly stimulated by Montague.) Â Â Â Â Â Â Â All in all, the region in which logic and theoretical linguistics overlap has grown both in size and fertility..

Evidence is presented to show that the role of a generative grammar of a natural language is not merely to generate the grammatical sentences of that language, but also to relate them to their logical forms. The notion of logical form is to be made sense of in terms a natural logic, a logical for natural language, whose goals are to express all concepts capable of being expressed in natural language, to characterize all the valid inferences that can be made in natural language, and to mesh with adequate linguistic descriptions of all natural languages. The latter requirement imposes empirical linguistic constraints on natural logic. A number of examples are discussed.

Controlled languages are regimented fragments of natural languagedesigned to make the processing of natural language more efficient andreliable. This paper defines a controlled language, E2V, whose principalgrammatical resources include determiners, relative clauses, reflexivesand pronouns. We provide a formal syntax and semantics for E2V, in whichanaphoric ambiguities are resolved in a linguistically natural way. Weshow that the expressive power of E2V is equal to that of thetwo-variable fragment of first-order logic. It follows that the problemof determining the satisfiability of a set of E2V sentences is NEXPTIMEcomplete. We show that E2V can be extended in various ways withoutcompromising these complexity results; however, relaxing our policy onanaphora resolution renders the satisfiability problem for E2Vundecidable. Finally, we argue that our results have a bearing on thebroader philosophical issue of the relationship between natural andformal languages.

The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and special attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included. The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook.

One way of describing the enterprise of natural language semantics is by analogy with interpreted formal languages, e.g. the language of arithmetic interpreted on the natural numbers. English is then the formal language consisting of the well-formed sentences of English interpreted on the structure we happen to nd around us. The business of the natural language semanticist is to describe the correlation of the formal expressions with that structure. This paper is directed against this particular interpretation 1 of the enterprise of logical natural language semantics.

The model-theoretic analysis of the concept of logical consequence has come under heavy criticism in the last couple of decades. The present work looks at an alternative approach to logical consequence where the notion of inference takes center stage. Formally, the model-theoretic framework is exchanged for a proof-theoretic framework. It is argued that contrary to the traditional view, proof-theoretic semantics is not revisionary, and should rather be seen as a formal semantics that can supplement model-theory. Specifically, there are formal resources to provide a proof-theoretic semantics for both intuitionistic and classical logic. We develop a new perspective on proof-theoretic harmony for logical constants which incorporates elements from the substructural era of proof-theory. We show that there is a semantic lacuna in the traditional accounts of harmony. A new theory of how inference rules determine the semantic content of logical constants is developed. The theory weds proof-theoretic and model-theoretic semantics by showing how proof-theoretic rules can induce truth-conditional clauses in Boolean and many-valued settings. It is argued that such a new approach to how rules determine meaning will ultimately assist our understanding of the apriori nature of logic.

By a fragment of a natural language we mean a subset of thatlanguage equipped with semantics which translate its sentences intosome formal system such as first-order logic. The familiar conceptsof satisfiability and entailment can be defined for anysuch fragment in a natural way. The question therefore arises, for anygiven fragment of a natural language, as to the computational complexityof determining satisfiability and entailment within that fragment. Wepresent a series of fragments of English for which the satisfiabilityproblem is polynomial, NP-complete, EXPTIME-complete,NEXPTIME-complete and undecidable. Thus, this paper represents a casestudy in how to approach the problem of determining the logicalcomplexity of various natural language constructions. In addition, wedraw some general conclusions about the relationship between naturallanguage and formal logic.