Proof of Loop Invariant and Algorithm...

Big-O notation and polynomials?...

Showing f(n) = O(f(n) + g(n))?...

k successive calls to tree successor in bst...

A different way to do induction on lists that needs a proof...

Prove big O of addition and subtraction of functions...

How can I use rules suggested by solve_direct? (by (rule …) doesn't always work)...

How can I bind the schematic variable ?case in a rule for proof by cases?...

How does agda's inspect function work?...

double negation insertion in agda...

How do you prove this pumping lemma example?...

proof - set of remainders of a prime p multiplied by another co prime...

Implementation of binary tree...

Proving non-existence of an infinite inductive value in Coq...

coq tactic for replacing bools with Prop...

longest common subsequence with linear memory usage...

Converting propositional logic argument to Prolog...

Prove max(O(f(n)), O(g(n)))=O(max(f(n), g(n))...

Stable comparison sort with O(n * log(n)) time and O(1) space complexity...

Can someone help me with this proof using the pumping lemma?...

How can I prove by induction that the second of these two algorithms is faster?...

How to prove by induction that a program does something?...

Why is there only one possible implementation of the *id* function?...

What laws are the standard Haskell type classes expected to uphold?...

How can I prove the following logic statement deductively?...

compress 2-bit numbers and save 1 bit use compression scheme...

Flawed random number generator?...

Show that n^2 is not O(n*log(n))?...

Finding inaccessible points on a 2D plane...

In Coq, which tactic to change the goal from `S x = S y` to `x = y`...