Question

$A$ is without quantifiers and $\exists_xA$ is valid then for Herbrand structure $H$ there is a closed term $t$ that $H \vdash A \{t/x \}$

score 32 · Answer 1 · 2019-07-18 17:42:05

32

Views

$A$ is without quantifiers and $\exists_xA$ is valid then for Herbrand structure $H$ there is a closed term $t$ that $H \vdash A \{t/x \}$

Published on 18 Jul 2019 - 17:42

score 134 · Answer 2 · 2019-07-29 03:39:50

134

Views

Assuming that an arbitrary Infinite Time Turing Machine halts, is it possible to have a finite proof of the fact that it halts?

Published on 29 Jul 2019 - 3:39

score 2.1k · Answer 3 · 2019-08-04 19:26:51

2.1k

Views

Gödel's paradox: Why is "a proof that some universal statement is unprovable" not a valid proof that this statement is true?

Published on 04 Aug 2019 - 19:26

score 270 · Answer 4 · 2019-08-18 15:22:13

270

Views

Prove that this determinant equals zero

Published on 18 Aug 2019 - 15:22

score 47 · Answer 5 · 2019-08-21 09:05:12

47

Views

It is possible to calculate this probability

Published on 21 Aug 2019 - 9:05

score 88 · Answer 6 · 2026-03-25 06:05:26

88

Views

Is the distribution axiom in the modal system K an equivalence?

Published on 25 Mar 2026 - 6:05

score 1.4k · Answer 7 · 2019-08-30 10:07:01

1.4k

Views

What does it mean for something to be true but unprovable?

Published on 30 Aug 2019 - 10:07

score 140 · Answer 8 · 2026-03-24 23:42:38

140

Views

Strongest tools to detect unsoundness

Published on 24 Mar 2026 - 23:42

score 60 · Answer 9 · 2014-04-06 15:13:59

60

Views

How to prove an inequality

Published on 06 Apr 2014 - 15:13

score 63 · Answer 10 · 2014-04-14 00:05:48

63

Views

How to prove $\sum\limits_{k=0}^n\ (3k^2+2k+1) = n^3 + 5 \begin{pmatrix}n+1\\2\end{pmatrix}+1$

Published on 14 Apr 2014 - 0:05

score 536 · Answer 11 · 2014-05-22 23:46:11

536

Views

can it be proven that something is "difficult" (prime factoring for example)

Published on 22 May 2014 - 23:46

score 2.1k · Answer 12 · 2014-06-22 07:18:05

2.1k

Views

Is Riemann Hypothesis provable?

Published on 22 Jun 2014 - 7:18

score 310 · Answer 13 · 2014-07-04 18:42:07

310

Views

What are techniques for proving undecidability or unprovability of a sentence?

Published on 04 Jul 2014 - 18:42

score 1.9k · Answer 14 · 2026-03-25 06:06:42

1.9k

Views

how to prove : there are an infinite number of points on the circle

Published on 25 Mar 2026 - 6:06

score 1.7k · Answer 15 · 2014-09-15 13:08:19

1.7k

Views

Can unprovability unprovable? Is there an $\omega$-fold unprovability?

Published on 15 Sep 2014 - 13:08

List Question

$A$ is without quantifiers and $\exists_xA$ is valid then for Herbrand structure $H$ there is a closed term $t$ that $H \vdash A \{t/x \}$

Assuming that an arbitrary Infinite Time Turing Machine halts, is it possible to have a finite proof of the fact that it halts?

Gödel's paradox: Why is "a proof that some universal statement is unprovable" not a valid proof that this statement is true?

Prove that this determinant equals zero

It is possible to calculate this probability

Is the distribution axiom in the modal system K an equivalence?

What does it mean for something to be true but unprovable?

Strongest tools to detect unsoundness

How to prove an inequality

How to prove $\sum\limits_{k=0}^n\ (3k^2+2k+1) = n^3 + 5 \begin{pmatrix}n+1\\2\end{pmatrix}+1$

can it be proven that something is "difficult" (prime factoring for example)

Is Riemann Hypothesis provable?

What are techniques for proving undecidability or unprovability of a sentence?

how to prove : there are an infinite number of points on the circle

Can unprovability unprovable? Is there an $\omega$-fold unprovability?

Trending Questions

Popular # Hahtags

Popular Questions