StackOverflow Questions for Tag: proofs

Hermes

Reputation: 21

Prove max x y = y given that x <= y in Idris 2?

proofidris2

Score: 1

Answers: 1

radrow

Reputation: 7129

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

coqproof

Score: 0

Answers: 1

udduu

Reputation: 119

Is is possible to rename a coq term?

coqproofcoq-tactic

Score: 0

Answers: 1

trusis

Reputation: 75

Lean prover: prove existential quantifier by providing an example

proofquantifierslean

Score: 0

Answers: 2

Pablo Martín Viñuelas

Reputation: 13

How to extract a variable from an exist clause

proofdafny

Score: 1

Answers: 1

luxuriant_lettuce

Reputation: 1

How to prove that nat_to_bin combines bin_to_nat b = normalize b in Coq

coqproof

Score: 0

Answers: 2

Alicia M.

Reputation: 39

Proof by reductio ad absurdum in Isabelle

isabelleproof

Score: 0

Answers: 1

Montserrat Hermo

Reputation: 71

I have a problem in Isabelle related to 'Clash of types' that I am unable to solve. Could someone help me?

functiontypespartialisabelleproof

Score: 1

Answers: 0

Enlico

Reputation: 28396

Does sequencing an infinite list of IO actions by definition result in a never-ending action? Or is there a way to bail out?

haskellfunctional-programminglanguage-lawyerproofio-monad

Score: 4

Answers: 2

templatetypedef

Reputation: 372724

Proof that the halting problem is NP-hard?

theoryproofhalting-problemnp

Score: 32

Answers: 1

Albtzrly

Reputation: 934

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

coqproofproof-of-correctness

Score: 4

Answers: 4

Cool Kid

Reputation: 9

Is this the best loop variant for the following code which takes in a sorted array of integers and determines if theres are ints x,y that equal k

pythonloopsiterationproofinduction

Score: -2

Answers: 3

bearhug15

Reputation: 23

Sledgehammer output with vampire

isabelleproof

Score: -1

Answers: 2

Max Podpera

Reputation: 59

Agda Recursion on Proof

proofagdaagda-mode

Score: 0

Answers: 1

Max Podpera

Reputation: 59

Agda Unresolved Metas

proofagda

Score: 0

Answers: 1

guardianfecal

Reputation: 1

What is the simplest AVL tree structure to demonstrate a complete right rotation?

binary-treeavl-treeproof

Score: 0

Answers: 1

pop123_123

Reputation: 1

lean4 prove that the set of prime numbers has at least two distinct elements

prooflean

Score: -1

Answers: 1

twc00

Reputation: 13

Josephus Problem - Is there a position with 0 chance of surviving, regardless of any skip interval?

discrete-mathematicsproofjosephus

Score: 0

Answers: 0

sukhi

Reputation: 11

Does this DFA satisfy the complement of the given language?

theoryproofautomatacomputation-theorydfa

Score: -2

Answers: 1

Dmytro Shashkevych

Reputation: 21

How can i view all the state for NEAR blockchain and respectively for arbitrary smart contract and prove some value takes part in calculation root

blockchainproofnearprotocol

Score: 1

Answers: 0

PreviousPage 2Next

StackOverflow Questions for Tag: proofs

Prove max x y = y given that x &lt;= y in Idris 2?

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

Is is possible to rename a coq term?

Lean prover: prove existential quantifier by providing an example

How to extract a variable from an exist clause

How to prove that nat_to_bin combines bin_to_nat b = normalize b in Coq

Proof by reductio ad absurdum in Isabelle

I have a problem in Isabelle related to &#39;Clash of types&#39; that I am unable to solve. Could someone help me?

Does sequencing an infinite list of IO actions by definition result in a never-ending action? Or is there a way to bail out?

Proof that the halting problem is NP-hard?

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

Is this the best loop variant for the following code which takes in a sorted array of integers and determines if theres are ints x,y that equal k

Sledgehammer output with vampire

Agda Recursion on Proof

Agda Unresolved Metas

What is the simplest AVL tree structure to demonstrate a complete right rotation?

lean4 prove that the set of prime numbers has at least two distinct elements

Josephus Problem - Is there a position with 0 chance of surviving, regardless of any skip interval?

Does this DFA satisfy the complement of the given language?

How can i view all the state for NEAR blockchain and respectively for arbitrary smart contract and prove some value takes part in calculation root

Prove max x y = y given that x <= y in Idris 2?

I have a problem in Isabelle related to 'Clash of types' that I am unable to solve. Could someone help me?