Question

Are coinductive proofs necessary?

score 449 · Answer 1 · 2012-10-25 13:45:53

449

Views

Are coinductive proofs necessary?

Published on 25 Oct 2012 - 13:45

score 182 · Answer 2 · 2012-12-03 02:43:15

182

Views

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

Published on 03 Dec 2012 - 2:43

score 2.6k · Answer 3 · 2012-12-28 15:03:36

2.6k

Views

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

Published on 28 Dec 2012 - 15:03

score 161 · Answer 4 · 2020-12-25 20:13:56

161

Views

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

Published on 25 Dec 2020 - 20:13

score 33 · Answer 5 · 2021-02-21 23:24:01

33

Views

meaning of “modulo” in Formal Methods.

Published on 21 Feb 2021 - 23:24

score 32 · Answer 6 · 2021-08-17 12:57:54

32

Views

question about flooring a certain kind of numbers

Published on 17 Aug 2021 - 12:57

score 67 · Answer 7 · 2021-11-25 11:08:59

67

Views

Proving diagonalization and inreversibility in matrices

Published on 25 Nov 2021 - 11:08

score 222 · Answer 8 · 2021-11-29 22:41:25

222

Views

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

Published on 29 Nov 2021 - 22:41

score 141 · Answer 9 · 2022-02-20 17:13:28

141

Views

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

Published on 20 Feb 2022 - 17:13

score 215 · Answer 10 · 2022-03-31 07:12:26

215

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 31 Mar 2022 - 7:12

score 235 · Answer 11 · 2022-06-27 13:04:15

235

Views

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

Published on 27 Jun 2022 - 13:04

score 124 · Answer 12 · 2022-07-26 16:49:59

124

Views

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

Published on 26 Jul 2022 - 16:49

score 27 · Answer 13 · 2022-08-26 13:07:32

27

Views

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

Published on 26 Aug 2022 - 13:07

score 36 · Answer 14 · 2022-11-06 14:58:29

36

Views

Why is the composition also a function

Published on 06 Nov 2022 - 14:58

score 151 · Answer 15 · 2023-01-26 02:00:45

151

Views

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

Published on 26 Jan 2023 - 2:00

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