G. Allais
2018
Deciding Presburger arithmetic in agda
https://github.com/gallais/agda-presburger
C. Cohen
A. Mahboubi
2012
Formal Prrofs in Real Algebraic Geometry: from Ordered Fields to Quantifier Elimination
Logical Methods in Computer Science
8
1–40
10.2168/LMCS-8(1:2)2012
P. Crégut
Omega: a solver of quantifier-free problems in Presburger Arithmetic
https://coq.inria.fr/refman/omega.html
J. Doner
W. Hodges
1988
Alfred Tarski and Decidable Theories
The Journal of Symbolic Logic
53
1
20–35
10.1017/S0022481200028905
K. Gödel
1931
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I
Monatshefte für Mathematik und Physik
38
173–198
10.1007/BF01700692
J. Herbrand
1971
Logical Writings
D. Reidel Publishing Company
Dordrecht, Netherlands
10.1007/978-94-010-3072-4
A. Mahboubi
C. Cohen
2010
A Formal Quantifier Elimination for Algebraically Closed Fields
Intelligent Computer Mathematics
Calculemus 2010
Paris, France
189–203
10.1007/978-3-642-14128-7_17
T. Nipkow
2010
Linear Quantifier Elimination
Journal of Automated Reasoning
45
189–212
10.1007/s10817-010-9183-0
R. M. Robinson
1950
An Essentially Undecidable Axiom System
Proceedings of the International Congress of Mathematics
1
729–730
R. Stansifer
1984
Presburger's Article on Integer Arithmetic: Remarks and Translation
Technical Report
TR84-639
Cornell University, Computer Science Department
https://cs.fit.edu/~ryan/papers/presburger.pdf
A. Tarski
1944
The semantic conception of truth
Philosophy and Phenomenological Research
4
341–376
10.2307/2102968
P. van der Walt
W. Swierstra
2012
Engineering Proof by Reflection in Agda
Ralf Hinze
IFL - 24th International Symposium on Implementation and Application of Functional Languages
Lecture Notes in Computer Science
8241
Springer
Oxford, United Kingdom
157–173
10.1007/978-3-642-41582-1_10
The Agda Wiki
2017
The Agda Wiki
http://wiki.portal.chalmers.se/agda/pmwiki.php
The Agda Wiki
2017
The Agda Wiki - Tutorials
http://wiki.portal.chalmers.se/agda/pmwiki.php