Computer Theorem Proving in Math

Computer Theorem Proving in Math

Cached

Download Links

by Carlos Simpson

Citations:

BibTeX

@MISC{Simpson_computertheorem,
    author = {Carlos Simpson},
    title = {Computer Theorem Proving in Math},
    year = {}
}

Bookmark

OpenURL

Abstract

We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context.

Citations

829	A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
505	A Computational Logic - Boyer, Moore - 1979
301	Intuitionistic Type Theory - Martin-Löf - 1984
301	Recursive functions of symbolic expressions and their computation by machine, part I - McCarthy - 1960
221	Interprétation fonctionnelle et élimination des coupures de l’arithmétique d’ordre supérieur. Thèse de Doctorat d’ État, Université de Paris VII - Girard - 1972
133	Towards a mathematical science of computation - McCarthy - 1962
106	The type-theoretic interpretation of constructive set theory: inductive definitions - Aczel - 1986
75	Ecc: an extended calculus of constructions - Luo - 1989
58	An analysis of Girard’s paradox - Coquand - 1985
51	The non-existence of finite projective planes of order 10 - Lam, Thiel, et al. - 1989
46	Homotopy Hyperbolic 3–manifolds Are Hyperbolic, preprint available at http://www.msri.org/MSRI-preprints/online/1996-058.html - Gabai, Thurston, et al. - 1996
45	Generic programming within dependently typed programming - Altenkirch, McBride - 2003
43	Should Your Specification Language Be Typed - Paulson - 1999
36	A Mechanical Proof of the Church-Rosser Theorem - Shankar - 1988
35	Benthem Jutting. Checking Landau’s “Grundlagen” in the AUTOMATH system - van - 1977
25	Une théorie des constructions inductives. Thèse d’Etat - Werner - 1994
23	Finite functions and the necessary use of large cardinals - Friedman - 1998
22	Formalized mathematics - Harrison - 1996
19	From LCF to HOL: A short history - Gordon - 2000
18	Benthem Jutting. Checking Landau's "Grundlagen - van - 1977
13	Experiments with ZF Set Theory in HOL and Isabelle - Agerholm, Gordon - 1995
13	The Mizar-QC/6000 logic information language - Trybulec - 1978
11	Two models of synthetic domain theory - Fiore, Rosolini - 1997
9	Studies in duality on Noetherian formal schemes and non-Noetherian ordinary schemes - Tarrío, López, et al. - 1999
9	Computational adequacy in an elementary topos - Simpson - 1999
8	Explicit universes for the calculus of constructions - Courant
8	A Constructive Formalization of the Fundamental Theorem of Calculus - Cruz-Filipe - 2002
8	The Flyspeck Project Fact Sheet. http://www.math.pitt.edu/~thales/flyspeck/index.html - Hales
8	Domains for denotational semantics. In Automata, languages and programming - Scott - 1982
8	A comparison of Mizar and Isar - Wenzel, Wiedijk
8	A Ramsey Theorem in Boyer-Moore Logic - Kunen - 1995
8	A mechanical proof of quadratic reciprocity - Russinoff - 1992
7	Typical ambiguity: trying to have your cake and eat it too - Feferman
7	system : http://www.cl.cam.ac.uk/Research/HVG/Isabelle - Isabelle
7	Theorem-proving on the computer - Robinson - 1963
6	An axiomatisation of intuitionistic Zermelo-Fraenkel set theory. See http://coq.inria.fr/contribs-eng.html - Alexandre
6	Sur la formalisation des mathématiques dans le Calcul des Constructions Inductives. Thesis, Université de Nice-Sophia Antipolis - Chicli - 2003
6	Inconsistency of classical logic in type theory. http://www.cs.kun.nl/~herman/note.ps.gz See also other publications athttp://www.cs.kun.nl/~herman/pubs.html 35 - Geuvers
6	Sets in Types, Types in Sets. Theoretical aspects of computer software - Werner - 1999
6	An encoding of Zermolo-Fraenkel Set Theory in Coq: see http://coq.inria.fr/contribs-eng.html - Werner
5	The nonexistence of ovals in a projective plane of order 10 - Lam, Thiel, et al. - 1983
5	Types considered harmful, or Types are not harmless. This appeared under the first title in a posting by P. Rudnicki on [68], Volume 2 - Lamport - 1994
5	Strings from logic - Schmidhuber - 2000
4	Mathematical quotients and quotient types - Chicli, Pottier, et al.
4	A program from an A-translated impredicative proof of Higman’s Lemma - Herbelin
4	Automated Reasoning: Essays in Honor of Woody Bledsoe - Boyer - 1991
4	Mathematical quotients and quotient types in Coq - Chicli, Pottier, et al. - 2003
3	XCB, the last of the shortest single axioms for the classical equivalential calculus, cs.LO/0211015, and Vanquishing the XCB question: the methodology discovery of the last shortest single axiom for the equivalential calculus - Fitelson, Ulrich, et al.
3	Proof Assistants using Dependent Type Systems, Chapter 18 of the Handbook of Automated Reasoning - Barendregt, Geuvers - 2001
3	Reply to thread "How to prove two constructors are di#erent", on [82 - McKinna - 2003