Skip to main content

All Questions

6 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
9 votes
0 answers
279 views

What logic characterizes relative intrinsic complexity in set recursion?

Short version: Is there an analogue of the Ash-Knight-Manasse-Slaman/Chisholm theorem for $E$-recursion? Long version: I'm interested in "$E$-recursive structure theory," but it's not ...
Noah Schweber's user avatar
7 votes
0 answers
304 views

Which countable ordinals are "Barwise compact" for $\mathcal{L}_{\infty,\omega_1}$?

Barwise compactness says (as a special case) that whenever $\alpha$ is countable and admissible, $T\subseteq\mathcal{L}_{\infty,\omega}\cap L_\alpha$ is $\alpha$-c.e., and every subset of $T$ which is ...
Noah Schweber's user avatar
6 votes
0 answers
207 views

Fragments of infinitary logic with a weak definability property

For a countable admissible ordinal $\alpha$, let $\mathcal{L}_\alpha=\mathcal{L}_{\infty,\omega}\cap L_\alpha$ and let $\equiv_\alpha$ be the corresponding elementary equivalence relation. Say that ...
Noah Schweber's user avatar
6 votes
0 answers
249 views

Number of models vs. complexity for SOL theories

This was previously asked at MSE without success. Suppose $T$ is a complete first-order theory with continuum-many countable models up to isomorphism. We define two sets of Turing degrees associated ...
Noah Schweber's user avatar
5 votes
0 answers
317 views

$\Sigma_n$-complete sets in the Levy hierarchy

Recall that a set $A \subseteq \mathbb N$ is (many-one, Turing) $\Sigma_n$-complete if it's $\Sigma_n$ and any other $\Sigma_n$ set (many-one, Turing) reduces to it. This definition actually makes ...
Corey Bacal Switzer's user avatar
3 votes
0 answers
143 views

Lindström's theorem part 2 for non-relativizing logics

By "logic" I mean the definition gotten by removing the relativization property from "regular logic" — see e.g. Ebbinghaus/Flum/Thomas — and adding the condition that for every ...
Noah Schweber's user avatar