BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Rayman (Iowa State University)
DTSTART:20261029T180000Z
DTEND:20261029T190000Z
DTSTAMP:20261025T111746Z
UID:OLS/223
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/223/">Ef
 fective Versions of Strong Measure Zero and Borel’s Conjecture</a>\nby M
 atthew Rayman (Iowa State University) as part of Online logic seminar\n\nI
 nteractive livestream: https://zoom.us/j/122323340\n\nAbstract\nIn this ta
 lk I will discuss effective versions of strong measure zero that have been
  developed for various levels of complexity and computability. Borel’s c
 onjecture that a set has strong measure zero if and only if it is countabl
 e is known to be independent of ZFC. I will go over effective versions of 
 Borel’s conjecture and show that they hold in time and space bounded lev
 els\, but not at the level of computability. \n\nI will also describe some
  properties of the effective strong measure zero sets and show that they h
 ave many equivalent characterizations. One of the main results being the e
 quivalence at the lower semicomputable level to the class NCR defined by R
 eimann and Slaman. I will also mention some similarities and differences b
 etween strong measure zero sets in effective and non-effective settings.\n
LOCATION:https://researchseminars.org/talk/OLS/223/
URL:https://zoom.us/j/122323340
END:VEVENT
END:VCALENDAR