<--- Back to Details
First PageDocument Content
Mathematical logic / Proof theory / Mathematical proof / Theorem / Four color theorem / Pythagorean theorem / Computer-assisted proof / Proof / Mathematics / Logic / Automated theorem proving
Date: 2015-03-23 00:24:54
Mathematical logic
Proof theory
Mathematical proof
Theorem
Four color theorem
Pythagorean theorem
Computer-assisted proof
Proof
Mathematics
Logic
Automated theorem proving

COMPUTER ASSISTED PROOFS: COMING SOON TO A THEOREM NEAR YOU By Sara Billey University of Washington March 23, 2015

Add to Reading List

Source URL: www.math.washington.edu

Download Document from Source Website

File Size: 1,18 MB

Share Document on Facebook

Similar Documents

Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/  August 2017

Making Automatic Theorem Provers more Versatile Simon Cruanes Veridis, Inria Nancy https://cedeela.fr/~simon/ August 2017

DocID: 1xVS8 - View Document

Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California

Theorem-Proving by Resolution as a Basis for Question-Answering Systems Cordell Green Stanford Research Institute Menlo Park, California

DocID: 1xVHV - View Document

A proof of Minkowski’s second theorem Matthew Tointon Minkowski’s second theorem is a fundamental result from the geometry of numbers with important applications in additive combinatorics (see, for example, its appli

A proof of Minkowski’s second theorem Matthew Tointon Minkowski’s second theorem is a fundamental result from the geometry of numbers with important applications in additive combinatorics (see, for example, its appli

DocID: 1xVE5 - View Document

Theorem Proving using Lazy Proof Expli
ation Corma
 Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear
h Center, HP Labs, Palo Alto, CA 2

Theorem Proving using Lazy Proof Expli ation Corma Flanagan1 , Rajeev Joshi1 , Xinming Ou2 , and James B. Saxe1 1 Systems Resear h Center, HP Labs, Palo Alto, CA 2

DocID: 1xVDI - View Document

A BOUNDEDNESS THEOREM FOR NEARBY SLOPES OF HOLONOMIC D-MODULES by Jean-Baptiste Teyssier  Abstract. — Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundednes

A BOUNDEDNESS THEOREM FOR NEARBY SLOPES OF HOLONOMIC D-MODULES by Jean-Baptiste Teyssier Abstract. — Using twisted nearby cycles, we define a new notion of slopes for complex holonomic D-modules. We prove a boundednes

DocID: 1xVAt - View Document