Question

Gödel's completeness theorem and the undecidability of first-order logic

score 1.2k · Answer 1 · 2026-04-09 04:13:09

1.2k

Views

Gödel's completeness theorem and the undecidability of first-order logic

Published on 09 Apr 2026 - 4:13

score 109 · Answer 2 · 2026-04-10 20:14:46

109

Views

Equipping a set with an abstract notion of computability

Published on 10 Apr 2026 - 20:14

score 454 · Answer 3 · 2026-04-13 05:15:47

454

Views

Is the inverse busy beaver calculable?

Published on 13 Apr 2026 - 5:15

score 97 · Answer 4 · 2026-04-09 04:15:02

97

Views

Proving the diagonalization of $U \subset \mathbb{N} \times \mathbb{N}$ that is an universal set for all enumerable sets of naturals is undecidable

Published on 09 Apr 2026 - 4:15

score 32 · Answer 5 · 2026-04-15 20:42:39

32

Views

Why is $F(a,b) = G(a,b, \bar F (a,b) )$ unique if $\bar F (a,b)$ is a sequence number applied to each element of a sequence?

Published on 15 Apr 2026 - 20:42

score 189 · Answer 6 · 2026-04-15 23:38:24

189

Views

Proving an infinite set not having any infinite decidable subsets is immune

Published on 15 Apr 2026 - 23:38

score 2.5k · Answer 7 · 2026-04-09 04:14:20

2.5k

Views

Example of incomplete, but decidable theory, and of complete and undecidable theory, question

Published on 09 Apr 2026 - 4:14

score 134 · Answer 8 · 2026-04-12 01:23:07

134

Views

How does one show that the Godel number of $L-$terms are computable?

Published on 12 Apr 2026 - 1:23

score 588 · Answer 9 · 2026-04-09 06:08:09

588

Views

What is the difference between computably generated and computable?

Published on 09 Apr 2026 - 6:08

score 213 · Answer 10 · 2026-04-14 21:11:32

213

Views

What does it mean for a set of L-sentences $\Sigma$ to be computable?

Published on 14 Apr 2026 - 21:11

score 160 · Answer 11 · 2026-04-16 12:20:21

160

Views

Prove the index of the sum of any two computable numbers is computable

Published on 16 Apr 2026 - 12:20

score 424 · Answer 12 · 2026-03-25 20:35:27

424

Views

Set that is recursively enumerable but is NOT decidable

Published on 25 Mar 2026 - 20:35

score 95 · Answer 13 · 2026-04-12 02:07:11

95

Views

Can you have indirect memory addressing in primitive recursive functions?

Published on 12 Apr 2026 - 2:07

score 90 · Answer 14 · 2026-04-13 10:42:26

90

Views

Is there a partial recursive function mapping $e$ to the least element of $W_e$?

Published on 13 Apr 2026 - 10:42

score 168 · Answer 15 · 2026-04-10 04:26:58

168

Views

Does every nonzero Turing degree adimit a nonzero incompatible degree?

Published on 10 Apr 2026 - 4:26

List Question

Gödel's completeness theorem and the undecidability of first-order logic

Equipping a set with an abstract notion of computability

Is the inverse busy beaver calculable?

Proving the diagonalization of $U \subset \mathbb{N} \times \mathbb{N}$ that is an universal set for all enumerable sets of naturals is undecidable

Why is $F(a,b) = G(a,b, \bar F (a,b) )$ unique if $\bar F (a,b)$ is a sequence number applied to each element of a sequence?

Proving an infinite set not having any infinite decidable subsets is immune

Example of incomplete, but decidable theory, and of complete and undecidable theory, question

How does one show that the Godel number of $L-$terms are computable?

What is the difference between computably generated and computable?

What does it mean for a set of L-sentences $\Sigma$ to be computable?

Prove the index of the sum of any two computable numbers is computable

Set that is recursively enumerable but is NOT decidable

Can you have indirect memory addressing in primitive recursive functions?

Is there a partial recursive function mapping $e$ to the least element of $W_e$?

Does every nonzero Turing degree adimit a nonzero incompatible degree?

Trending Questions

Popular # Hahtags

Popular Questions