A proof mining case study on the unit interval
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 …
Loading view.
Seminar
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 …
An Introduction to Protocols in Dynamic Epistemic Logic
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 …
Kernelization, Proof Complexity and Social Choice
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 …