Proof that Fowler's money allocation algorithm is correct...

How to show that union and intersection of min cuts in flow network is also a min cut...

I'm having difficulty definining a property in Coq, not sure how to approach...

substitution in proofs with recursive formulas...

Time complexity analysis of data structures...

Dafny simple proof about giving change not working...

Big Oh Notation O((log n)^k) = O(log n)?...

WP Plugin: Why does the following simplified code fail to verify...

Theorem and Proof Environment in Beamer...

How to instruct `auto` to simplify the goal during proof search?...

Is is possible to rename a coq term?...

How to extract a variable from an exist clause...

Proof by reductio ad absurdum in Isabelle...

Does sequencing an infinite list of IO actions by definition result in a never-ending action? Or is ...

Proof that the halting problem is NP-hard?...

How would I prove that b = c if (andb b c = orb b c) in coq?...

Sledgehammer output with vampire...

Agda Recursion on Proof...

Agda Unresolved Metas...

Proof of dynamic programming solution for Leetcode 818: Racecar...

What is the proof of of (N–1) + (N–2) + (N–3) + ... + 1= N*(N–1)/2...

Coq simpl / unfold only once. (Replace part of goal with the result of one iteration of a function.)...

Counterexample for first-order logic assertion...

How can we prove by induction that binary search is correct?...

Is there a way for Coq to recall it already proved a property for the same element in the same proof...

How would you write ∀ y ∈ R+, ∃ z ∈ R, e^z = y in pseudocode?...

Proving n + S n = S (n + n) without n + S m = S (n + m)...

Why can't all existential binders be replaced by unique constants during skolemization?...

Is there a proof that runST is indeed pure?...

Is it possible to disambiguate instances with an intermediate step?...