Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a computability-theoretic ultrapower construction for algebraic structures in this 40-minute mathematical lecture. Begin with computable structures and examine their countable ultrapowers over cohesive sets of natural numbers, where cohesive sets serve as infinite, indecomposable collections with respect to computably enumerable sets. Learn how these cohesive sets function as ultrafilters, with cohesive power elements represented as equivalence classes of partial computable functions, resulting in countable structures unlike classical ultrapowers. Focus specifically on cohesive powers of fields, particularly number fields, and analyze their algebraic properties. Discover how the first-order theory of these cohesive powers relates to the original field, incorporating recent breakthrough results concerning Hilbert's Tenth Problem for rings of integers of number fields. Gain insights into the intersection of computability theory, model theory, and algebraic number theory through this advanced mathematical exploration.
