Master's program at the Faculty of Mathematics and Computer Science, University of Bucharest
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 …
Title: An Introduction to Protocols in Dynamic Epistemic Logic Speaker: Alexandru Dragomir (University of Bucharest) Abstract: Dynamic epistemic logics are useful in reasoning about knowledge and acts of learning, seen as …
Title: Kernelization, Proof Complexity and Social Choice Speaker: Gabriel Istrate (West University of Timișoara) Abstract: We display an application of the notions of kernelization and data reduction from parameterized complexity to proof …