Question

Dan Willard's self-verifying theories can escape Gödel's second incompleteness theorem. But can they escape the first?

score 201 · Answer 1 · 2023-05-05 06:03:28

201

Views

Dan Willard's self-verifying theories can escape Gödel's second incompleteness theorem. But can they escape the first?

Published on 05 May 2023 - 6:03

score 78 · Answer 2 · 2026-03-27 02:08:27

78

Views

Function that can be computed by two distinct Turing machines

Published on 27 Mar 2026 - 2:08

score 62 · Answer 3 · 2023-05-10 01:31:01

62

Views

Regular set theorems under $V=L$

Published on 10 May 2023 - 1:31

score 69 · Answer 4 · 2026-03-25 10:56:59

69

Views

Understanding the system $\textbf{ACA}_0'$ and and exercise $6.26$ of Hirschfeldt

Published on 25 Mar 2026 - 10:56

score 84 · Answer 5 · 2026-03-26 18:59:50

84

Views

Is the sublanguage immune from Gödel theorem

Published on 26 Mar 2026 - 18:59

score 170 · Answer 6 · 2026-03-26 18:58:54

170

Views

Prove the Gödel theorem using the Busy Beaver function

Published on 26 Mar 2026 - 18:58

score 21 · Answer 7 · 2026-03-28 14:53:36

21

Views

Effective computability of non-linear optimization algorithms

Published on 28 Mar 2026 - 14:53

score 121 · Answer 8 · 2023-05-15 21:44:18

121

Views

Are these proofs of two Halting Problems rigorous?

Published on 15 May 2023 - 21:44

score 49 · Answer 9 · 2026-03-27 02:01:11

49

Views

Computable Enumerability Definition Confusion

Published on 27 Mar 2026 - 2:01

score 67 · Answer 10 · 2026-03-25 10:55:50

67

Views

Is the range of a total $\Pi^1_1$ function $\Delta^1_1$?

Published on 25 Mar 2026 - 10:55

score 100 · Answer 11 · 2026-02-23 12:00:21

100

Views

Undecidable difference of decidable sets.

Published on 23 Feb 2026 - 12:00

score 95 · Answer 12 · 2026-03-27 02:07:43

95

Views

Transitivity of Turing reduction

Published on 27 Mar 2026 - 2:07

score 102 · Answer 13 · 2026-03-26 20:44:10

102

Views

Who is the "$\Pi_2$-soundness" version of the first incompleteness theorem due to?

Published on 26 Mar 2026 - 20:44

score 91 · Answer 14 · 2026-03-26 21:09:31

91

Views

What are the order types of computable pseudo-ordinals with no c.e. descending chains?

Published on 26 Mar 2026 - 21:09

score 115 · Answer 15 · 2026-03-26 06:25:30

115

Views

Prove projection of a computable function is computable without using Church-Turing Thesis

Published on 26 Mar 2026 - 6:25

List Question

Dan Willard's self-verifying theories can escape Gödel's second incompleteness theorem. But can they escape the first?

Function that can be computed by two distinct Turing machines

Regular set theorems under $V=L$

Understanding the system $\textbf{ACA}_0'$ and and exercise $6.26$ of Hirschfeldt

Is the sublanguage immune from Gödel theorem

Prove the Gödel theorem using the Busy Beaver function

Effective computability of non-linear optimization algorithms

Are these proofs of two Halting Problems rigorous?

Computable Enumerability Definition Confusion

Is the range of a total $\Pi^1_1$ function $\Delta^1_1$?

Undecidable difference of decidable sets.

Transitivity of Turing reduction

Who is the "$\Pi_2$-soundness" version of the first incompleteness theorem due to?

What are the order types of computable pseudo-ordinals with no c.e. descending chains?

Prove projection of a computable function is computable without using Church-Turing Thesis

Trending Questions

Popular # Hahtags

Popular Questions