Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Coq is a formal proof management system, also called an interactive theorem prover. It is used to express mathematical assertions, mechanically check proofs of these assertions, find formal proofs, and extract certified programs.
3
votes
How true are theorems proved by Coq?
There is a comment in Wikipedia that Martin-Löf type theory with arbitrarily many finite level universes has proof-theoretic ordinal the Feferman-Schütte ordinal $\Gamma_0$. There is no obvious refere …
6
votes
How true are theorems proved by Coq?
I just learned about the part of the Coq FAQ titled What do I have to trust when I see a proof checked by Coq?. … The Coq kernel implementation: You have to trust that the implementation of the Coq kernel mirrors the theory behind Coq. …