Initiated by the center’s students and researchers in 2019, the Tsinghua Logic Salon has quickly grown into a lively platform for try-outs and exchanges of new ideas. Researchers in various fields of logic are invited to present their latest research, as well as the challenges that they see. Every participant is encouraged to engage in discussions and exchange of perspectives. Each session lasts for 1.5 hours in total, with 30 minutes of discussion included.
Organizing Committee (from September 2023): Junhua Yu, Chenwei Shi, Wei Wang, Jialiang Yan, Penghao Du.
■Schedule for 2023-2024 academic year
| Date | Speaker |
|---|---|
| 2024 SEP 04 | Thomas Studer |
| 2024 SEP 12 | Yuan Xu |
■Current Events
2024 Sep 12 16:00-17:30 徐源 (北京理工大学) 人工智能前沿技术及其社会应用
当前，人工智能技术的飞速发展深刻的影响着社会变革，在赋能千行百业的同时，也为社会科学领域带来了前所未有的机遇。尤其是以大模型为代表的生成式人工智能展现出了强大的能力，这些技术不仅在社会科学的理论研究中开辟了新领域，还为解决复杂社会问题提供了新的工具。本次报告，将从人工智能、哲学、传播学等跨学科视角来探讨人工智能前沿技术、行业最新的典型应用，以及其中带来的安全和伦理问题，旨在引起大家的讨论，启发对于人工智能前沿技术向前的想象力和向后的反思力。
2024 Sep 04 16:00-17:00 Thomas Studer (University of Bern) Non-wellfounded and cyclic proofs
Non-wellfounded and cyclic proofs provide a formal counterpart to proofs by infinite descent. So, proofs of this kind are helpful for logics dealing with inductive (and coinductive) definitions. This includes systems of arithmetic (induction over the natural numbers) and modal logics with fixed points (common knowledge and temporal operators). In this talk, I will introduce non-wellfounded and cyclic proofs and study their proof-theoretic properties.
■Past Events
Click HERE to check the past events.
