Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
Speaker: Horia Velicu (BRD - Groupe Societe Generale) Abstract: Presentation of topics of interest for 2020, objectives and data available at BRD. Proposals for the themes for the applied research …
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 …
Title: BLOCKCHAIN - More than a buzzword Speaker: Ionut-Daniel Dobos (MBN Technologies) Abstract: In this presentation we will take a look at the concept of a blockchain as a mean …
POSTPONED UNTIL FURTHER NOTICE. Speaker: Ioan Constantin (Orange Romania) Abstract: A brief walkthrough some of the challenges in offering advanced cyber security solutions for Business and Critical Infrastructures, from a …
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 …
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 …
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 …
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 …
Title: A proof mining case study on the unit interval Speaker: Andrei Sipoș (University of Bucharest & IMAR) Abstract: In 1991, Borwein and Borwein proved the following: if L>0, f …
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 …