A Presuppositional Analysis of Definite Descriptions in Proof Theory

  • Koji Mineshima
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4914)


In this paper we propose a proof-theoretic analysis of presuppositions in natural language, focusing on the interpretation of definite descriptions. Our proposal is based on the natural deduction system of ε-calculus introduced in Carlström [2] and on constructive type theory [11,12]. Based on the idea in [2], we use the ε-calculus as an intermediate language in the translation process from natural language into constructive type theory. Using this framework, we formulate the process of presupposition resolution as the process of searching for a derivation in a natural deduction system. In particular, we show how to treat presupposition projection and accommodation within our proof-theoretic framework.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Koji Mineshima
    • 1
  1. 1.Keio University 

Personalised recommendations