中央研究院 資訊科學研究所

活動訊息

友善列印

列印可使用瀏覽器提供的(Ctrl+P)功能

學術演講

:::

應用邏輯討論會系列 (XXXVIII) - Asser's conjecture and descriptive complexity theory

  • 講者陳偉松 教授 (國立臺灣大學資訊工程學系)
    邀請人:廖純中
  • 時間2018-03-23 (Fri.) 15:30 ~ 17:30
  • 地點資訊所舊館108演講廳
摘要

In 1951, Scholz defined the notion of first-order spectra, and immediately after, in 1955, Asser asked a seemingly innocent question whether first-order spectra are closed under complement. It was rather surprising that in 1970's Jones, Selman and Fagin showed that Asser's question is indeed equivalent to the question NE vs. co-NE. In this talk we will briefly review the connection between Asser's conjecture and descriptive complexity theory. We will also highlight some recent results.