A presuppositional analysis of definite descriptions in proof theory

Koji Mineshima

doi:10.1007/978-3-540-78197-4_20

A presuppositional analysis of definite descriptions in proof theory

Koji Mineshima

Department of Philosophy

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers
Pages	214-227
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-540-78197-4_20
Publication status	Published - 2008 Aug 27
Event	21st Annual Conference of The Japanese Society for Artificial Intelligence, JSAI 2007 - Miyazaki, Japan Duration: 2007 Jun 18 → 2007 Jun 22

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4914 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st Annual Conference of The Japanese Society for Artificial Intelligence, JSAI 2007
Country/Territory	Japan
City	Miyazaki
Period	07/6/18 → 07/6/22

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-78197-4_20

Cite this

Mineshima, K. (2008). A presuppositional analysis of definite descriptions in proof theory. In New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers (pp. 214-227). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4914 LNAI). https://doi.org/10.1007/978-3-540-78197-4_20

A presuppositional analysis of definite descriptions in proof theory. / Mineshima, Koji.
New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers. 2008. p. 214-227 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4914 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mineshima, K 2008, A presuppositional analysis of definite descriptions in proof theory. in New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4914 LNAI, pp. 214-227, 21st Annual Conference of The Japanese Society for Artificial Intelligence, JSAI 2007, Miyazaki, Japan, 07/6/18. https://doi.org/10.1007/978-3-540-78197-4_20

Mineshima K. A presuppositional analysis of definite descriptions in proof theory. In New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers. 2008. p. 214-227. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-78197-4_20

@inproceedings{03d58266253f4d25a47a0d0d327fcca3,

title = "A presuppositional analysis of definite descriptions in proof theory",

abstract = "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{\"o}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.",

author = "Koji Mineshima",

year = "2008",

month = aug,

day = "27",

doi = "10.1007/978-3-540-78197-4_20",

language = "English",

isbn = "354078196X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "214--227",

booktitle = "New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers",

note = "21st Annual Conference of The Japanese Society for Artificial Intelligence, JSAI 2007 ; Conference date: 18-06-2007 Through 22-06-2007",

}

TY - GEN

T1 - A presuppositional analysis of definite descriptions in proof theory

AU - Mineshima, Koji

PY - 2008/8/27

Y1 - 2008/8/27

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49949119919&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49949119919&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-78197-4_20

DO - 10.1007/978-3-540-78197-4_20

M3 - Conference contribution

AN - SCOPUS:49949119919

SN - 354078196X

SN - 9783540781967

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 214

EP - 227

BT - New Frontiers in Artificial Intelligence - JSAI 2007 Conference and Workshops, Revised Selected Papers

T2 - 21st Annual Conference of The Japanese Society for Artificial Intelligence, JSAI 2007

Y2 - 18 June 2007 through 22 June 2007

ER -

A presuppositional analysis of definite descriptions in proof theory

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this