A logical approach to abstract algebra
Paper in proceeding, 2005

Recent work in constructive mathematics show that Hilbert's program works for a large part of abstract algebra. Furthermore the arguments we get are not only elementary but also mathematically simpler. We present an example where the simplification was significant enough to suggest an improved version of a classical theorem. For this we use a general method to transform some logically complex first-order formulae in a geometrical form which may be interesting in itself.

Theorem proving

Mathematical transformations

Computational methods

Author

Thierry Coquand

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

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

03029743 (ISSN) 16113349 (eISSN)

Vol. 3526 86-95

First Conference on Computability in Europe, CiE 2005: New Computational Paradigms
Amsterdam, Netherlands,

Subject Categories

Algebra and Logic

Mathematics

Computational Mathematics

DOI

10.1007/11494645_12

More information

Latest update

8/4/2020 1