Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

12 relations
Automated proof checkingAutomathCommunications of the ACMCoq (software)
Expand

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… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2013
2013
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… 
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
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… 
  • figure 1
  • figure 2
  • figure 3
  • table 1
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
Traditionally, computer simulation techniques are used to perform probabilistic analysis. However, they provide inaccurate… 
  • figure 1
Highly Cited
2004
Highly Cited
2004
On Equivalents of Well-Foundedness
Four statements equivalent to well-foundedness (well-founded induction, existence of recursively defined functions, uniqueness of… 
  • figure 2
  • figure 3
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… 
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… 
1998
1998
Power counting degree versus singular order in the Schwinger model
The importance of a rigorous definition of the singular degree of a distribution is demonstrated on the case of two-dimensional… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE