Forum Problem Lists Definitions FAQ

18.18 (2014)

Open

Mal’cev proved that the set of sentences that hold in all finite groups is not computably enumerable, although its complement is. Is it true that both the set of sentences that hold in almost all finite groups and its complement are not computably enumerable?

Contributor: O. V. Belegradek

Comments

All comments are the responsibility of the user. Comments appearing on this page are not verified for correctness. Please keep posts mathematical and on topic. If you want to submit a proof (or a partial proof), please use the dedicated proof submission form rather than posting it in the comments.
Order by newest first or oldest first.

No comments yet. Be the first to comment.

Proof claims

Proof claims are the responsibility of the submitter. Appearance here does not mean the claim has been checked for mathematical correctness. Moderators only screen for spam, abuse, and obviously low-effort submissions.

No proof claims yet.