Question

$\textbf{Q}$ fails to prove some correct $\forall$-rudimentary sentence

score 457 · Answer 1 · 2014-04-12 18:31:33

457

Views

$\textbf{Q}$ fails to prove some correct $\forall$-rudimentary sentence

Published on 12 Apr 2014 - 18:31

score 140 · Answer 2 · 2014-04-15 17:12:03

140

Views

Let A, B be infinite recursive sets with infinite complements. Show that A≡B.

Published on 15 Apr 2014 - 17:12

score 42 · Answer 3 · 2014-04-16 19:47:42

42

Views

Not every polynomial in $\Bbb{Z}_p[x]$ can be factored, but can you do next best?

Published on 16 Apr 2014 - 19:47

score 373 · Answer 4 · 2014-04-17 16:59:03

373

Views

Having trouble understanding Cantors proof that real numbers are uncountable

Published on 17 Apr 2014 - 16:59

score 152 · Answer 5 · 2014-04-18 16:52:51

152

Views

Are all polynomial-bounded functions computable?

Published on 18 Apr 2014 - 16:52

score 525 · Answer 6 · 2026-03-26 08:04:29

525

Views

How can the Gödel sentence be Pi_1

Published on 26 Mar 2026 - 8:04

score 210 · Answer 7 · 2014-04-21 13:56:09

210

Views

Clarification of the argument for the set of total recursive functions not being recursively enumerable?

Published on 21 Apr 2014 - 13:56

score 361 · Answer 8 · 2026-03-25 20:36:25

361

Views

How does undecidability of 'theoremhood' imply that human ingenuity is necessary in mathematics?

Published on 25 Mar 2026 - 20:36

score 152 · Answer 9 · 2014-04-24 13:58:12

152

Views

Showing the class of all recursive sets is recursively enumerable.

Published on 24 Apr 2014 - 13:58

score 120 · Answer 10 · 2026-03-25 21:46:23

120

Views

Constructive fixed-point theorems where finite iteration yields the fixed point

Published on 25 Mar 2026 - 21:46

score 57 · Answer 11 · 2014-04-26 19:33:33

57

Views

Show $f(x)$ is partial recursive using the

Published on 26 Apr 2014 - 19:33

score 269 · Answer 12 · 2014-04-26 19:57:09

269

Views

Diagonalization out of partial recursive functions

Published on 26 Apr 2014 - 19:57

score 61 · Answer 13 · 2014-04-27 04:24:23

61

Views

How can I identify that an instance of Boolean SAT problem remains hard or not?

Published on 27 Apr 2014 - 4:24

score 190 · Answer 14 · 2014-04-29 00:25:47

190

Views

Turing degrees of models of ZFC and naming big numbers

Published on 29 Apr 2014 - 0:25

score 111 · Answer 15 · 2014-05-02 02:22:31

111

Views

Are computable functions closed under "less than"?

Published on 02 May 2014 - 2:22

List Question

$\textbf{Q}$ fails to prove some correct $\forall$-rudimentary sentence

Let A, B be infinite recursive sets with infinite complements. Show that A≡B.

Not every polynomial in $\Bbb{Z}_p[x]$ can be factored, but can you do next best?

Having trouble understanding Cantors proof that real numbers are uncountable

Are all polynomial-bounded functions computable?

How can the Gödel sentence be Pi_1

Clarification of the argument for the set of total recursive functions not being recursively enumerable?

How does undecidability of 'theoremhood' imply that human ingenuity is necessary in mathematics?

Showing the class of all recursive sets is recursively enumerable.

Constructive fixed-point theorems where finite iteration yields the fixed point

Show $f(x)$ is partial recursive using the

Diagonalization out of partial recursive functions

How can I identify that an instance of Boolean SAT problem remains hard or not?

Turing degrees of models of ZFC and naming big numbers

Are computable functions closed under "less than"?

Trending Questions

Popular # Hahtags

Popular Questions