Introducing some of the foundational concepts, principles and techniques in the formal semantics of natural language, Elements of Formal Semantics outlines the mathematical principles that underlie linguistic meaning. Making use of a wide range of concrete English examples, the book presents the most useful tools and concepts of formal semantics in an accessible style and includes a variety of practical exercises so that readers can learn to utilise these tools effectively. For readers with an elementary background in set theory and linguistics or with an interest in mathematical modelling, this fascinating study is an ideal introduction to natural language semantics. Designed as a quick yet thorough introduction to one of the most vibrant areas of research in modern linguistics today this volume reveals the beauty and elegance of the mathematical study of meaning.

Formal semantics - the scientific study of meaning in natural language - is one of the most fundamental and long-established areas of linguistics. This Handbook offers a comprehensive, yet compact guide to the field, bringing together research from a wide range of world-leading experts. Chapters include coverage of the historical context and foundation of contemporary formal semantics, a survey of the variety of formal/logical approaches to linguistic meaning and an overview of the major areas of research within current semantic theory, broadly conceived. The Handbook also explores the interfaces between semantics and neighbouring disciplines, including research in cognition and computation. This work will be essential reading for students and researchers working in linguistics, philosophy, psychology and computer science.

This book is an introduction to the current developments in model-theoretic semantics, which has become an essential part of the work in theoretical linguistics over the last decade. The author examines the model structure of Montague's theory and then presents elaborations on this basic model that have been of particular importance in the last few years: generalized quantifiers, the introduction of more structure in the domain of individuals, properties as primitive elements in the model, situations and similar 'smaller' worldlike entities. Nothing is presupposed about knowledge of the mathematical and logical tools used in formal semantics, and Bach presents the informal with a minimum of formalism.

By highlighting relations between experimental and theoretical work, this volume explores new ways of addressing one of the central challenges in the study of language and cognition. The articles bring together work by leading scholars and younger researchers in psychology, linguistics and philosophy. An introductory chapter lays out the background on concept composition, a problem that is stimulating much new research in cognitive science. Researchers in this interdisciplinary domain aim to explain how meanings of complex expressions are derived from simple lexical concepts and to show how these meanings connect to concept representations. Traditionally, much of the work on concept composition has been carried out within separate disciplines, where cognitive psychologists have concentrated on concept representations, and linguists and philosophers have focused on the meaning and use of logical operators. This volume demonstrates an important change in this situation, where convergence points between these three disciplines in cognitive science are emerging and are leading to new findings and theoretical insights. This book is open access under a CC BY license.

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

No detailed description available for "Syntactic Structures".

Explores the Korean language from both a syntactic and semantic perspective, combining mainstream ideas from minimalist syntax and formal semantics.

Written by two of the leading figures in the field, this is a lucid and systematic introduction to formal semantics.

Introduces the major elements of semantics in a simple, step-by-step fashion. Sections of explanation and examples are followed by practice exercises with answers and comment provided.