User Peter Gerdes

6 votes

Reference for a "recursive" fragment of infinitary logic?

answered Jun 27, 2012 at 22:06

5 votes

Peer review 2.0

answered May 31, 2021 at 0:32

5 votes

Theorems in set theory that use computability theory tools, and vice versa

answered Apr 18, 2023 at 22:24

5 votes

What do we gain with higher order logics?

answered Sep 4 at 7:40

4 votes

Meta-incomputability

answered Jan 5, 2019 at 9:36

3 votes

On independence and large cardinal strength of physical statements

answered Nov 19, 2017 at 8:14

3 votes

On Applications of Forcing in Domain Theory

answered Jun 24, 2018 at 20:12

2 votes

Defining computable functions categorically

answered May 16, 2018 at 13:30

2 votes

Proof of the existence of hyperimmune-free degrees

answered Jan 12, 2013 at 9:12

2 votes

Notion of independence of Turing degrees

answered Jan 12, 2013 at 11:33

2 votes

How should the Math Subject Classification (MSC) be revised or improved?

answered Jul 25, 2016 at 17:46

2 votes

Accepted

Proving things about a formal logical system

answered Dec 2, 2020 at 22:04

2 votes

Digital pen for math: your experiences?

answered Feb 16, 2020 at 0:23

2 votes

Accepted

Does degree of jump determine degrees of relatively r.e. sets?

answered Jul 10, 2020 at 17:57

2 votes

Cupping and capping for 0’ relative to a recursively enumerable set

answered Jul 13, 2020 at 16:01

2 votes

Accepted

Does every arithmetic degree below $0^\omega$ have a representative computable in $0^\omega$?

answered Apr 19, 2023 at 16:17

2 votes

Accepted

Double Hop Inversion Theorem

answered Apr 21, 2023 at 19:54

2 votes

Double Posner-Robinson Join (or a cupping analog of minimal pair)

answered Apr 28, 2023 at 19:14

2 votes

How to use Manuel Lerman's framework of priority method as blackbox?

answered Oct 13, 2021 at 1:03

2 votes

Accepted

Is adding all sentences true of terms in skolemized theory conservative?

answered Oct 13, 2021 at 16:33

2 votes

Construction of models for true but unprovable formulas

answered May 11, 2022 at 4:39

2 votes

Accepted

If $X \leq_T Y + 0'$ does there exist $Z \leq_T Y$, $Z \leq_T X$ with $X \leq_T Z'$?

answered May 24, 2022 at 23:20

2 votes

Incompatible degrees $a,b$ s.t. $x < a$ implies $x \leq b$

answered Mar 15, 2023 at 2:35

2 votes

Accepted

Arithmetically-hyperimmune-free degrees are comeager

answered Mar 27, 2023 at 15:56

2 votes

Hyperarithmetically least elements in $\Pi^1_1$ sets

answered Dec 1, 2023 at 8:13

1 vote

Can this naïve-like set theory using acyclic membership be consistent?

answered Jan 9, 2022 at 19:30

1 vote

Properties of all relatively computable branches

answered Oct 4 at 3:04

1 vote

Accepted

Is set of the indices of c.e.sets that cover a productive set also productive one?

answered Oct 13, 2021 at 2:28

1 vote

Finding 1-generic paths through a tree $T \subseteq 2^{<\omega}$

answered Dec 11, 2020 at 16:21

1 vote

Accepted

Effectively non-arithmetic $\omega$-REA degrees

answered May 4, 2023 at 9:16

Stack Exchange Network

41 Answers

Reference for a "recursive" fragment of infinitary logic?

Peer review 2.0

Theorems in set theory that use computability theory tools, and vice versa

What do we gain with higher order logics?

Meta-incomputability

On independence and large cardinal strength of physical statements

On Applications of Forcing in Domain Theory

Defining computable functions categorically

Proof of the existence of hyperimmune-free degrees

Notion of independence of Turing degrees

How should the Math Subject Classification (MSC) be revised or improved?

Proving things about a formal logical system

Digital pen for math: your experiences?

Does degree of jump determine degrees of relatively r.e. sets?

Cupping and capping for 0’ relative to a recursively enumerable set

Does every arithmetic degree below $0^\omega$ have a representative computable in $0^\omega$?

Double Hop Inversion Theorem

Double Posner-Robinson Join (or a cupping analog of minimal pair)

How to use Manuel Lerman's framework of priority method as blackbox?

Is adding all sentences true of terms in skolemized theory conservative?

Construction of models for true but unprovable formulas

If $X \leq_T Y + 0'$ does there exist $Z \leq_T Y$, $Z \leq_T X$ with $X \leq_T Z'$?

Incompatible degrees $a,b$ s.t. $x < a$ implies $x \leq b$

Arithmetically-hyperimmune-free degrees are comeager

Hyperarithmetically least elements in $\Pi^1_1$ sets

Can this naïve-like set theory using acyclic membership be consistent?

Properties of all relatively computable branches

Is set of the indices of c.e.sets that cover a productive set also productive one?

Finding 1-generic paths through a tree $T \subseteq 2^{<\omega}$

Effectively non-arithmetic $\omega$-REA degrees