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 | |
Results tagged with proof-assistants
Search options not deleted
user 12978
A proof assistant is software used for creating and checking formal proofs; examples include Coq and HOL. This tag is not to be used for requesting assistance on finding proofs. General questions about proof assistants can also be asked on the Proof Assistants Stack Exchange site.
3
votes
Algorithmic complexity of formal proof verification?
Given that I can cherry-pick the system, consider HOL Light. In HOL light (and probably in other systems like Isabelle and Coq), the proofs are written in a functional programming language (for HOL L …
- 6,287
6
votes
Does formalizing math require search and creativity, or is it near-mechanical?
Like Henry, I am not an expert---although I've played around with formal proof assistants.
First, one has to take into account if the background material is already formalized. This can make a big …
- 6,287