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:20261117T013341Z
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\n\
 nAbstract\nIn this talk I will discuss effective versions of strong measur
 e zero that have been developed for various levels of complexity and compu
 tability. Borel’s conjecture that a set has strong measure zero if and o
 nly if it is countable is known to be independent of ZFC. I will go over e
 ffective versions of Borel’s conjecture and show that they hold in time 
 and space bounded levels\, but not at the level of computability. \n\nI wi
 ll also describe some properties of the effective strong measure zero sets
  and show that they have many equivalent characterizations. One of the mai
 n results being the equivalence at the lower semicomputable level to the c
 lass NCR defined by Reimann and Slaman. I will also mention some similarit
 ies and differences between strong measure zero sets in effective and non-
 effective settings.\n
LOCATION:https://researchseminars.org/talk/OLS/223/
END:VEVENT
END:VCALENDAR
