Foundations of Intensional Semantics
Published on 8. May 2008
208 pages
978-0-470-77529-5 (ISBN)
Description
This book provides a systematic study of three foundational issuesin the semantics of natural language that have been relativelyneglected in the past few decades.
* focuses on the formal characterization of intensions, thenature of an adequate type system for natural language semantics,and the formal power of the semantic representation language
* proposes a theory that offers a promising framework fordeveloping a computational semantic system sufficiently expressiveto capture the properties of natural language meaning whileremaining computationally tractable
* written by two leading researchers and of interest to studentsand researchers in formal semantics, computational linguistics,logic, artificial intelligence, and the philosophy of language
Reviews / Votes
"The book is a must reading for any semanticist who has ever askedherself what intensions actually are." The LinguistList "Fox and Lappin present a new solution to one of thelong-standing issues in formal semantics: how to distinguishlogically equivalent from semantically equivalent propositions.This is a valuable contribution to the foundations of formalsemantics of natural language." Stephen G. Pulman, OxfordUniversity "This is an excellent addition to the literature on thefoundations of natural language semantics. The logical issues arecarefully and insightfully addressed and much advanced material isbrought together for the first time. Semanticists cannot afford notto read it." Raymond Turner, University of EssexMore details
Other editions
Additional editions
Chris Fox | Shalom Lappin
Foundations of Intensional Semantics
Software
02/2008
Wiley
€82.61
No shipping information available
Chris Fox | Shalom Lappin
Foundations of Intensional Semantics
Book
06/2005
1st Edition
Wiley
€56.00
Shipment within 15-20 days
Chris Fox | Shalom Lappin
Foundations of Intensional Semantics
Book
06/2005
Wiley
€145.96
Article exhausted; check different version
Persons
Chris Fox is a Reader in the Department of Computer Scienceat the University of Essex. In addition to numerous papers, hisprevious publications in the area of computational semanticsinclude The Ontology of Language: Properties, Individuals, andDiscourse (2000).
Shalom Lappin is Professor of Computer Science atKing's College, London. He has published extensively onissues in computational linguistics and formal grammar, and hisbooks include Local Constraints vs. Economy (with DavidJohnson, 1999), Fragments: Studies in Ellipsis andGapping (edited with Elabbas Benmamoun, 1999), and TheHandbook of Contemporary Semantic Theory (edited, Blackwell,1996).
Content
Preface.
1. Introduction.
1.1 Montague's Intensional Logic.
1.2 Architectural Features of IL.
1.3 Structure of the Book.
2. Alternative Approaches to Fine-Grained Intensionality.
2.1 An Algebraic Representation of Possible WorldsSemantics.
2.2 Two Strategies for Hyperintensionalism.
2.3 Thomason's Intentional Logic.
2.4 Bealer's Intensional Logic.
2.5 Structured Meanings and Interpreted Logical Forms.
2.6 Landman's Data Semantics.
2.7 Situation Semantics and Infon Algebras.
2.8 Situations as Partial Models.
2.9 Topos Semantics.
2.10 Conclusion.
3 Intensions as Primitives.
3.1 A Simple Intensional Theory.
3.2 Types and Sorts.
3.3 Abstraction and Application.
3.4 PT: An Untyped Theory.
3.5 Intensionality in FIL and PTCT.
3.6 Conclusions.
4. A Higher-Order, Fine-Grained Intensional Logic.
4.1 Introduction.
4.2 Fine-Grained Intensional Logic.
4.3 A Semantics for FIL.
4.4 Conclusion.
5. Property Theory with Curry Typing.
5.1 PTCT: A Curry-Typed Theory.
5.2 PTCT: Syntax of the basic theory.
5.3 A Proof Theory for PTCT.
5.4 Example Proof.
5.5 Intensional Identity v. Extensional Equivalence.
5.6 Extending the Type System.
5.7 A Model Theory for PTCT.
5.8 Types and Properties.
5.9 Separation Types and Internal Type Judgements.
5.10 Truth as a Type.
5.11 Conclusion.
6. Number Theory and Cardinaltiy.
6.1 Proportional Cardinality Quantifiers.
6.2 Peano Arithmetic.
6.3 Number Theory in FIL.
6.4 Proportional Generalized Quantifiers in FIL.
6.5 Number Theory in PTCT.
6.6 Proportional Generalized Quantifiers in PTCT.
6.7 Presburger Arithmetic.
6.8 Presburger Arithmetic in PTCT.
6.9 Conclusions.
7. Anaphora and Ellipsis.
7.1 A Type-Theoretical Approach to Anaphora.
7.2 Ellipsis in PTCT.
7.3 Comparison with Other Type-Theoretical Approaches.
7.4 Conclusion.
8. Underspecified Interpretations.
8.1 Underspecified Representations.
8.2 Comparison with Other Theories.
8.3 Conclusion.
9. Expressive Power and Formal Strength.
9.1 Decidability and Completeness.
9.2 Arguments For Higher-Order Theories.
9.3 Arguments Against Higher-Order Theories.
9.4 Self-application, Stratification and Impredicativity.
9.5 First-Order Status and Finite Cardinality.
9.6 Relevance of PTCT to Computational Semantics.
9.7 Conclusions.
10. Conclusions.
10.1 Montague Semantics and the Architecture of SemanticTheory.
10.2 Algebraic Semantics and Fine-Grained Alternatives toMS.
10.3 A Conservative Revision of MS.
10.4 Enriching Property Theory with Curry Typing.
10.5 An Intensional Number Theory.
10.6 A Dynamic Type-Theoretic Account of Anaphora andEllipsis.
10.7 Underspecified Interpretations as _-Terms of theRepresentation Language.
10.8 PTCT and Computational Semantics: Directions for FutureWork.
Bibliography.
Author Index.
Subject Index.
