The post Logic Seminar talk: Quantum Randomness first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Quantum Randomness appeared first on Institute for Logic and Data Science.

]]>**Title**: Quantum Randomness

**Abstract**:

Random digits are used hundreds of billions of times a day to encrypt data in electronic networks. From where do they come? Die rolls? Computer programs? The digits of pi? Beam splitters? Are these numbers equally random? Are quantum random bits truly/perfect random? How can we know whether a string of digits is random? How good are quantum random number generators? Have these questions been selected at random?

The talk will take place physically at FMI (Academiei 14), Hall 214 “Google”.

The post Logic Seminar talk: Quantum Randomness first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Quantum Randomness appeared first on Institute for Logic and Data Science.

]]>The post ILDS-FMI Coq and Lean Autumn School 2023 — 18-20 September 2023 first appeared on Institute for Logic and Data Science.

The post ILDS-FMI Coq and Lean Autumn School 2023 — 18-20 September 2023 appeared first on Institute for Logic and Data Science.

]]>The ILDS-FMI Coq and Lean Autumn School 2023 aims to introduce potential students to the Coq and Lean proof assistants, as well as to the theoretical underpinnings of interactive theorem proving. It is the second school on interactive theorem proving organized in Bucharest, following the ICUB Coq Autumn School, which was held in September 2018.

The event will be co-located with FROM 2023.

We are grateful for the generous support of our sponsors:

We are looking forward to seeing you in Bucharest!

The post ILDS-FMI Coq and Lean Autumn School 2023 — 18-20 September 2023 first appeared on Institute for Logic and Data Science.

The post ILDS-FMI Coq and Lean Autumn School 2023 — 18-20 September 2023 appeared first on Institute for Logic and Data Science.

]]>The post FROM 2023 (Working Formal Methods Symposium) — 21-22 September 2023 first appeared on Institute for Logic and Data Science.

The post FROM 2023 (Working Formal Methods Symposium) — 21-22 September 2023 appeared first on Institute for Logic and Data Science.

]]>FROM aims to bring together researchers and practitioners who work on formal methods by contributing new theoretical results, methods, techniques, and frameworks, and/or by creating or using software tools that apply theoretical contributions. Formal methods emphasise the use of mathematical techniques and rigour in developing software and hardware. They can be used to specify, verify, and analyse systems at any stage in their life cycle: requirements engineering, modeling, design, architecture, implementation, testing, maintenance and evolution. This assumes on one hand the development of adequate mathematical methods and frameworks and on the other hand the development of tools that help the user effectively apply these methods and frameworks.

This event will be co-located with the ILDS-FMI Coq and Lean Autumn School 2023.

We are grateful for the generous support of our sponsors, BRD and Runtime Verification:

We are looking forward to seeing you in Bucharest!

The post FROM 2023 (Working Formal Methods Symposium) — 21-22 September 2023 first appeared on Institute for Logic and Data Science.

The post FROM 2023 (Working Formal Methods Symposium) — 21-22 September 2023 appeared first on Institute for Logic and Data Science.

]]>The post Proof Mining Seminar talk: The strange case of Dykstra’s algorithm first appeared on Institute for Logic and Data Science.

The post Proof Mining Seminar talk: The strange case of Dykstra’s algorithm appeared first on Institute for Logic and Data Science.

]]>**Title**: The strange case of Dykstra’s algorithm

**Abstract**:

In this talk we discuss the proof mining treatment of the strong convergence of Dykstra’s algorithm.

Halpern’s iterative method is probably the most common approach to strongly approximate fixed points of nonexpansive maps. The canonical proof (pliable to many other results) establishing strong convergence of the iteration relies on a crucial use of sequential weak compactness. It is well-understood how a proof-theoretical approach allows for the elimination of the compactness arguments via bounded collection principles, thus allowing for simple quantitative data in the analysis of such proofs.

Here, we focus on a different iterative method. Generalizing the alternating projection method, Dykstra’s algorithm strongly approximates the optimal solution of the convex feasibility problem. Similarly to Halpern, the strong convergence of Dykstra’s method makes crucial uses of compactness principles substantiated by arithmetical comprehension. Yet, as the iterative schema has no connection with Halpern’s definition and the proof follows a completely different structure, it was not known whether the removal of the compactness arguments would be possible and thus, a priori, we were only guaranteed to obtain quantitative data defined by bar-recursive functionals. Strikingly, still here, it was possible to bypass the use of arithmetical comprehension and bar-recursive functionals. We will discuss the recent quantitative analysis of Dykstra’s convergence proof and explain how it was possible to avoid the compactness principles crucial in the original proof.

**References**:

[1] P. Pinto, On the finitary content of Dykstra’s cyclic projections algorithm. arXiv:2306.09791 [math.OC], 2023.

**Google Meet link**: https://meet.google.com/xwm-syvx-bbr

The post Proof Mining Seminar talk: The strange case of Dykstra’s algorithm first appeared on Institute for Logic and Data Science.

The post Proof Mining Seminar talk: The strange case of Dykstra’s algorithm appeared first on Institute for Logic and Data Science.

]]>The post New Type Theory Working Seminar first appeared on Institute for Logic and Data Science.

The post New Type Theory Working Seminar appeared first on Institute for Logic and Data Science.

]]>The seminar will be held at the Institute for Logic and Data Science (Popa Tatu 18).

The first meeting will be held on July 10, 2023 at 11:00.

More information will be available in time on the seminar page.

The post New Type Theory Working Seminar first appeared on Institute for Logic and Data Science.

