Question

What is the name of the rule that allows us to infer the truth of an equation from the truth of another equation?

score 60 · Answer 1 · 2019-05-25 06:26:23

60

Views

What is the name of the rule that allows us to infer the truth of an equation from the truth of another equation?

Published on 25 May 2019 - 6:26

score 1.1k · Answer 2 · 2026-03-25 14:00:40

1.1k

Views

How do I formally prove a universal implication?

Published on 25 Mar 2026 - 14:00

score 1.3k · Answer 3 · 2026-03-25 13:56:47

1.3k

Views

Understanding ex falso quodlibet together with proof by contradiction in a Gentzen style ND Proof

Published on 25 Mar 2026 - 13:56

score 49 · Answer 4 · 2019-06-01 21:31:31

49

Views

Could provide some further detail about this step in a proof

Published on 01 Jun 2019 - 21:31

score 177 · Answer 5 · 2026-03-25 13:58:10

177

Views

Show that $ \forall{x}\exists{y}{(P(x) \to Q(y))} \vdash \exists{y}\forall{x}{(P(x) \to Q(y))} $

Published on 25 Mar 2026 - 13:58

score 156 · Answer 6 · 2019-06-13 17:41:29

156

Views

Proof logical statement with interference rules

Published on 13 Jun 2019 - 17:41

score 889 · Answer 7 · 2019-06-23 21:32:56

889

Views

Trying to understand the difference between metatheory and theory and circularity

Published on 23 Jun 2019 - 21:32

score 121 · Answer 8 · 2019-06-24 00:55:42

121

Views

Question on how to prove an expression satisfies a quadratic equation

Published on 24 Jun 2019 - 0:55

score 76 · Answer 9 · 2019-06-24 01:39:24

76

Views

Verification of proof on repeated root for a quadratic polynomial

Published on 24 Jun 2019 - 1:39

score 227 · Answer 10 · 2019-07-01 21:17:29

227

Views

How to formally prove that index renaming doesn’t change sum

Published on 01 Jul 2019 - 21:17

score 262 · Answer 11 · 2019-07-03 09:27:01

262

Views

How can we express "induction is the same as recursion", formally?

Published on 03 Jul 2019 - 9:27

score 448 · Answer 12 · 2026-03-23 01:16:10

448

Views

Showcases of formalized mathematics in a system like Coq or Lean?

Published on 23 Mar 2026 - 1:16

score 499 · Answer 13 · 2026-03-22 20:05:57

499

Views

Why typeclasses rather than inductive types to define mathematical structures in Lean?

Published on 22 Mar 2026 - 20:05

score 152 · Answer 14 · 2019-07-14 22:12:43

152

Views

Deduction of $\forall x(\neg p(x)\rightarrow q(x)), \forall z(p(z)\rightarrow r(z))\vdash \forall z(\neg r(z) \rightarrow\exists yq(y))$

Published on 14 Jul 2019 - 22:12

score 67 · Answer 15 · 2019-08-08 18:13:08

67

Views

Are two proofs better than one?

Published on 08 Aug 2019 - 18:13

List Question

What is the name of the rule that allows us to infer the truth of an equation from the truth of another equation?

How do I formally prove a universal implication?

Understanding ex falso quodlibet together with proof by contradiction in a Gentzen style ND Proof

Could provide some further detail about this step in a proof

Show that $ \forall{x}\exists{y}{(P(x) \to Q(y))} \vdash \exists{y}\forall{x}{(P(x) \to Q(y))} $

Proof logical statement with interference rules

Trying to understand the difference between metatheory and theory and circularity

Question on how to prove an expression satisfies a quadratic equation

Verification of proof on repeated root for a quadratic polynomial

How to formally prove that index renaming doesn’t change sum

How can we express "induction is the same as recursion", formally?

Showcases of formalized mathematics in a system like Coq or Lean?

Why typeclasses rather than inductive types to define mathematical structures in Lean?

Deduction of $\forall x(\neg p(x)\rightarrow q(x)), \forall z(p(z)\rightarrow r(z))\vdash \forall z(\neg r(z) \rightarrow\exists yq(y))$

Are two proofs better than one?

Trending Questions

Popular # Hahtags

Popular Questions