Question

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

score 1.2k · Answer 1 · 2026-02-23 01:21:13

1.2k

Views

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

Published on 23 Feb 2026 - 1:21

score 106 · Answer 2 · 2018-11-19 20:17:10

106

Views

Equipping a set with an abstract notion of computability

Published on 19 Nov 2018 - 20:17

score 451 · Answer 3 · 2018-11-20 07:37:05

451

Views

Is the inverse busy beaver calculable?

Published on 20 Nov 2018 - 7:37

score 96 · Answer 4 · 2026-02-23 01:23:33

96

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 23 Feb 2026 - 1:23

score 29 · Answer 5 · 2018-11-24 18:21:42

29

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 24 Nov 2018 - 18:21

score 187 · Answer 6 · 2018-11-25 20:55:45

187

Views

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

Published on 25 Nov 2018 - 20:55

score 2.5k · Answer 7 · 2026-02-23 01:21:41

2.5k

Views

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

Published on 23 Feb 2026 - 1:21

score 131 · Answer 8 · 2018-11-30 16:01:11

131

Views

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

Published on 30 Nov 2018 - 16:01

score 585 · Answer 9 · 2018-11-30 16:58:10

585

Views

What is the difference between computably generated and computable?

Published on 30 Nov 2018 - 16:58

score 210 · Answer 10 · 2018-12-01 03:03:54

210

Views

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

Published on 01 Dec 2018 - 3:03

score 157 · Answer 11 · 2018-12-03 18:36:59

157

Views

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

Published on 03 Dec 2018 - 18:36

score 423 · Answer 12 · 2026-03-23 13:21:30

423

Views

Set that is recursively enumerable but is NOT decidable

Published on 23 Mar 2026 - 13:21

score 92 · Answer 13 · 2018-12-08 19:36:57

92

Views

Can you have indirect memory addressing in primitive recursive functions?

Published on 08 Dec 2018 - 19:36

score 87 · Answer 14 · 2018-12-08 20:26:55

87

Views

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

Published on 08 Dec 2018 - 20:26

score 166 · Answer 15 · 2018-12-10 15:38:19

166

Views

Does every nonzero Turing degree adimit a nonzero incompatible degree?

Published on 10 Dec 2018 - 15:38

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