Penn Arts & Sciences Logo

Logic and Computation Seminar

Monday, March 18, 2019 - 3:30pm

Johanna Franklin



University of Pennsylvania


 R. Miller has introduced a method for defining an effective measure on the spaces of the isomorphism types of computable structures such as field extensions of the rationals and finitely branching trees. This allows us to determine whether certain properties of computable structures are null or conull for these classes. Furthermore, if a property is conull, we can often effectivize our answer and say that every random structure has this property for some notion of randomness. I will discuss the definitions of these measures and the applications of these ideas to the property of computable categoricity.