Question

How do you use induction with tactics/Isar in Isabelle/HOL?

score 1.1k · Answer 1 · 2025-01-05 22:00:17

1.1k

Views

How do you use induction with tactics/Isar in Isabelle/HOL?

Published on 05 January 2025 at 22:00

score 619 · Answer 2 · 2025-01-03 05:07:51

619

Views

Proving some monad laws on an error monad I wrote

Published on 03 January 2025 at 05:07

score 3.7k · Answer 3 · 2025-01-03 05:02:37

3.7k

Views

Why is (a | b ) equivalent to a - (a & b) + b?

Published on 03 January 2025 at 05:02

score 500 · Answer 4 · 2025-01-03 05:02:24

500

Views

Propositional Logic and Proofs

Published on 03 January 2025 at 05:02

score 189 · Answer 5 · 2025-01-03 05:09:05

189

Views

How to prove a combination of asymptotic notations?

Published on 03 January 2025 at 05:09

score 22.3k · Answer 6 · 2025-01-03 05:01:26

22.3k

Views

Proving Big-Theta notation

Published on 03 January 2025 at 05:01

score 80 · Answer 7 · 2025-01-03 05:02:22

80

Views

Type inferencing help in OCaml

Published on 03 January 2025 at 05:02

score 1.2k · Answer 8 · 2025-01-03 05:12:32

1.2k

Views

Prove that n! is not in O(n^p) for any constant natural number p

Published on 03 January 2025 at 05:12

score 523 · Answer 9 · 2025-01-03 05:12:31

523

Views

Proving the correctness of brute force maximum sub array algorithm

Published on 03 January 2025 at 05:12

score 104 · Answer 10 · 2025-01-03 05:05:11

104

Views

Associativity proof on Nats vs. Lists

Published on 03 January 2025 at 05:05

score 211 · Answer 11 · 2025-01-03 17:59:06

211

Views

proof of API response

Published on 03 January 2025 at 17:59

score 255 · Answer 12 · 2025-01-03 13:28:22

255

Views

Partition of natural numbers in sets

Published on 03 January 2025 at 13:28

score 171 · Answer 13 · 2025-01-03 05:12:30

171

Views

Z3 proofs: Are hypothesis and lemma rules always cleanly nested?

Published on 03 January 2025 at 05:12

score 3.1k · Answer 14 · 2025-01-03 05:02:36

3.1k

Views

Worst Case for stable matchings

Published on 03 January 2025 at 05:02

score 593 · Answer 15 · 2024-12-31 08:47:20

593

Views

How to prove a Ada/SPARK precondition on a function embedded in a double loop

Published on 31 December 2024 at 08:47

score 1.3k · Answer 16 · 2025-01-03 05:17:38

1.3k

Views

Consider the numbers 1,2,...,1000. Show that among any 501 of them, two numbers exist such that one divides the other one.

Published on 03 January 2025 at 05:17

List Question

How do you use induction with tactics/Isar in Isabelle/HOL?

Proving some monad laws on an error monad I wrote

Why is (a | b ) equivalent to a - (a & b) + b?

Propositional Logic and Proofs

How to prove a combination of asymptotic notations?

Proving Big-Theta notation

Type inferencing help in OCaml

Prove that n! is not in O(n^p) for any constant natural number p

Proving the correctness of brute force maximum sub array algorithm

Associativity proof on Nats vs. Lists

proof of API response

Partition of natural numbers in sets

Z3 proofs: Are hypothesis and lemma rules always cleanly nested?

Worst Case for stable matchings

How to prove a Ada/SPARK precondition on a function embedded in a double loop

Consider the numbers 1,2,...,1000. Show that among any 501 of them, two numbers exist such that one divides the other one.

Trending Questions

Popular # Hahtags

Popular Questions