|
585
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
|
57
|
A Compiled Implementation of Strong Reduction
– Benjamin Grégoire, Inria Rocquencourt, Xavier Leroy
|
|
53
|
Theorem Proving Modulo
– Gilles Dowek, Thérèse Hardin, Claude Kirchner
|
|
4
|
Coq’Art: The Calculus of Inductive Constructions, volume XXV of Text in theor. comp. science: an EATCS series
– Y Bertot, P Castéran
- 2004
|
|
824
|
Term Rewriting and All That
– F Baader, T Nipkow
- 1998
|
|
37
|
Logic and Computation
– L C Paulson
- 1987
|
|
52
|
Applying Linear Quantifier Elimination
– Rüdiger Loos, Volker Weispfenning
- 1993
|
|
79
|
Super-Exponential Complexity of Presburger Arithmetic
– Michael Jo Fischer, Michael J. Fischer, Michael O. Rabin, Michael O. Rabin
- 1974
|
|
66
|
The complexity of linear problems in fields
– Volker Weispfenning
- 1988
|
|
10
|
Verifying and reflecting quantifier elimination for Presburger arithmetic
– Amine Chaieb, Tobias Nipkow
- 2005
|
|
41
|
Executing higher order logic
– Stefan Berghofer, Tobias Nipkow, Technische Universität München
- 2002
|
|
34
|
A decision procedure for the first order theory of real addition with order
– Jeanne Ferrante, Charles Rackoff
- 1975
|
|
21
|
Solution d'une question particuliere du calcul des inegalites, Nouveau Bulletin des Sciences par la Societe Philomatique de Paris, 1826, in [36] vol.2,317{319
– J Fourier
|
|
22
|
A proof-producing decision procedure for real arithmetic
– Sean Mclaughlin, John Harrison
- 2005
|
|
463
|
A decision method for elementary algebra and geometry
– Alfred Tarski
- 1948
|
|
79
|
Theorem proving in arithmetic without multiplication
– D C Cooper
- 1972
|
|
46
|
Metatheory and Reflection in Theorem Proving: A Survey and Critique
– John Harrison
- 1995
|
|
406
|
The Omega Test: a fast and practical integer programming algorithm for dependence analysis
– William Pugh
- 1992
|
|
39
|
Proof-assistants using Dependent Type Systems
– Henk Barendregt, Herman Geuvers
- 2001
|
