Skip to search formSkip to main contentSkip to account menu

QED manifesto

Known as: QED Project, The QED Project, Project QED 
The QED manifesto was a proposal for a computer-based database of all mathematical knowledge, strictly formalized and with all proofs having been… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Automated proof checkingAutomathCommunications of the ACMCoq (software)

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
QED Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge
Proposed in 1994, the ``QED project'' was one of the seminally influential initiatives in automated reasoning: It envisioned the… 
2012
2012
Theorem Proving in Large Formal Mathematics as an Emerging AI Field
In the recent years, we have linked a large corpus of formal mathematics with automated theorem proving (ATP) tools, and started… 
2012
2012
Finding Errors in New Object Intents
The classification of possible errors in object intents is given and some possibilities of exploring them are discussed. An… 
Review
2007
Review
2007
The QED Manifesto Revisited
We present an overview of the current state of formalization of mathematics, and argue what will be needed to make the vision… 
2007
2007
Verification of Probabilistic Properties in HOL Using the Cumulative Distribution Function
  • O. HasanS. Tahar
  • International Conference on Integrated Formal…
  • 2007
  • Corpus ID: 23957983
Traditionally, computer simulation techniques are used to perform probabilistic analysis. However, they provide inaccurate… 
2007
2007
Factors Influencing Change Initiatives to Improve K-20 STEM Education at California State University, Dominguez Hills: Final Case Study of SCALE Activities
Readers may make verbatim copies of this document for noncommercial purposes by any means, provided that the above copyright… 
2003
2003
On the Integrity of a Repository of Formalized Mathematics
MIZAR, a proof-checking system, is used to build the MIZAR Mathematical Library (MML). This is a long term project aiming at… 
2002
2002
The Reflection Theorem: A Study in Meta-theoretic Reasoning
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires… 
Highly Cited
1999
Highly Cited
1999
On Equivalents of Well-Foundedness
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of… 
1999
1999
On Equivalents of Well-foundedness - An experiment in Mizar
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively deened functions, uniqueness of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)