The pattern of consistency strength for membership in a computably enumerable set 0 ▲ Joel David Hamkins 1 hour ago · Science · hide · 0 comments Joel David Hamkins and Atticus Stonestrom, “The pattern of consistency strength for membership in a computably enumerable set,” preprint. arxiv:2610.24919. Abstract. Every computable preorder relation on the natural numbers is the order of consistency strength for the membership assertions “$n\in … Continue reading → No comments yet. Log in to reply on the Fediverse. Comments will appear here.
