BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//SECURITY & APPLIED LOGIC - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:SECURITY & APPLIED LOGIC
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:20191212T100000
DTEND;TZID=UTC:20191212T120000
DTSTAMP:20260425T175718
CREATED:20191125T084235Z
LAST-MODIFIED:20191211T053426Z
UID:524-1576144800-1576152000@sal.cs.unibuc.ro
SUMMARY:Operational Semantics of Security Protocols II
DESCRIPTION:Speaker: Ioana Leustean (University of Bucharest) \n\nAbstract:  We continue our presentation on operational semantics of  security protocols\, as developed in: \nC. Cremers\, S. Mauw\, Operational Semantics and Verification of Security Protocols\, Springer\, 2012.
URL:https://sal.cs.unibuc.ro/event/524/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20191219T100000
DTEND;TZID=UTC:20191219T120000
DTSTAMP:20260425T175718
CREATED:20191217T061235Z
LAST-MODIFIED:20191217T061235Z
UID:548-1576749600-1576756800@sal.cs.unibuc.ro
SUMMARY:First-order logic and vagueness
DESCRIPTION:Speaker: Marian Calborean (University of Bucharest) \n\nAbstract: The Sorites paradox is usually studied as a propositional paradox. However\, the general form of the Sorites is second-order\, with three main features. It doesn’t contain any arbitrary parameters. It can be used to generate the propositional Sorites by appropriate replacement of the second-order premise with arbitrary clauses. Finally\, it is generally nonfirstorderizable\, relying on the notion of transitive closure of a relation. However\, it can be expressed in FOL with a finite upper bound on the elements of the relation. This leads to a definition of vagueness in classical FOL\, using the interplay between a total preorder and a monadic predicate. A notational extension of FOL will introduce a vague structure formed by the predicate (e.g.tall)\, the broad predicate (e.g. broadly tall) and the strict predicate (e.g. strictly tall). It allows the failure of a weak non-contradiction (e.g. ‘Some men are both broadly tall and broadly short’)\, the failure of a weak LEM (e.g. ‘Some men are neither strictly tall nor strictly short`)\, and the truth of a non-paradoxical tolerance (e.g. ‘If a person of n cm is strictly tall\, a person of n-1 cm is broadly tall’). \nReferences:\n[1] P. Cobreros\, P. Egré\, D. Ripley\, R\, Van Rooij\, Tolerant\, Classical\, Strict\, Journal of Philosophical Logic 41 (2019)\, 347-385.\n[2] D. Graff\, Shifting Sands: An Interest-Relative Theory of Vagueness\, Philosophical Topics 28 (2000)\, 45-81.\n[3] U. Keller\, Some remarks on the definability of transitive closure in first-order logic and Datalog\, Internal report\, Digital Enterprise Research Institute (DERI)\, University of Innsbruck\, 2004.\n[4] K.G. Lucey\, he ancestral relation without classes\, Notre Dame Journal of Formal Logic 20 (1979)\, 281-284.
URL:https://sal.cs.unibuc.ro/event/first-order-logic-and-vagueness/
LOCATION:Facultatea de Matematica si Informatica\, sala 202
CATEGORIES:Logic Seminar
END:VEVENT
END:VCALENDAR