BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.9//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://sal.cs.unibuc.ro
X-WR-CALDESC:Events for SECURITY & APPLIED LOGIC
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20180101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190328T100000
DTEND;TZID=UTC:20190328T120000
DTSTAMP:20260404T151633
CREATED:20190325T165404Z
LAST-MODIFIED:20190325T165404Z
UID:391-1553767200-1553774400@sal.cs.unibuc.ro
SUMMARY:Lindström's Theorems II
DESCRIPTION:Speaker:   Mihai Prunescu (University of Bucharest)  \n\nAbstract: Regular logic systems which are strictly stronger than the first order predicate calculus cannot satisfy in the same time Löwenheim-Skolem for statements and compacity (Lindström 1). Effectively presented such systems cannot satisfy in the same time Löwenheim-Skolem for statements and the condition that the set of generally valid sentences is recursively enumerable (Lindström 2). We sketch the proof that uses partial isomorphisms. \nReferences:\n[1] H.-D. Ebbinghaus\, J. Flum\, W. Thomas\, Mathematical Logic. Second edition\, Undergraduate Texts in Mathematics\, Springer\, 1996.
URL:https://sal.cs.unibuc.ro/event/lindstroms-theorems-ii/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
END:VCALENDAR