The post New Type Theory Working Seminar appeared first on Institute for Logic and Data Science.

]]>The post Logic Seminar talk: Reasoning by brute force II first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Reasoning by brute force II appeared first on Institute for Logic and Data Science.

]]>**Title**: Reasoning by brute force II. Implementing a natural deduction proof calculator for monadic predicate logic with minimal heuristics

**Abstract**:

One result of the ‘Logic and software’ elective course held at the Faculty of Philosophy, University of Bucharest was the interactive development of a natural deduction calculator that successfully proves exercises in classical textbooks. The calculator has versions in Python and PHP, both common programming languages, allowing the easy study and change of the software code corresponding to NK rules. It also uses brute force – running allowable rules until the conclusion is derived, then retracing the steps to display the shortest path to it; no backwards reasoning techniques were used. Since computational complexity required speed optimizations, a demonstration of their soundness and completeness is sketched.

The talk will take place physically at FMI (Academiei 14), Hall 214 “Google”.

The post Logic Seminar talk: Reasoning by brute force II first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Reasoning by brute force II appeared first on Institute for Logic and Data Science.

]]>The post Logic Seminar talk: Does every computably enumerable set admit a univocal Diophantine specification? first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Does every computably enumerable set admit a univocal Diophantine specification? appeared first on Institute for Logic and Data Science.

]]>**Title**: Does every computably enumerable set admit a univocal Diophantine specification?

For the abstract and references, see this file.

**Google Meet link**: https://meet.google.com/xwm-syvx-bbr

The post Logic Seminar talk: Does every computably enumerable set admit a univocal Diophantine specification? first appeared on Institute for Logic and Data Science.

The post Logic Seminar talk: Does every computably enumerable set admit a univocal Diophantine specification? appeared first on Institute for Logic and Data Science.

]]>The post Logic Seminar (joint with the TCS Seminar) talk: Local Codes for Insertion and Deletion Errors first appeared on Institute for Logic and Data Science.

The post Logic Seminar (joint with the TCS Seminar) talk: Local Codes for Insertion and Deletion Errors appeared first on Institute for Logic and Data Science.

]]>**Title**: Local Codes for Insertion and Deletion Errors

**Abstract**:

Locally Decodable Codes (LDCs) are error-correcting codes for which individual message symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors have been studied extensively in the past few decades, where a major goal is to understand the amount of redundancy that is necessary and sufficient to decode from large amounts of error.

In this talk I will describe our recent results on LDCs and their variants, when the errors are in the form of insertions and deletions (a.k.a. synchronization errors), rather than classical Hamming errors. Local codes against insertions and deletions are well-motivated by recent progress on DNA storage technologies. I will conclude with several open problems. The talk will be self-contained. (Based on joint work with Alex Block, Jeremiah Blocki, Kuan Cheng, Shubhang Kulkarni, Xin Li, Yu Zheng, Minshen Zhu.)

The talk will take place physically at FMI (Academiei 14), Council Hall.

The post Logic Seminar (joint with the TCS Seminar) talk: Local Codes for Insertion and Deletion Errors first appeared on Institute for Logic and Data Science.

The post Logic Seminar (joint with the TCS Seminar) talk: Local Codes for Insertion and Deletion Errors appeared first on Institute for Logic and Data Science.

]]>The post Special Edition of the Blockchain Seminar in collaboration with Endava România first appeared on Institute for Logic and Data Science.

The post Special Edition of the Blockchain Seminar in collaboration with Endava România appeared first on Institute for Logic and Data Science.

]]>The post Special Edition of the Blockchain Seminar in collaboration with Endava România first appeared on Institute for Logic and Data Science.

The post Special Edition of the Blockchain Seminar in collaboration with Endava România appeared first on Institute for Logic and Data Science.

]]>The post Proof Mining Seminar talk: The Tikhonov-Mann iteration for families of mappings first appeared on Institute for Logic and Data Science.

The post Proof Mining Seminar talk: The Tikhonov-Mann iteration for families of mappings appeared first on Institute for Logic and Data Science.

]]>**Title**: The Tikhonov-Mann iteration for families of mappings

**Abstract**: We present recent results from [4], in which we generalize the strongly convergent Krasnoselskii-Mann-type iteration defined by Boț and Meier in [1] for finding a common fixed point of a family of nonexpansive operators from Hilbert spaces to the abstract setting of W-hyperbolic spaces, and we compute effective rates of asymptotic regularity for it. This extends at the same time results on the Tikhonov-Mann iteration obtained recently with Ulrich Kohlenbach and Laurențiu Leuștean [2, 3] from single mappings to families of mappings.

**References**:

[1] R.I. Boț, and D. Meier. A strongly convergent Krasnosel’skii–Mann-type algorithm for finding a common fixed point of a countably infinite family of nonexpansive operators in Hilbert spaces. *Journal of Computational and Applied Mathematics*, 395:113589, 2021.

[2] H. Cheval, U. Kohlenbach, and L. Leuștean. On modified Halpern and Tikhonov-Mann iterations. *Journal of Optimization Theory and Applications*, 197:233–251, 2023.

[3] H. Cheval and L. Leuștean. Quadratic rates of asymptotic regularity for the Tikhonov-Mann iteration. *Optimization Methods and Software*, 37(6):2225–2240, 2022.

[4] H. Cheval. Rates of asymptotic regularity of the Tikhonov-Mann iteration for families of mappings. arXiv:2304.11366 [math.OC], 2023.

**Google Meet link**: https://meet.google.com/xwm-syvx-bbr

The post Proof Mining Seminar talk: The Tikhonov-Mann iteration for families of mappings first appeared on Institute for Logic and Data Science.

The post Proof Mining Seminar talk: The Tikhonov-Mann iteration for families of mappings appeared first on Institute for Logic and Data Science.

]]>