• Operational Semantics of Security Protocols II

    Facultatea de Matematica si Informatica, sala 202

    Speaker: Ioana Leustean (University of Bucharest) Abstract:  We continue our presentation on operational semantics of  security protocols, as developed in: C. Cremers, S. Mauw, Operational Semantics and Verification of Security

  • First-order logic and vagueness

    Facultatea de Matematica si Informatica, sala 202

    Speaker: Marian Calborean (University of Bucharest) Abstract: The Sorites paradox is usually studied as a propositional paradox. However, the general form of the Sorites is second-order, with three main features.

  • A quantitative analysis of the “Lion-Man” game

    Facultatea de Matematica si Informatica, sala Google

    Speaker: Ulrich Kohlenbach (Technische Universität Darmstadt) Title: A quantitative analysis of the “Lion-Man” game Abstract: We analyze, based on an interplay between ideas and techniques from logic and geometric analysis, a pursuit-evasion game. More

  • POSTPONED: Protocols in Dynamic Epistemic Logic

    Facultatea de Matematica si Informatica, sala 202

    POSTPONED UNTIL FURTHER NOTICE. Speaker: Alexandru Dragomir (University of Bucharest) Title: Protocols in Dynamic Epistemic Logic Abstract: Dynamic epistemic logics are useful in reasoning about knowledge and certain acts of learning

  • Formalizing Gödel’s System T in Lean

    Title: Formalizing Gödel's System T in Lean Speaker: Horațiu Cheval (University of Bucharest) Abstract: In 1958, Gödel introduced his functional interpretation as a method of reducing the consistency of first-order

  • Unwinding of proofs

    Title: Unwinding of proofs Speaker: Pedro Pinto (TU Darmstadt) Abstract: The unwinding of proofs program dates back to Kreisel in the fifties and rests on the following broad question: “What

  • Exponential Diophantine equations over ℚ 

    Title:  Exponential Diophantine equations over ℚ Speaker: Mihai Prunescu (University of Bucharest & IMAR) Abstract: In a previous exposition we have seen that the solvability over ℚ is undecidable for

  • Regular matching problems for infinite trees

    Title: Regular matching problems for infinite trees Speaker: Mircea Marin (West University of Timișoara) Abstract: We study the matching problem “∃σ:σ(L)⊆R?” where L and R are regular tree languages over finite ranked