No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Writing and checking complete proofs in TEX
Abstract
TEX les are text les which are readable by other programs. Mathematical proofs written using TEX can be checked by a Python program provided they are expressed in a suciently strict proof language. Such a language can be con- structed using only a few extensions beyond the syntax of A.P. Morse's A Theory of Sets, one being the incorporation of explicit theorem number references into the syntax. Such a program has been applied to and successfully checked the the- orems in a signicant initial segment of a book length mathematical manuscript.
Context-free languages are easily parsed. Language used for the ex-pression of mathematics needs to be unambiguous. A.P. Morse devised a method for generating an essentially context-free mathematical language which formalizes the common practice of using the definitions occurring in a mathematical text as the basis for the mathematical language of that text. Morse obtained the unambiguity and prefix-free properties of any such language by placing syntactic constraints on the set of definienda. Although effective they lacked generality. We show here that greater gen-erality can be achieved using a unification-based constraint.
ResearchGate has not been able to resolve any references for this publication.