User Peter Gerdes

1 vote

Harrington's notes on McLaughlin/Arithmetically incomparable singletons

answered Aug 11, 2023 at 8:04

1 vote

A $\Pi^0_1$ class of $\alpha$-subgenerics for all $\alpha < w_1^{CK}$

answered Aug 31, 2023 at 20:57

1 vote

Is $0^{(\omega)}$ a minimal cover in the arithmetic degrees

answered Apr 26, 2023 at 8:09

1 vote

Jump Inversion of Arithmetic

answered Jul 14, 2020 at 17:01

1 vote

Axiomatizable $\exists \forall$ theory

answered May 16, 2018 at 12:16

0 votes

Accepted

Generality of construction for $\omega$-REA arithmetic degrees

answered Dec 11, 2020 at 9:39

0 votes

Do "seemingly impossible functional programs" work with arrow types interpreted as Turing machines?

answered May 4, 2019 at 7:37

0 votes

Accepted

Computable in $\omega$-REA degree but not double jump of finitely many columns

answered Jan 18, 2021 at 8:28

0 votes

Accepted

Arithmetic non-trivial 2-l.u.b

answered Jan 18, 2021 at 10:35

0 votes

Accepted

Cite for fact that every r.e. degree bounds a 1-generic

answered Nov 15, 2022 at 4:06

0 votes

Theorems that are essentially impossible to guess by empirical observation

answered Jan 1, 2022 at 15:38

Stack Exchange Network

41 Answers

Harrington's notes on McLaughlin/Arithmetically incomparable singletons

A $\Pi^0_1$ class of $\alpha$-subgenerics for all $\alpha < w_1^{CK}$

Is $0^{(\omega)}$ a minimal cover in the arithmetic degrees

Jump Inversion of Arithmetic

Axiomatizable $\exists \forall$ theory

Generality of construction for $\omega$-REA arithmetic degrees

Do "seemingly impossible functional programs" work with arrow types interpreted as Turing machines?

Computable in $\omega$-REA degree but not double jump of finitely many columns

Arithmetic non-trivial 2-l.u.b

Cite for fact that every r.e. degree bounds a 1-generic

Theorems that are essentially impossible to guess by empirical observation