Can we show that finding the (1-D) closest pair has to be at least n log n?...

Proof by counterexample in Coq...

Haskell: Is it true that function application distributes over list concatenation?...

Why pumping lemma for CFG doesn't work...

Proof: Check if two integer arrays are permutations of each other using linear time and constant spa...

Idris interactive prover won't perform rewrite on an assumption...

How to prove a prove definition in Coq...

What is a "roundabout proof" in Propositions as Types by P. Wadler?...

Prove that a graph is bipartite...

Proof with false hypothesis in Isabelle/HOL Isar...

Operator overloading in Isabelle...

What's the best way to write Mathematical Proofs on the web?...

Help with Big Omega Proof?...

How do I get symbolic square root and logarithm functions in SBV?...

Why does this SBV code stop before hitting the limit I set?...

Proof from Axioms...

Prove length (h::l) = 1 + length l...

How to prove this natural deduction?...

Proof by case analysis in Coq...

Coq calculational style biconditional chain...

Explain why x == ~(~x + 1) + 1 (two's complement and back!)...

I can't prove (n - 0) = n with Idris...

Minimum spanning tree 2- dimensional graph...

Derive relationship between sum of all edge weights and MST in a graph satisfying the triangle inequ...

Failed to refine any pending goal...

Minimum spanning tree. unique min edge vs non unique proof...

Prove Logical Operations Using Inference Rules...

Prove map id = id in idris?...

Prove that one hypothesis is negation of another in Coq...

Proof of existence of prime factorization (Educational)...