A Computational Framework For Understanding Mathematical Discoursexy

Logic Journal of the IGPL 11 (4):457-484 (2003)
  Copy   BIBTEX

Abstract

An essential part of text understanding is to make explicit the implicit parts of discourse, namely its presuppositions and implications. For mathematical discourse, the explicitly stated portions of a text do not make sense taken in the absence of the illuminating implicit content. A reader, human or machine, must be able to “read between the lines”.In this paper, we present a computational framework for understanding informal mathematical discourse, extending and integrating state-of-the-art technologies from natural language processing and automated reasoning in a novel and promising way. For representing mathematical discourse, we introduce proof representation structures as the central data structure. PRSs are a considerable extension to discourse representation structures accommodating our need for representing discourse structure, and handling substructures and mathematical sentences as first-class citizens. For constructing PRSs, we propose a discourse update algorithm that is powered by pragmatics. It incorporates an underspecified semantic representation into the proof context by making use of mathematical and meta-mathematical knowledge, employing a proof planner. Proof plans, capturing common patterns of reasoning in mathematical proofs, enable us to gain a high level discourse understanding, allowing us to follow the proof author's main line of argument. Given such high-level discourse understanding, we can then compute the parts “between the lines”, those pieces of information that the proof author has taken for granted. We demonstrate that much inference is required to compute this implicit information

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Granularity Analysis for Mathematical Proofs.Marvin R. G. Schiller - 2013 - Topics in Cognitive Science 5 (2):251-269.
Reductive logic and proof-search: proof theory, semantics, and control.David J. Pym - 2004 - New York: Oxford University Press. Edited by Eike Ritter.
Anti-Realist Semantics for Mathematical and Natural Language.Matthew James Watson - 1998 - Dissertation, The University of Texas at Austin
Text structure and proof structure.C. F. M. Vermeulen - 2000 - Journal of Logic, Language and Information 9 (3):273-311.
Category theory: The language of mathematics.Elaine Landry - 1999 - Philosophy of Science 66 (3):27.
Mathematical proofs.Marco Panza - 2003 - Synthese 134 (1-2):119 - 158.

Analytics

Added to PP
2015-02-04

Downloads
5 (#1,463,568)

6 months
1 (#1,444,594)

Historical graph of downloads
How can I increase my downloads?