Question

"Exists X | P(X)" holds but for no X does P(X) hold

score 59 · Answer 1 · 2019-05-24 03:24:17

59

Views

"Exists X | P(X)" holds but for no X does P(X) hold

Published on 24 May 2019 - 3:24

score 464 · Answer 2 · 2026-02-23 06:38:41

464

Views

Why is the left-intro rule in Sequent Calculus equivalent to elimination rule in Natural Deduction?

Published on 23 Feb 2026 - 6:38

score 182 · Answer 3 · 2026-03-25 10:23:40

182

Views

is there some statement equivalent to consistency of $ZFC$ in $ZFC$?

Published on 25 Mar 2026 - 10:23

score 1.3k · Answer 4 · 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 264 · Answer 5 · 2019-06-02 15:04:33

264

Views

Proof of consistency of proof system syntactically.

Published on 02 Jun 2019 - 15:04

score 1.5k · Answer 6 · 2026-03-25 13:59:06

1.5k

Views

Natural Deduction Proof for Modus Tollens

Published on 25 Mar 2026 - 13:59

score 381 · Answer 7 · 2026-03-25 13:59:51

381

Views

Natural Deduction: Universal Introduction rule concerning free variables in Van Dalen's "Logic and Structure"

Published on 25 Mar 2026 - 13:59

score 585 · Answer 8 · 2019-06-10 12:27:39

585

Views

Why does the Curry-Howard correspondence exist?

Published on 10 Jun 2019 - 12:27

score 182 · Answer 9 · 2019-06-21 03:51:16

182

Views

Cut elimination proofs of the consistency of arithmetic

Published on 21 Jun 2019 - 3:51

score 55 · Answer 10 · 2019-06-28 15:24:45

55

Views

A structure interpreting a binary function symbol as average can't have $\mathbb{N}$ as its domain?

Published on 28 Jun 2019 - 15:24

score 162 · Answer 11 · 2019-07-05 18:54:34

162

Views

Prove or disprove a claim about sentences in first order logic

Published on 05 Jul 2019 - 18:54

score 139 · Answer 12 · 2026-03-25 06:10:47

139

Views

Doesn't cut elimination make intuitionistic logic equivalent to classical logic?

Published on 25 Mar 2026 - 6:10

score 83 · Answer 13 · 2019-07-12 15:19:40

83

Views

How to show conservative extension without resorting to model theory?

Published on 12 Jul 2019 - 15:19

score 107 · Answer 14 · 2019-07-16 21:04:16

107

Views

Proofs including computer checking for "small" numbers

Published on 16 Jul 2019 - 21:04

score 64 · Answer 15 · 2026-03-25 07:48:46

64

Views

What is an example of a simple formal language that allows to write a complete proof that a particular Turing machine halts?

Published on 25 Mar 2026 - 7:48

List Question

"Exists X | P(X)" holds but for no X does P(X) hold

Why is the left-intro rule in Sequent Calculus equivalent to elimination rule in Natural Deduction?

is there some statement equivalent to consistency of $ZFC$ in $ZFC$?

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

Proof of consistency of proof system syntactically.

Natural Deduction Proof for Modus Tollens

Natural Deduction: Universal Introduction rule concerning free variables in Van Dalen's "Logic and Structure"

Why does the Curry-Howard correspondence exist?

Cut elimination proofs of the consistency of arithmetic

A structure interpreting a binary function symbol as average can't have $\mathbb{N}$ as its domain?

Prove or disprove a claim about sentences in first order logic

Doesn't cut elimination make intuitionistic logic equivalent to classical logic?

How to show conservative extension without resorting to model theory?

Proofs including computer checking for "small" numbers

What is an example of a simple formal language that allows to write a complete proof that a particular Turing machine halts?

Trending Questions

Popular # Hahtags

Popular Questions