OpenFrontiers
← Back to the index
OP-11837Status unassessedLogic and foundations

A first-order theory with intermediate isomorphism complexity — Problem 11.1

A first-order theory with intermediate isomorphism complexity — Problem 11.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

Editorial MSC2020 mapping of A first-order theory with intermediate isomorphism complexity — Problem 11.1. https://arxiv.org/html/2608.26628v2#S11.Thmproblem1 Not an author-supplied code.

Licensed source statementAs of 2608.26628v2; current status unassessedSource & evidence ↓

Problem statement

Problem 11.1.

Does there exist a complete first-order theory TT in a countable language such that = <B ≅↾Mod(T) <B =+=\ <_{B}\ \cong\restriction_{\mathrm{Mod}(T)}\ <_{B}\ =^{+}?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

  1. Su Gao

This question is about equivalence relations given by complete first-order theories. The question has been circulating in the community since early 2000s.

Consider a complete first order theory TT in a countable language. Let Mod(T)\mathrm{Mod}(T) be the Polish space of countable models of TT with universe ω\omega. Let ≅↾Mod(T)\cong\restriction_{\mathrm{Mod}(T)} denote the isomorphism relation on Mod(T)\mathrm{Mod}(T). Recall two basic equivalence relations in descriptive set theory:

== is the identity relation on R\mathbb{R};

=+=^{+} is the equivalence relation on Rω\mathbb{R}^{\omega} that (xn)n∈ω=+(yn)n∈ω(x_{n})_{n\in\omega}=^{+}(y_{n})_{n\in\omega} if they represent the same countable subset of reals, i.e., if

{xn ⁣:n∈ω}={yn ⁣:n∈ω}.\{x_{n}\colon n\in\omega\}=\{y_{n}\colon n\in\omega\}.

Also note the following fact:

Fact 11.1.

(1) There is a complete theory TT such that == is Borel bi-reducible to ≅↾Mod(T)\cong\restriction_{\mathrm{Mod}(T)}. For example, TT can be chosen as the theory of the equivalence relation on ω\omega with infinitely many equivalence classes of any finite size. (2) There is a complete theory T′T^{\prime} such that =+=^{+} is Borel bi-reducible to ≅↾Mod(T′)\cong\restriction_{\mathrm{Mod}(T^{\prime})}. For example, T′T^{\prime} can be chosen as the theory of infinitely many independent equivalence relations on ω\omega and every equivalence relation has infinitely many equivalence classes of any finite size.

So we have the following natural question:

Remark 11.2.

Note that = <B =+=\ <_{B}\ =^{+}, and there are equivalence relations strictly between them. For example, E0,E∞,E0ωE_{0},E_{\infty},E^{\omega}_{0}. So, they are natural candidates for the complexity of ≅↾Mod(T)\cong\restriction_{\mathrm{Mod}(T)} for some TT if the problem has a positive answer.

There have been some research (e.g. [1, 2, 3, 4]) on this problem and more generally on the isomorphism relation ≅↾Mod(T)\cong\restriction_{\mathrm{Mod}(T)} in the Borel reducibility sense. In particular, Dave Marker showed in [1] that if S(T)S(T) (the Stone space of TT-types) is uncountable, then TT is not an example for Problem 11.1.

Progress & source assessment

Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.

References
  1. [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; A first-order theory with intermediate isomorphism complexity — Problem 11.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.