Question

Question about a proof of Gödel's 1st incompleteness theorem

score 63 · Answer 1 · 2020-12-02 13:47:50

63

Views

Question about a proof of Gödel's 1st incompleteness theorem

Published on 02 Dec 2020 - 13:47

score 155 · Answer 2 · 2026-03-26 12:46:58

155

Views

Godel Escher Bach: Why is a Godel proof-pair representable in TNT?

Published on 26 Mar 2026 - 12:46

score 227 · Answer 3 · 2026-02-23 22:53:35

227

Views

Peano Arithmetic - Decidability

Published on 23 Feb 2026 - 22:53

score 81 · Answer 4 · 2020-12-26 01:00:30

81

Views

Existence of proof of consistency of stronger axiomatic systems

Published on 26 Dec 2020 - 1:00

score 305 · Answer 5 · 2026-03-25 12:28:06

305

Views

In what formal system is Godel's Incompleteness Theorem (or similar statements of undecidability) proven?

Published on 25 Mar 2026 - 12:28

score 89 · Answer 6 · 2026-03-28 15:46:02

89

Views

How does Ramsey Theory relate to Godel Incompleteness theorem?

Published on 28 Mar 2026 - 15:46

score 100 · Answer 7 · 2020-12-27 22:21:17

100

Views

Why doesn't the Continuum Hypothesis show that $\text{ZFC}$ is simply consistent?

Published on 27 Dec 2020 - 22:21

score 123 · Answer 8 · 2026-03-26 20:41:58

123

Views

Can the existence of some positive integers satisfying some equations ever be independent of ZFC?

Published on 26 Mar 2026 - 20:41

score 186 · Answer 9 · 2021-01-17 19:34:19

186

Views

On the Possibility of Godel Numbering

Published on 17 Jan 2021 - 19:34

score 58 · Answer 10 · 2021-01-20 20:15:54

58

Views

Can a finite Turing machine model itself?

Published on 20 Jan 2021 - 20:15

score 71 · Answer 11 · 2021-01-28 00:53:20

71

Views

Showing that formulae which are provably $Σ_n$ and $Π_n$ ($n > 0$) in the arithmetical hierarchy are closed under $∃$ and $∀$ respectively

Published on 28 Jan 2021 - 0:53

score 452 · Answer 12 · 2021-02-09 15:19:53

452

Views

Is there any way to avoid Gödel incompleteness theorem?

Published on 09 Feb 2021 - 15:19

score 148 · Answer 13 · 2021-02-11 11:51:45

148

Views

Prove that ever $\Sigma_0$ sentence is provable from PA (Peano Arithmetic, with exponentiation)

Published on 11 Feb 2021 - 11:51

score 54 · Answer 14 · 2021-02-12 00:11:41

54

Views

Proving a result similar to the diagonal lemma/fixed-point theorem

Published on 12 Feb 2021 - 0:11

score 29 · Answer 15 · 2021-02-12 00:41:30

29

Views

Proving $PAE ⊢ (Pr_S(\#(X → Y)) → (Pr_S(\#(X)) → Pr_S(\#(Y))))$, where $Pr_S(n)$ holds iff $n$ is the Gödel number of a formula provable from $S$

Published on 12 Feb 2021 - 0:41

List Question

Question about a proof of Gödel's 1st incompleteness theorem

Godel Escher Bach: Why is a Godel proof-pair representable in TNT?

Peano Arithmetic - Decidability

Existence of proof of consistency of stronger axiomatic systems

In what formal system is Godel's Incompleteness Theorem (or similar statements of undecidability) proven?

How does Ramsey Theory relate to Godel Incompleteness theorem?

Why doesn't the Continuum Hypothesis show that $\text{ZFC}$ is simply consistent?

Can the existence of some positive integers satisfying some equations ever be independent of ZFC?

On the Possibility of Godel Numbering

Can a finite Turing machine model itself?

Showing that formulae which are provably $Σ_n$ and $Π_n$ ($n > 0$) in the arithmetical hierarchy are closed under $∃$ and $∀$ respectively

Is there any way to avoid Gödel incompleteness theorem?

Prove that ever $\Sigma_0$ sentence is provable from PA (Peano Arithmetic, with exponentiation)

Proving a result similar to the diagonal lemma/fixed-point theorem

Proving $PAE ⊢ (Pr_S(\#(X → Y)) → (Pr_S(\#(X)) → Pr_S(\#(Y))))$, where $Pr_S(n)$ holds iff $n$ is the Gödel number of a formula provable from $S$

Trending Questions

Popular # Hahtags

Popular Questions