BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Noah Schweber (Proof School) DTSTART:20231012T180000Z DTEND:20231012T190000Z DTSTAMP:20260423T021357Z UID:OLS/141 DESCRIPTION:Title: Lo gic(s) in the computable context\nby Noah Schweber (Proof School) as p art of Online logic seminar\n\n\nAbstract\nIn abstract model theory\, ``lo gic" is typically defined as something like ``An indexed family of isomorp hism-respecting partitions of the class of all structures" - or more preci sely\, an assignment of such partitions to signatures (usually we demand s ome other conditions too). But we do not always think isomorphism-invarian tly\; in particular\, when thinking about computable structures we typical ly ``carve up" the universe into equivalence classes with respect to compu table isomorphism.\n\nIn this talk I'll explore what there is to be said a bout ``abstract model theory in the computable universe." One logic we'll pay particular attention to is gotten by mixing classical computable infin itary logic with the notion of realizability coming from intuitionistic ar ithmetic. This is work in progress\, so this talk will have lots of questi ons as well as results. No prior knowledge of intuitionistic logic will be assumed.\n LOCATION:https://researchseminars.org/talk/OLS/141/ END:VEVENT END:VCALENDAR