Question

Does having many models yield complex second-order theories?

score 145 · Answer 1 · 2020-05-04 16:37:20

145

Views

Does having many models yield complex second-order theories?

Published on 04 May 2020 - 16:37

score 298 · Answer 2 · 2020-05-04 21:00:26

298

Views

Show that the index set of this set of partial computable functions is not computably enumerable

Published on 04 May 2020 - 21:00

score 228 · Answer 3 · 2026-02-23 08:31:48

228

Views

Is Halting problem an example of a problem which is true but unprovable?

Published on 23 Feb 2026 - 8:31

score 28 · Answer 4 · 2020-05-06 13:51:59

28

Views

How to do the integral part of logarthm with minimizer?

Published on 06 May 2020 - 13:51

score 114 · Answer 5 · 2020-05-07 02:37:53

114

Views

Can the computability of a specific function be independent of ZFC?

Published on 07 May 2020 - 2:37

score 240 · Answer 6 · 2026-03-26 07:33:33

240

Views

Is it true that computability = constructivism + law of excluded middle?

Published on 26 Mar 2026 - 7:33

score 194 · Answer 7 · 2026-03-26 09:45:40

194

Views

What does "forcing an open set" mean?

Published on 26 Mar 2026 - 9:45

score 71 · Answer 8 · 2020-05-08 20:27:04

71

Views

Difficulty with definition of function

Published on 08 May 2020 - 20:27

score 128 · Answer 9 · 2026-03-27 23:35:53

128

Views

Turing degrees of subsets of Kleene $\mathcal{O}$ which are ordinal notations of subsets of the set of recursive ordinals

Published on 27 Mar 2026 - 23:35

score 184 · Answer 10 · 2026-03-28 05:38:59

184

Views

Is this a proper recursive ordinal notation for ordinals < $\omega^2$?

Published on 28 Mar 2026 - 5:38

score 132 · Answer 11 · 2020-05-11 16:06:12

132

Views

Recursive set that many-to-one reduces to a non recursive set

Published on 11 May 2020 - 16:06

score 163 · Answer 12 · 2020-05-12 12:31:27

163

Views

Prove that two sets recursively inseparable.

Published on 12 May 2020 - 12:31

score 70 · Answer 13 · 2020-05-12 19:39:51

Is the halting problem an example of a paradox that arises under vary specific conditions (like a division by zero,) or is it more general than that?

score 313 · Answer 14 · 2020-05-13 07:40:12

313

Views

Defining Partial Recursive Functions with their indices

Published on 13 May 2020 - 7:40

score 41 · Answer 15 · 2020-05-13 14:35:21

41

Views

Is a halting problem oracle to itself possible if randomness exist?

Published on 13 May 2020 - 14:35

List Question

Does having many models yield complex second-order theories?

Show that the index set of this set of partial computable functions is not computably enumerable

Is Halting problem an example of a problem which is true but unprovable?

How to do the integral part of logarthm with minimizer?

Can the computability of a specific function be independent of ZFC?

Is it true that computability = constructivism + law of excluded middle?

What does "forcing an open set" mean?

Difficulty with definition of function

Turing degrees of subsets of Kleene $\mathcal{O}$ which are ordinal notations of subsets of the set of recursive ordinals

Is this a proper recursive ordinal notation for ordinals < $\omega^2$?

Recursive set that many-to-one reduces to a non recursive set

Prove that two sets recursively inseparable.

Is the halting problem an example of a paradox that arises under vary specific conditions (like a division by zero,) or is it more general than that?

Defining Partial Recursive Functions with their indices

Is a halting problem oracle to itself possible if randomness exist?

Trending Questions

Popular # Hahtags

Popular Questions