`...an impressively wide - and relatively theory neutral - introduction to the field, whilst maintaining interest and clarity throughout. It is particularly strong in its use of cross-linguistic data from a wide variety of languages, which should appeal to those studying linguistics. Undergraduates will find it accessible and engaging, but there is also sufficient content to challenge more advanced students.' Bethan Davies, University of Leeds
Charles W. Kreidler ... Linguistics is concerned with identifying the meaningful elements of specific languages, for example, English words like paint and happy and affixes like the -er of painter and the un- of unhappy.
Presenting the basic principles of the discipline of semantics, this newly revised edition explores the knowledge of language that speakers have which enables them to communicate - to express observations, opinions, intentions and the ...
Presents, in simple and clear terms, the way in which humans express their ideas by talking.
This successor to Language, Meaning and Context provides an invaluable introduction to linguistic semantics.
Updates include: • New sections on causation, tests for situation types, lexical pragmatics, categorization, construction grammar, lexical typology, and polysemy • The addition of new chapter exercises with solutions, designed to ...
Requiring no special background knowledge, the book starts with everyday observations about word meaning and use and then hightlights the role of structure in the analysis of the meanings of phrases and clauses, zooming in on the ...
This book provides an introduction to the study of meaning in human language, from a linguistic perspective.
Basics - Notation - Lattices - A simple language - Direct semantics - Control - Data structures and data types - A prolog semantics - Miscellaneous.
An introduction to the linguistic study of meaning, this book outlines the meaning potential (semantics) of English and how language knowledge is put to use (pragmatics).
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.