# The Language of Mathematics

@inproceedings{Ganesalingam2013TheLO, title={The Language of Mathematics}, author={M. Ganesalingam}, booktitle={Lecture Notes in Computer Science}, year={2013} }

Mathematics arises from the interaction of two dissimilar modes of reasoning: a ‘soft’ side, dealing with ideas and analogies, and a ‘hard’ side, dealing with verification. The ‘hard’ side is easier to pin down. It consists primarily of formal ‘proofs’, each consisting of a series of assertions. A mathematician can verify that a proof is correct by following it, step by step, checking that each step follows from previous ones via facts already proved to be correct.

#### Topics from this paper

#### 73 Citations

Type inference in mathematics

- Mathematics, Computer Science
- Bull. EATCS
- 2012

Some of the mechanisms for type inference used by the "Mathematical Components" project, which is working towards a verification of the Feit-Thompson theorem, are explained. Expand

N.G. de Bruijn’s contribution to the formalization of mathematics

- Mathematics
- 2013

Abstract N.G. (Dick) de Bruijn was the first to develop a formal language suitable for the complete expression of a mathematical subject matter. His formalization does not only regard the usual… Expand

A Fully Automatic Theorem Prover with Human-Style Output

- Computer Science, Medicine
- Journal of Automated Reasoning
- 2016

This paper describes a program that solves elementary mathematical problems, mostly in metric space theory, and presents solutions that are hard to distinguish from solutions that might be written by… Expand

Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues

- Computer Science
- CICM
- 2017

It is asserted that modelling the Q&A process computationally provides a route to domain understanding that is compatible with the day-to-day practices of mathematicians and students. Expand

Towards mathematical AI via a model of the content and process of mathematical question and answer dialogues

- 2017

This paper outlines a strategy for building semantically meaningful representations and carrying out effective reasoning in technical knowledge domains such as mathematics. Our central assertion is… Expand

The Naproche system: Proof-checking mathematical texts in controlled natural language

- Computer Science
- 2016

A novel foundational theory of functions called Ackermann-like Function Theory is developed, which is equiconsistent to ZFC and can be used for imposing limitations to implicit dynamic function introduction in order to avoid this paradox. Expand

High-Level Modelling for Typed Functional Programming

- Computer Science
- TFP
- 2021

There is currently no way to model the high-level structural design of a functional system. Given the strong links between functional programming and mathematics, it is hypothesised that the language… Expand

Penrose

- 2020

We introduce a system called Penrose for creating mathematical diagrams. Its basic functionality is to translate abstract statements written in familiar math-like notation into one or more possible… Expand

Premise Selection in the Naproche System

- Mathematics, Computer Science
- IJCAR
- 2010

An axiom selection method for series of related problems that is based on logical and textual proximity and tries to mimic a human way of understanding mathematical texts and presents first results that indicate that this approach is indeed useful. Expand

Penrose: from mathematical notation to beautiful diagrams

- Computer Science
- ACM Trans. Graph.
- 2020

Fig. 1. Penrose is a framework for specifying how mathematical statements should be interpreted as visual diagrams. A clean separation between abstract mathematical objects and their visual… Expand

#### References

SHOWING 1-10 OF 40 REFERENCES

Philosophy of mathematics: What numbers could not be

- Philosophy
- 1965

THE attention of the mathematician focuses primarily upon mathematical structure, and his intellectual delight arises (in part) from seeing that a given theory exhibits such and such a structure,… Expand

On the Exhaustion of Mathematical Entities by Structures

- Philosophy
- 2014

There has been considerable discussion in the literature of one kind of identity problem that mathematical structuralism faces: the automorphism problem, in which the structure is unable to… Expand

Type Theory and the Informal Language of Mathematics

- Computer Science
- TYPES
- 1993

Following roughly the format of Montague grammar, I have been working within the constructive type theory of Martin-LSf, which provides an important generalization of the type structure implicit in Frege and explicit in Montague. Expand

Principia Mathematica

- Nature
- 1911

THIS work contains some thousands of propositions, each, with its proof, expressed in a shorthand so concise that if they were all expanded into ordinary language, the room taken up would be ten… Expand

Understanding informal mathematical discourse

- Computer Science, Sociology
- 2004

This thesis aims to provide a general framework as well as an implementation for such a proof engine that is capable of processing mathematical proofs automatically, at least with regard to translating the mathematicians’ expert language into the system's artificial formal language. Expand

Syntactic Categories in the Language of Mathematics

- Computer Science
- TYPES
- 1994

A formalism that comprises both informal English, a system of syntactic categories and syntax trees, and a formal mathematical language is ended up. Expand

Philosophy of mathematics : structure and ontology

- Mathematics
- 2004

Do numbers, sets, and so forth, exist? What do mathematical statements mean? Are they literally true or false, or do they lack truth values altogether? Addressing questions that have attracted lively… Expand

Context-Relative Syntactic Categories and the Formalization of Mathematical Text

- Computer Science
- TYPES
- 1995

The rules presented are a fragment of a grammar implemented in the proof editor ALF, which can be used as an interactive proof text editor, so that the user chooses proof steps, wordings, and grammatical structures, and the system checks that the text is both mathematically and grammatically correct. Expand

Mathematical structuralism and the Identity of Indiscernibles

- Mathematics
- 2005

context from the antecedent to the consequent which would be required for the utterance to express a falsehood.5 If there were some deep theoretical or intuitive reason to identify propositions with… Expand

Structures grammaticales dans le franÇais mathematique : I

- Mathematics
- 1997

A system of grammatical rules is presented to analyse a fragment of French that permits the expression of mathematical theorems and proofs. To this end, a version of Montague grammar is developed,… Expand