中科院数学与系统科学研究院
数学研究所
数理逻辑讨论班
报告人：彭程（南开大学)
题 目：An introduction to infinite time decidable equivalence relation theory
时 间：2019.09.25（星期三）, 14:00--16:00
地 点：数学院南楼N902室
摘 要: Infinite time Turing machines were first studied and introduced by Hamkins, Kidder and Lewis. An infinite time analogue of Borel equivalence relation theory is the theory of equivalence relations that are decidable by an infinite time Turing machine, i.e., the Borel reductions are replaced by the infinite time computable reducibility. In this talk, we will introduce the basic idea of infinite time decidable equivalence relations and some interesting questions in this area.
