A proof assistant is software used for creating and checking formal proofs; examples include Coq and HOL. Not to be used for requesting assistance on finding proofs.

learn more… | top users | synonyms

19
votes
32answers
1k views

Formalizations of category theory in proof assistants

What are the existing formalizations of category theory in proof assistants? I'm primarily interested in public-domain code implementing category theory in a proof assistant (Coq, Agda, ...
4
votes
1answer
308 views

Set-theoretic tautologies

Let us consider unquantifed formulas of a set theory (for example, NBG), more precisely, the formulas, constructed from variables and the constants $\emptyset, V$ (the empty set and the class of all ...
10
votes
4answers
1k views

Does formalizing math require search and creativity, or is it near-mechanical?

I remember reading somewhere that it takes about a week to convert a page of math into something a proof-assistant like Isabelle or HOL Light would accept. Is this type of conversion something that ...
16
votes
3answers
737 views

Function extensionality: does it make a difference? why would one keep it out of the axioms?

Yesterday I was shocked to discover that function extensionality (the statement that if two functions $f$ and $g$ on the same domain satisfy $f\left(x\right) = g\left(x\right)$ for all $x$ in the ...
33
votes
1answer
1k views

Wanted: a “Coq for the working mathematician”

Sorry for a possibly off-topic question -- there are four StackExchange subs each of which could be construed as the proper place for this question, and I've just picked the one I'm most familiar ...
1
vote
2answers
471 views

How to interpret conflicting formal proofs about “a mod 0 = ? ”

The proof assistants Coq and Isabelle give conflicting formal proofs about $a \mod 0 \qquad \forall a \in \mathbb{Z}$. According to Coq $$ a \mod 0 = 0$$ and Isabelle proves $$ a \mod = a$$ ...
18
votes
2answers
873 views

At which level is it currently possible to write formal proofs?

I am wondering whether I should try to have some fun using proof systems. I have never used such a system, but I have some experiences in logic and programming. My question is: At which level of ...
0
votes
1answer
217 views

prod and sig in COQ

Hello, Apparently in COQ the type prod (with one constructor pair) corresponds to cartesian product and the type sig (with one constructor exist) to dependent sum but how is described the fact that ...
42
votes
9answers
4k views

How do they verify a verifier of formalized proofs?

In an unrelated thread Sam Nead intrigued me by mentioning a formalized proof of the Jordan curve theorem. I then found that there are at least two, made on two different systems. This is quite an ...
20
votes
4answers
3k views

Why is it so difficult to write complete (computer verifiable) proofs?

For example I have read that is agony to give a complete proof of the Jordan curve theorem. Since all statements are meant to be justified by the postulates, where does the difficulty lie?
2
votes
0answers
1k views

Why should I trust Coq when assumption-free proof of False in Coq exists? [closed]

Damien Pous announced code for assumption-free proof of False in Coq which means inconsistency in Coq (without using exploits, lol). Damien is critical of "fully certified decision procedure ...
1
vote
2answers
846 views

What is a semigroup or, what do I do with that associativity proof?

Mathematically, I know what a semigroup is: It is a set S along with an associative binary operation $* : S \times S \rightarrow S$. So far, so good. From a computational perspective, one can ...
5
votes
6answers
2k views

Is there any proof assistant based on first-order logic?

I'm looking for a proof assistant in order to write formal proofs about basic facts of set theory, such as: $a\subseteq a$ $(a,b)=(c,d)\leftrightarrow a=c\land b=d$ Natural deduction for ...
3
votes
1answer
884 views

Proving inequalities over algebraic structures

I've been looking at proof techniques in formal systems like Coq and Agda recently, and encountered the newring tactic described here for proving equalities over ...
5
votes
1answer
947 views

Is there a known way to formalise notion that certain theorems are essential ones?

Suppose You ask a question beginning from "Why some structure is..." or "Why some object has property..." and several answers arises. Which criteria do You use to qualify which answer is correct? ...
5
votes
3answers
642 views

Proof formalization

I read some time ago some papers about proof formalization. Typically, I began whith this one, from Lamport. Are there more recent works in this field ?
11
votes
7answers
1k views

Intro to automatic theorem proving / logical foundations?

Is there any web-based course or materials about logic / automatic theorem proving? (I checked MIT's OpenCourseWare and I only found a vaguely related AI course)
22
votes
5answers
2k views

Proof assistants for mathematics

This question is related to (maybe even the same in intent as) Question 1017, but none of the answers seem to address what I'm looking for. There are a lot of resources available for people who want ...