Question

Are coinductive proofs necessary?

score 452 · Answer 1 · 2026-04-12 10:03:22

452

Views

Are coinductive proofs necessary?

Published on 12 Apr 2026 - 10:03

score 185 · Answer 2 · 2026-04-10 19:54:28

185

Views

Why do we need tactics, reflection and other techniques when we have Curry-Howard for theorem proving?

Published on 10 Apr 2026 - 19:54

score 2.7k · Answer 3 · 2026-04-11 08:36:45

2.7k

Views

Is it possible to prove everything in mathematics by theorem provers such as Coq?

Published on 11 Apr 2026 - 8:36

score 162 · Answer 4 · 2026-03-25 09:27:00

162

Views

Why are let binders part of the kernel in Coq/Lean?

Published on 25 Mar 2026 - 9:27

score 34 · Answer 5 · 2026-03-25 09:25:46

34

Views

meaning of “modulo” in Formal Methods.

Published on 25 Mar 2026 - 9:25

score 33 · Answer 6 · 2026-03-25 09:27:04

33

Views

question about flooring a certain kind of numbers

Published on 25 Mar 2026 - 9:27

score 68 · Answer 7 · 2026-03-25 09:23:25

68

Views

Proving diagonalization and inreversibility in matrices

Published on 25 Mar 2026 - 9:23

score 223 · Answer 8 · 2026-03-25 09:25:41

223

Views

lean prover for $\neg (p \wedge \neg p)$

Published on 25 Mar 2026 - 9:25

score 142 · Answer 9 · 2026-03-25 09:25:21

142

Views

Is $\mathbb{Z} ⊂ \mathbb{Q}$ true in formal proofs? How do formalized systems capture this relationship?

Published on 25 Mar 2026 - 9:25

score 216 · Answer 10 · 2026-03-25 09:29:58

216

Views

How we can we prove that for any $b > a, x > 0$, $\frac{2}{\pi} (1-\frac{a}{b})<\sup|\frac{\sin(ax)}{ax} - \frac{\sin(bx)}{bx}|<4(1-\frac{a}{b})$

Published on 25 Mar 2026 - 9:29

score 236 · Answer 11 · 2026-03-25 09:29:18

236

Views

The formula for $g\frac{d}{dg}g\frac{d}{dg}...g\frac{d}{dg}f(g)$

Published on 25 Mar 2026 - 9:29

score 125 · Answer 12 · 2026-03-25 09:26:26

125

Views

Do logical connectives in type theory not form well-formed formulas like they do in classical logic?

Published on 25 Mar 2026 - 9:26

score 28 · Answer 13 · 2026-03-25 09:29:12

28

Views

How to prove the statement "If = <sup>−1</sup>, and is nonsingular, then det() = det()" if it is true or false?

Published on 25 Mar 2026 - 9:29

score 38 · Answer 14 · 2026-04-06 05:04:11

38

Views

Why is the composition also a function

Published on 06 Apr 2026 - 5:04

score 152 · Answer 15 · 2026-03-25 09:23:28

152

Views

understanding $\Pi$- and $\Sigma$-types via arithmetic interpretation

Published on 25 Mar 2026 - 9:23

List Question

Are coinductive proofs necessary?

Why do we need tactics, reflection and other techniques when we have Curry-Howard for theorem proving?

Is it possible to prove everything in mathematics by theorem provers such as Coq?

Why are let binders part of the kernel in Coq/Lean?

meaning of “modulo” in Formal Methods.

question about flooring a certain kind of numbers

Proving diagonalization and inreversibility in matrices

lean prover for $\neg (p \wedge \neg p)$

Is $\mathbb{Z} ⊂ \mathbb{Q}$ true in formal proofs? How do formalized systems capture this relationship?

How we can we prove that for any $b > a, x > 0$, $\frac{2}{\pi} (1-\frac{a}{b})<\sup|\frac{\sin(ax)}{ax} - \frac{\sin(bx)}{bx}|<4(1-\frac{a}{b})$

The formula for $g\frac{d}{dg}g\frac{d}{dg}...g\frac{d}{dg}f(g)$

Do logical connectives in type theory not form well-formed formulas like they do in classical logic?

How to prove the statement "If = <sup>−1</sup>, and is nonsingular, then det() = det()" if it is true or false?

Why is the composition also a function

understanding $\Pi$- and $\Sigma$-types via arithmetic interpretation

Trending Questions

Popular # Hahtags

Popular Questions