Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

New posts in proof

Proof that a binary tree with n leaves has a height of at least log n

logic binary-tree nodes proof induction

Why is the greedy algorithm optimal?

algorithm greedy proof

Universal Quantification in Isabelle/HOL

proof isabelle

How to solve goals with invalid type equalities in Coq?

types equality proof coq

If Idris thinks things may be total that are not, can Idris be used for proofs?

proof idris totality

Handling let in hypothesis

coq proof dependent-type

How to prove (forall x, P x /\ Q x) -> (forall x, P x)

proof coq

Prove the efficiency of repeated calls to successor() in binary trees?

algorithm binary-search-tree proof

Using Ogden’s Lemma versus regular Pumping Lemma for Context-Free Grammars

string math context-free-grammar proof pumping-lemma

How to prove False from obviously contradictory assumptions

coq proof

prove n = Big-O(1) using induction

complexity-theory big-o proof

How can I have Idris automatically prove that two values are not equal?

proof idris

Generalizing fold such that it becomes expressive enough to define any finite recursion?

haskell functional-programming generic-programming fold proof

Context Free Language Question (Pumping Lemma)

theory automata proof language-theory

Using big-O to prove N^2 is O(2^N)

big-o proof

Why Coq doesn't allow inversion, destruct, etc. when the goal is a Type?

coq proof inversion

How to prove this invariant?

ada proof invariants proof-of-correctness spark-ada

How or is that possible to prove or falsify `forall (P Q : Prop), (P -> Q) -> (Q -> P) -> P = Q.` in Coq?

equality coq proof dependent-type curry-howard
« Newer Entries Older Entries »